Results 11 to 20 of about 211,169 (330)
Some Recent Progress in Lattice-Based Cryptography [PDF]
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
Notes on Lattice-Based Cryptography [PDF]
Asymmetrisk kryptering er avhengig av antakelsen om at noen beregningsproblemer er vanskelige å løse. I 1994 viste Peter Shor at de to mest brukte beregningsproblemene, nemlig det diskrete logaritmeproblemet og primtallsfaktorisering, ikke lenger er ...
Budroni, Alessandro
core +2 more sources
On Practical Discrete Gaussian Samplers for Lattice-Based Cryptography [PDF]
Lattice-based cryptography is one of the most promising branches of quantum resilient cryptography, offering versatility and efficiency. Discrete Gaussian samplers are a core building block in most, if not all, lattice-based cryptosystems, and optimised samplers are desirable both for high-speed and low-area applications.
James Howe+4 more
semanticscholar +5 more sources
Attacking and Defending Masked Polynomial Comparison for Lattice-Based Cryptography
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 +2 more sources
Implementing Lattice-Based Cryptography [PDF]
The thesis is about implementation of LWE/MLWE encryption schemes in C++ and the use of the Number Theoretic Transform (NTT) in order to get faster mul- tiplication operations over certain rings.
Rodríguez Rodríguez, Alejandro Royher
core +2 more sources
Gaussian Sampling in Lattice Based Cryptography [PDF]
Abstract Modern lattice-based cryptosystems require sampling from discrete Gaussian distributions. We review lattice based schemes and collect their requirements for sampling from discrete Gaussians. Then we survey the algorithms implementing such sampling and assess their practical performance.
János Folláth
openalex +3 more sources
Time-memory trade-off in Toom-Cook multiplication: an application to module-lattice based cryptography [PDF]
Since the introduction of the ring-learning with errors problem, the number theoretic transform (NTT) based polynomial multiplication algorithm has been studied extensively.
Jose Maria Bermudo Mera+2 more
openalex +2 more sources
Lattice-Based Cryptography in the Quantum Era: A Survey
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 +3 more sources
Lattice-based Cryptography for IoT in A Quantum World: Are We Ready? [PDF]
The impending realization of scalable quantum computers has led to active research in Post Quantum Cryptography (PQC). The challenge is harder for embedded IoT (edge) devices, due to their pervasive diffusion in today’s world as well as their stricter ...
Ayesha Khalid+3 more
openalex +2 more sources