Essays about: "Boolean circuits."

Found 5 essays containing the words Boolean circuits..

  1. 1. Automated Generation of EfficientBitslice Implementations forArbitrary Sboxes

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Augustin Bariant; [2023]
    Keywords : 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.;

    Abstract : 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. READ MORE

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

    University essay from Linköpings universitet/Databas och informationsteknik

    Author : János Richard Dani; [2022]
    Keywords : homomorphic encryption; delta encoding; performance test;

    Abstract : 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. READ MORE

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

    University essay from KTH/Skolan för datavetenskap och kommunikation (CSC)

    Author : John Eriksson; Jonas Höglund; [2014]
    Keywords : ;

    Abstract : 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. READ MORE

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

    University essay from KTH/Skolan för datavetenskap och kommunikation (CSC)

    Author : JOHN ERIKSSON; JONAS HÖGLUND; [2014]
    Keywords : ;

    Abstract : 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. READ MORE

  6. 5. AIG Rewriting Using 5-Input Cuts

    University essay from KTH/Skolan för informations- och kommunikationsteknik (ICT)

    Author : Nan Li; [2011]
    Keywords : ;

    Abstract : Rewriting is a common approach to logic optimization based on local transformations. Most commercially available logic synthesis tools include a rewriting engine that may be used multiple times on the same netlist during optimization. This thesis presents an And-Inverter graph based rewriting algorithm using 5-input cuts. READ MORE