Results 11 to 20 of about 18,842 (275)
The Number Theoretic Transform (NTT) has been widely used to speed up polynomial multiplication in lattice-based post-quantum algorithms. All NTT operands use modular arithmetic, especially modular multiplication, which significantly influences NTT ...
Trong-Hung Nguyen +2 more
doaj +3 more sources
Ring Learning With Errors: A crossroads between postquantum cryptography, machine learning and number theory [PDF]
The present survey reports on the state of the art of the different cryptographic functionalities built upon the ring learning with errors problem and its interplay with several classical problems in algebraic number theory.
Chacón, Iván Blanco
core +2 more sources
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 = (
+4 more sources
Secure and Efficient Code-Based Cryptography for Multi-Party Computation and Digital Signatures
Code-based cryptography is a promising candidate for post-quantum cryptography due to its strong security guarantees and efficient implementations. In this paper, we explore the use of code-based cryptography for multi-party computation and digital ...
Abdellatif Kichna, Abderrazak Farchane
doaj +1 more source
Post-quantum cryptography Algorithm's standardization and performance analysis
-Quantum computer is no longer a hypothetical idea. It is the world's most important technology and there is a race among countries to get supremacy in quantum technology.
Manish Kumar
doaj +1 more source
A Mathematical Perspective on Post-Quantum Cryptography
In 2016, the National Institute of Standards and Technology (NIST) announced an open competition with the goal of finding and standardizing suitable algorithms for quantum-resistant cryptography.
Maximilian Richter +3 more
doaj +1 more source
Post-quantum identity-based authenticated multiple key agreement protocol
Authenticated multiple key agreement (AMKA) protocols provide participants with multiple session keys after one round of authentication. Many schemes use Diffie-Hellman or authenticated key agreement schemes that rely on hard integer factorizations that ...
Yang Yang +3 more
doaj +1 more source
Lattice-Based Cryptography [PDF]
We describe some of the recent progress on lattice-based cryptography, starting from the seminal work of Ajtai, and ending with some recent constructions of very efficient cryptographic schemes.
openaire +3 more sources
Tensor-based trapdoors for CVP and their application to public key cryptography [PDF]
We propose two trapdoors for the Closest-Vector-Problem in lattices (CVP) related to the lattice tensor product.
Fischlin, Roger, Seifert, Jean-Pierre
core +2 more sources

