Results 1 to 10 of about 1,416 (297)

Lattice-Based Cryptography in the Quantum Era: A Survey

open access: diamondInterfases, 2023
The advent of quantum computing reveals current classical cryptography’s incapacity to withstand attacks within the new paradigm. Quantum algorithms break such encryption with impressive ease, with Shor and Grover algorithms being the main perpetrators ...
Mauricio Cisneros, Javier Olazabal
doaj   +4 more sources

Symbolic Proofs for Lattice-Based Cryptography [PDF]

open access: bronzeProceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, 2018
Symbolic methods have been used extensively for proving security of cryptographic protocols in the Dolev-Yao model, and more recently for proving security of cryptographic primitives and constructions in the computational model. However, existing methods for proving security of cryptographic constructions in the computational model often require ...
Gilles Barthe   +5 more
openalex   +5 more sources

Improved Plantard Arithmetic for Lattice-based Cryptography

open access: yesTransactions on Cryptographic Hardware and Embedded Systems, 2022
This paper presents an improved Plantard’s modular arithmetic (Plantard arithmetic) tailored for Lattice-Based Cryptography (LBC). Based on the improved Plantard arithmetic, we present faster implementations of two LBC schemes, Kyber and NTTRU, running ...
Junhao Huang   +6 more
doaj   +4 more sources

Some Recent Progress in Lattice-Based Cryptography [PDF]

open access: bronze, 2009
The past decade in computer science has witnessed tremendous progress in the understanding of lattices , which are a rich source of seemingly hard computational problems. One of their most promising applications is to the design of cryptographic schemes that enjoy exceptionally strong security guarantees and other desirable properties. Most notably,
Chris Peikert
openalex   +2 more sources

The Mathematical Foundation of Post-Quantum Cryptography [PDF]

open access: yesResearch
In 1994, P. Shor discovered quantum algorithms that can break both the RSA cryptosystem and the ElGamal cryptosystem. In 2007, a Canadian company D-Wave demonstrated the first quantum computer.
Chuanming Zong
doaj   +2 more sources

Exploiting the Central Reduction in Lattice-Based Cryptography

open access: yesIEEE Access
This paper questions the side-channel security of central reduction technique, which is widely adapted in efficient implementations of Lattice-Based Cryptography (LBC).
Tolun Tosun, Amir Moradi, Erkay Savas
doaj   +3 more sources

New bounds of the smoothing parameter for lattices. [PDF]

open access: yesPLoS ONE
The smoothing parameter on lattices is crucial for lattice-based cryptographic design. In this study, we establish a new upper bound for the lattice smoothing parameter, which represents an improvement over several significant classical findings. For one-
Heng Guo   +3 more
doaj   +2 more sources

Error Samplers for Lattice-Based Cryptography -Challenges, Vulnerabilities and Solutions [PDF]

open access: green2018 IEEE Asia Pacific Conference on Circuits and Systems (APCCAS), 2018
Lattice based cryptography (LBC) stands out today as one of the most promising types of post-quantum cryptography, and a strong contender in the ongoing NIST post-quantum cryptography standardisation process. LBC algorithms are advantageous due to their efficiency, versatility and the hardness of their underlying lattice problems.
Ayesha Khalid   +5 more
openalex   +7 more sources

Attacking and Defending Masked Polynomial Comparison for Lattice-Based Cryptography [PDF]

open access: yesTransactions on Cryptographic Hardware and Embedded Systems, 2021
In this work, we are concerned with the hardening of post-quantum key encapsulation mechanisms (KEM) against side-channel attacks, with a focus on the comparison operation required for the Fujisaki-Okamoto (FO) transform.
Shivam Bhasin   +4 more
doaj   +4 more sources

Home - About - Disclaimer - Privacy