Results 21 to 30 of about 453,861 (108)
Acceleration of a Classic McEliece Postquantum Cryptosystem With Cache Processing
The NIST Post-Quantum Cryptography standardization process is in its fourth round, with a first KEM standard based on LWE and three candidates based on ECCs. These primitives implementation are designed to be optimal on classical hardware architecture targets.
Nugier, Cyrius, Migliore, Vincent
openaire +4 more sources
On McEliece-Type Cryptosystems Using Self-Dual Codes With Large Minimum Weight
One of the Round 3 Finalists in the NIST post-quantum cryptography call is the Classic McEliece cryptosystem. Although it is one of the most secure cryptosystems, the large size of its public key remains a practical limitation. In this work, we propose a
Luca Mariot, Stjepan Picek
exaly +3 more sources
Quantum algorithms for attacking hardness assumptions in classical and post‐quantum cryptography
Abstract In this survey, the authors review the main quantum algorithms for solving the computational problems that serve as hardness assumptions for cryptosystem. To this end, the authors consider both the currently most widely used classically secure cryptosystems, and the most promising candidates for post‐quantum secure cryptosystems.
J.‐F. Biasse +4 more
wiley +1 more source
An asymmetric cryptography using Gaussian integers
In this paper, the already strong McEliece cryptosystem is enhanced with atwo-dimensional finite Gaussian integer. By substituting the one-dimensional linear code with atwo-dimensional code employing afinite Gaussian integer, anew system ...
Wanarat Juraphanthong +1 more
doaj +1 more source
Improved lattice enumeration algorithms by primal and dual reordering methods
Abstract The security of lattice‐based cryptosystems is generally based on the hardness of the Shortest Vector Problem (SVP). The original enumeration (ENUM) algorithm solving SVP runs in exponential time due to the exhaustive search, which is used as a subroutine for the block Korkin–Zolotarev (BKZ) algorithm.
Kazuki Yamamura +2 more
wiley +1 more source
A Primer on Underwater Quantum Key Distribution
The growing importance of underwater networks (UNs) in mission‐critical activities at sea enforces the need for secure underwater communications (UCs). Classical encryption techniques can be used to achieve secure data exchange in UNs. However, the advent of quantum computing will pose threats to classical cryptography, thus challenging UCs. Currently,
Pietro Paglierani +6 more
wiley +1 more source
Key encapsulation mechanism based on polar codes
Abstract This paper introduces a key encapsulation mechanism based on polar codes, called as KEM‐PC, with secure and efficient key generation, encapsulation and decapsulation algorithms. In the proposed KEM‐PC, the ephemeral public encapsulation and secret decapsulation keys, which are generated at each key exchange session, are employed.
Reza Hooshmand, Mahdi Khoshfekr
wiley +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
Water color is an important representation reflecting the characteristics of its quality in inland lakes or ponds; however, sufficient water color image samples are often difficult to obtain due to the limitation of fishery production. For few color image samples, the existing data enhancement methods based on the depth generation model have the ...
Zan Yang +4 more
wiley +1 more source
Crystals‐Dilithium is one of the digital‐signature algorithms in NIST’s ongoing post‐quantum cryptography (PQC) standardization final round. Security and computational efficiency concerning software and hardware implementations are the primary criteria for PQC standardization.
Youngbeom Kim +4 more
wiley +1 more source

