Results 71 to 80 of about 661 (173)
Semantically Secure McEliece Public-Key Cryptosystems -Conversions for McEliece PKC - [PDF]
, 2001 Almost all of the current public-key cryptosystems (PKCs) are based on number theory, such as the integer factoring problem and the discrete logarithm problem (which will be solved in polynomial-time after the emergence of quantum computers). While the McEliece PKC is based on another theory, i.e.
Kazukuni Kobara, Hideki Imai
openaire +1 more source
McEliece public key cryptosystem attack algorithm based on enumeration error vector
Tongxin xuebao, 2014 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
Compact McEliece keys based on quasi-dyadic Srivastava codes
Journal of Mathematical Cryptology, 2012 The McEliece cryptosystem is one of the few systems to be considered secure against attacks by Quantum computers. The original scheme is built upon Goppa codes and produces very large keys, hence recent research has focused mainly on trying to reduce the
Persichetti Edoardo
doaj +1 more source
A Lightweight McEliece Cryptosystem Co-processor Design
CoRR, 2019 Due to the rapid advances in the development of quantum computers and their susceptibility to errors, there is a renewed interest in error correction algorithms. In particular, error correcting code-based cryptosystems have reemerged as a highly desirable coding technique.
Bu, Lake +3 more
openaire +2 more sources
Codes in Dihedral Group Algebra
Моделирование и анализ информационных систем, 2018 Robert McEliece developed an asymmetric encryption algorithm based on the use of binary Goppa codes in 1978 and no effective key attacks has been described yet.
Kirill V. Vedenev, Vladimir M. Deundyak
doaj +1 more source
Research on McEliece and Niederreiter Public-key Cryptosystem Algorithm Based on Quantum BCH Codes
工程科学与技术, 2018 In order to resist the security threat of quantum computing attacks to the traditional cryptosystem, a class of McEliece public-keycryptosystems was designed in this paper, based on the fact that no quantum computing algorithm can attack the McEliece ...
Haiqing HAN +3 more
doaj
On the equivalence of McEliece's and Niederreiter's public-key cryptosystems
IEEE Transactions on Information Theory, 1994 Summary: It is shown that McEliece's and Niederreiter's public-key cryptosystems are equivalent when set up for corresponding choices of parameters. A security analysis for the two systems, based on this equivalence observation, is presented.
Yuanxing Li, Robert H. Deng, Xinmei Wang
openaire +4 more sources
DRANKULA: A McEliece-like Rank Metric based Cryptosystem Implementation [PDF]
, 2018 We present and analyze the performance of DRANKULA, a McEliece-like cryptosystem implementation using \textit{rank metric} instead of Hamming distance. Namely, we use the scheme proposed by Loidreau in PQCrypto 2017 using Gabidulin codes.
Marc Manzano +6 more
core +1 more source
Efficient ASIC Architecture for Low Latency Classic McEliece Decoding
Transactions on Cryptographic Hardware and Embedded SystemsPost-quantum cryptography addresses the increasing threat that quantum computing poses to modern communication systems. Among the available “quantum-resistant” systems, the Classic McEliece key encapsulation mechanism (KEM) is positioned as a ...
Daniel Fallnich +3 more
doaj +1 more source
SISTEM KRIPTOGRAFI MCELIECE BERDASARKAN KODE REED-MULLER ORDER PERTAMA [PDF]
, 2021 Internet is a communication channel that is prone to security attacks, one of security attacks is attack on secrecy. Observing the development of quantum computers, Peter Shor in 1997 assumed that the cryptosystem in use today is insecure against ...
PURNAMA SARI 17106010045, NIM. 17106010045
core