Sökning: "Boolean circuits."

Visar resultat 1 - 5 av 7 uppsatser innehållade orden Boolean circuits..

1. 1. Automated Generation of EfficientBitslice Implementations forArbitrary Sboxes

   Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

   Författare :Augustin Bariant; [2023]
   Nyckelord :Bitslicing; Cryptography; Whitebox; Compilation; Boolean circuits.; Parallélisation au bit; Cryptographie; Boîte blanche; Compilation; Circuits booléens.; Bitslicing; Kryptografi; Vit låda; Kompilering; Booleska kretsar.;

   Sammanfattning : Whitebox cryptography aims at protecting standard cryptographic algorithmsthat execute in attacker-controlled environments. In these, the attacker is ableto read a secret key directly from memory. Common implementations mask alldata at runtime and operate on masked data by using many small precomputedtables. LÄS MER

3. 2. Evaluating performance of homomorphic encryption applied on delta encoding

   Master-uppsats, Linköpings universitet/Databas och informationsteknik

   Författare :János Richard Dani; [2022]
   Nyckelord :homomorphic encryption; delta encoding; performance test;

   Sammanfattning : Homomorphic encryption is an encryption scheme that allows for simple operations on encrypted data. These operations are mainly boolean circuits combined into more complexarithmetic operations, rotations, and others. Homomorphic encryption was first implemented in 2009, and in the following decade, many different versions emerged. LÄS MER

4. 3. Testsystem av kontrollsystem för klystronmodulatorer

   Uppsats för yrkesexamina på grundnivå, Uppsala universitet/Signaler och System

   Författare :Oscar Fällman; Daniel Jönsson; [2016]
   Nyckelord :Test system; LabVIEW; TwinCAT; EtherCAT; Testsystem; LabVIEW; TwinCAT; EtherCAT;

   Sammanfattning : The company, ScandiNova Systems, has had a need for a test system that can automate and optimize fault detection of the digitizer circuit in the control system of their klystron modulators. This thesis work is intended for this need with the aim of constructing a test system built in LabVIEW, and a pulse generator to generate stimulation for the digitizer circuit board. LÄS MER

5. 4. A comparison of reductions from FACT to CNF-SAT

   Kandidat-uppsats, KTH/Skolan för datavetenskap och kommunikation (CSC)

   Författare :John Eriksson; Jonas Höglund; [2014]
   Nyckelord :;

   Sammanfattning : The integer factorisation problem (FACT) is a well-known number-theoreticproblem, with many applications in areas such as cryptography. An instanceof a FACT problem (a number n such that n = p × q) can be reduced to aninstance of the conjunctive normal form boolean satisfiability problem (CNF-SAT), a well-known NP-complete problem. LÄS MER

7. 5. A comparison of reductions from FACT to CNF-SAT

   Kandidat-uppsats, KTH/Skolan för datavetenskap och kommunikation (CSC)

   Författare :JOHN ERIKSSON; JONAS HÖGLUND; [2014]
   Nyckelord :;

   Sammanfattning : The integer factorisation problem (FACT) is a well-known number-theoreticproblem, with many applications in areas such as cryptography. An instanceof a FACT problem (a number n such that n = p × q) can be reduced to aninstance of the conjunctive normal form boolean satisfiability problem (CNFSAT),a well-known NP-complete problem. LÄS MER