Results 41 to 50 of about 1,079 (213)
A Quantum Circuit to Speed-Up the Cryptanalysis of Code-Based Cryptosystems [PDF]
The significant interest in cryptographic primitives providing sound security margins when facing attacks with quantum computers is witnessed by the ongoing USA National Institute of Standards and Technology Post-quantum Cryptography Standardization process.
S. Perriello, A. Barenghi, G. Pelosi
openaire +1 more source
Generalized Concatenated Codes over Gaussian and Eisenstein Integers for Code-Based Cryptography
The code-based McEliece and Niederreiter cryptosystems are promising candidates for post-quantum public-key encryption. Recently, q-ary concatenated codes over Gaussian integers were proposed for the McEliece cryptosystem, together with the one-Mannheim ...
Johann-Philipp Thiers +1 more
doaj +1 more source
McNie: A code-based public-key cryptosystem
In this paper, we suggest a code-based public key encryption scheme, called McNie. McNie is a hybrid version of the McEliece and Niederreiter cryptosystems and its security is reduced to the hard problem of syndrome decoding. The public key involves a random generator matrix which is also used to mask the code used in the secret key.
Jon-Lark Kim +4 more
openaire +2 more sources
A Solidity implementation of TAVS
We present a Solidity smart contract implementation of the TAVS e-voting protocol. The Two Authorities Electronic Voting Scheme (TAVS) is a voting scheme that achieves universal verifiability with a reduced time-complexity both for the elector and the ...
Antonio M. Larriba, Damián López
doaj +1 more source
A Flexible NTT-Based Multiplier for Post-Quantum Cryptography
In this work an NTT-based (Number Theoretic Transform) multiplier for code-based Post-Quantum Cryptography (PQC) is presented, supporting Quasi Cyclic Low/Moderate-Density Parity-Check (QC LDPC/MDPC) codes.
Kristjane Koleci +3 more
doaj +1 more source
Scaling efficient code-based cryptosystems for embedded platforms [PDF]
We describe a family of highly efficient codes for cryptographic purposes and dedicated algorithms for their manipulation. Our proposal is especially tailored for highly constrained platforms, and surpasses certain conventional and post-quantum proposals (like RSA and NTRU, respectively) according to most if not all efficiency metrics.
Felipe P. Biasi +3 more
openaire +2 more sources
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
Code-Based Cryptography With Generalized Concatenated Codes for Restricted Error Values
Code-based cryptosystems are promising candidates for post-quantum cryptography. Recently, generalized concatenated codes over Gaussian and Eisenstein integers were proposed for those systems. For a channel model with errors of restricted weight, those q-
Johann-Philipp Thiers +1 more
doaj +1 more source
Security of generalised Reed–Solomon code‐based cryptosystems
In this study, the authors elaborate on a recently proposed variant of the public‐key McEliece and Niederreiter cryptosystems using generalised Reed–Solomon (GRS) codes as private codes. The use of these codes brings known advantages in terms of public key size, but particular care is needed in the choice of parameters not to endanger the system ...
Marco Baldi +4 more
openaire +1 more source
McEliece public key cryptosystem attack algorithm based on enumeration error vector
The research on the security of McEliece (M) public key cryptosystem was presented. The Hamming weight of error vector is less than the code length, and M public key cryptosystem based on Goppa code possesses low weight public code words. Considering the
Jing-mei LIU +3 more
doaj +2 more sources

