Results 31 to 40 of about 661 (173)
Post‐Quantum Secure Password‐Authenticated Key Exchange Based on Ouroboros
Password‐authenticated key exchange (PAKE) protocols play an important role in cryptography. Most of PAKEs are based on the Diffie–Hellman key exchange protocols or RSA encryption schemes, but their security is threatened by quantum computers. In this study, we propose the first code‐based PAKE protocol based on Ouroboros, which is a code‐based key ...
Hao Wang +3 more
wiley +1 more source
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
Quantum approximate optimization of the coset leader problem for binary linear codes
Abstract The security of a broad family of coding‐based cryptographic techniques relies on the hardness of the Syndrome Decoding Problem (SDP). In this problem, the aim is to find a word with a given syndrome and of Hamming weight smaller than a prefixed bound.
Markel Epelde +2 more
wiley +1 more source
Quantum Election Protocol Based on Quantum Public Key Cryptosystem
There is no quantum election protocol that can fulfil the eight requirements of an electronic election protocol, i.e., completeness, robustness, privacy, legality, unreusability, fairness, verifiability, and receipt‐freeness. To address this issue, we employ the general construction of quantum digital signature and quantum public key encryption, in ...
Wenhua Gao, Li Yang, Prosanta Gope
wiley +1 more source
Hexi McEliece public key cryptosystem [PDF]
This paper introduces a new class of hexi codes namely, hexi polynomial codes, hexi Rank Distance codes, hexi Maximum Rank Distance codes, hexi Goppa codes and hexi wild Goppa codes.
Ilanthenral, K. +3 more
core +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
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
Cryptanalysis of the Original McEliece Cryptosystem [PDF]
The class of public-key cryptosystems based on error-correcting codes is one of the few alternatives to the common algorithms based on number theory. We here present an attack against these systems which actually consists of a new probabilistic algorithm for finding minimum-weight words in any large linear code.
Anne Canteaut, Nicolas Sendrier
openaire +1 more source
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
The aim of this thesis is to explore the McEliece cryptosystem, a post-quantum cryptosystem based on linear codes. As modern cryptosystems based on number theoretic problems, such as integer factorization and discrete logarithms, are no longer considered
Ali, Amjad
core +1 more source

