Results 11 to 20 of about 237 (172)
Complete and Improved FPGA Implementation of Classic McEliece
We present the first specification-compliant constant-time FPGA implementation of the Classic McEliece cryptosystem from the third-round of NIST’s Post-Quantum Cryptography standardization process.
Po-Jen Chen +6 more
doaj +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
Single Trace Analysis against HyMES by Exploitation of Joint Distributions of Leakages
Beginning with the proposal of the McEliece cryptosystem in 1978, code-based cryptography has positioned itself as one of main categories in post-quantum cryptography (PQC).
ByeongGyu Park +4 more
doaj +1 more source
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
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
The original McEliece cryptosystem uses length-$n$ codes over $\rm{F}_2$ with dimension $\geq n-mt$ efficiently correcting t errors where $2^m \geq n$. This paper presents a generalized cryptosystem that uses length-$n$ codes over small finite fields $\rm{F}_q$ with dimension $\geq n-m(q-1)t$ efficiently correcting $\lfloor qt/2 \rfloor$ errors where ...
Bernstein, D.J., Lange, T., Peters, C.P.
openaire +4 more sources
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
Variations of the McEliece Cryptosystem [PDF]
Two variations of the McEliece cryptosystem are presented. The first is based on a relaxation of the column permutation in the classical McEliece scrambling process. This is done in such a way that the Hamming weight of the error, added in the encryption process, can be controlled so that efficient decryption remains possible.
Bolkema, Jessalyn +5 more
openaire +3 more sources
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
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

