Results 1 to 10 of about 18,897 (311)

Lattice-Based Cryptography [PDF]

, 2022
AbstractLet $$\mathbb {R}^n$$ R n be an n-dimensional Euclidean space and $$x=(x_1, x_2, \ldots , x_n)\in \mathbb {R}^n$$ x = (
Zhiyong Zheng
  +5 more sources

Computational Differential Privacy from Lattice-Based Cryptography [PDF]

, 2018
arXiv admin note: substantial text overlap with arXiv:1507 ...
Filipp Valovich, Francesco Aldà
openalex   +4 more sources

Gaussian Sampling in Lattice Based Cryptography [PDF]

Tatra Mountains Mathematical Publications, 2014
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   +2 more sources

The Ring-LWE Problem in Lattice-Based Cryptography: The Case of Twisted Embeddings. [PDF]

Entropy (Basel), 2021
Ortiz JN, de Araujo RR, Aranha DF, Costa SIR, Dahab R.   +4 more
europepmc   +3 more sources

Embedded lattice-based cryptography

, 2022
A quantum computer powerful enough to run Shor's algorithm could emerge and thus threaten the security provided by the currently deployed asymmetric cryptography. Such a computer can break the entire cryptography based on the hardness of integer factorization or discrete logarithm.
Simon Montoya
openalex   +3 more sources

The Mathematical Foundation of Post-Quantum Cryptography [PDF]

Research
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

IEEE 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   +2 more sources

Programmable Accelerators for Lattice-based Cryptography

, 2020
advances in computing steadily erode computer security at its foundation, calling for fundamental innovations to strengthen the weakening cryptographic primitives and security protocols. While many alternatives have been proposed for symmetric key cryptography and related protocols (e.g., lightweight ciphers and authenticated encryption), the ...
Hamid Nejatollahi
openalex   +3 more sources

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

PLoS 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, Fengxia Liu, Linlin Wang, Kun Tian   +3 more
doaj   +2 more sources

Preface to special topic on lattice-based cryptography. [PDF]

Natl Sci Rev, 2021
Yu Y.
europepmc   +4 more sources