Sökning: "LWE"

Hittade 3 avhandlingar innehållade ordet LWE.

  1. 1. Some Notes on Post-Quantum Cryptanalysis

    Författare :Erik Mårtensson; Institutionen för elektro- och informationsteknik; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Cryptography; Post-quantum cryptography; LWE; BKW; Cryptanalysis; Lattice sieving; SVP; Lattice-based cryptography; Code-based cryptography;

    Sammanfattning : Cryptography as it is used today relies on a foundational level on the assumptionthat either the Integer Factoring Problem (IFP) or the DiscreteLogarithm Problem (DLP) is computationally intractable. In the 1990s PeterShor developed a quantum algorithm that solves both problems in polynomialtime. LÄS MER

  3. 2. Side-Channel Analysis of Post-Quantum Cryptographic Algorithms

    Författare :Kalle Ngo; Johnny Öberg; Ingo Sander; Elena Dubrova; Lejla Batina; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Side-channel attack; Post-quantum cryptography; Deep learning; LWE LWR-based KEM; Hardware security; Sidokanalsattack; Postkvantkryptering; Djupinlärning; LWE LWR-baserad KEM; Hårdvarusäkerhet; Informations- och kommunikationsteknik; Information and Communication Technology;

    Sammanfattning : Public key cryptographic schemes used today rely on the intractability of certain mathematical problems that are known to be efficiently solvable with a large-scale quantum computer. To address the need for long-term security, in 2016 NIST started a project for standardizing post-quantum cryptography (PQC) primitives that rely on problems not known to be targets for a quantum computer, such as lattice problems. LÄS MER

  4. 3. Using Coding Techniques for Attacking Post-Quantum Cryptographic Assumptions and Systems

    Författare :Qian Guo; Institutionen för elektro- och informationsteknik; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY;

    Sammanfattning : Post-quantum cryptography for resisting possible attacks from malicious quantum adversaries has become one of the key topics in recent cryptographic research. Its ultimate goal is to search for efficient and secure primitives replacing the factoring- and discrete log-based schemes in service that will be broken in polynomial time by Shor’s algorithm. LÄS MER