Private-key algebraic-coded cryptosystems
Proceedings on Advances in cryptology---CRYPTO '86
Security-Related Comments Regarding McEliece's Public-Key Cryptosystem
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
On the McEliece public-key cryptosystem
CRYPTO '88 Proceedings on Advances in cryptology
McEliece Public Key Cryptosystems Using Algebraic-Geometric Codes
Designs, Codes and Cryptography
A symmetric version of the McEliece public-key cryptosystem
International Journal of Network Management
Improving the Security of the McEliece Public-Key Cryptosystem
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Cryptoanalysis of the Original McEliece Cryptosystem
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
How to Achieve a McEliece-Based Digital Signature Scheme
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Efficient Zero-Knowledge Authentication Based on a Linear Algebra Problem MinRank
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
A Statistical Decoding Algorithm for General Linear Block Codes
Proceedings of the 8th IMA International Conference on Cryptography and Coding
Semantically Secure McEliece Public-Key Cryptosystems-Conversions for McEliece PKC
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
How to Mask the Structure of Codes for a Cryptographic Use
Designs, Codes and Cryptography
On Kabatianskii-Krouk-Smeets Signatures
WAIFI '07 Proceedings of the 1st international workshop on Arithmetic of Finite Fields
A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes
SCN '08 Proceedings of the 6th international conference on Security and Cryptography for Networks
Attacking and Defending the McEliece Cryptosystem
PQCrypto '08 Proceedings of the 2nd International Workshop on Post-Quantum Cryptography
IEICE - Transactions on Information and Systems
Reducing Key Length of the McEliece Cryptosystem
AFRICACRYPT '09 Proceedings of the 2nd International Conference on Cryptology in Africa: Progress in Cryptology
Security Bounds for the Design of Code-Based Cryptosystems
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Improving the security of McEliece-like public key cryptosystem based on LDPC codes
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 2
Ideals over a non-commutative ring and their application in cryptology
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Equivalent Goppa codes and trapdoors to McEliece's public key cryptosystem
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
When stream cipher analysis meets public-key cryptography
SAC'06 Proceedings of the 13th international conference on Selected areas in cryptography
TCHo: a hardware-oriented trapdoor cipher
ACISP'07 Proceedings of the 12th Australasian conference on Information security and privacy
Proceedings of the 11th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing on International Conference on Computer Systems and Technologies
Faster 2-regular information-set decoding
IWCC'11 Proceedings of the Third international conference on Coding and cryptology
Really fast syndrome-based hashing
AFRICACRYPT'11 Proceedings of the 4th international conference on Progress in cryptology in Africa
Smaller decoding exponents: ball-collision decoding
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
PQCrypto'10 Proceedings of the Third international conference on Post-Quantum Cryptography
Information-set decoding for linear codes over Fq
PQCrypto'10 Proceedings of the Third international conference on Post-Quantum Cryptography
Practical power analysis attacks on software implementations of mceliece
PQCrypto'10 Proceedings of the Third international conference on Post-Quantum Cryptography
An attack on a modified niederreiter encryption scheme
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
PQCrypto'11 Proceedings of the 4th international conference on Post-Quantum Cryptography
Decoding random linear codes in Õ(20.054n)
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Quantum McEliece public-key cryptosystem
Quantum Information & Computation
Decoding random binary linear codes in 2n/20: how 1 + 1 = 0 improves information set decoding
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Computational aspects of retrieving a representation of an algebraic geometry code
Journal of Symbolic Computation
| Hi-index | 0.00 |
The best known cryptanalytic attack on McEliece's public-key cryptosystem based on algebraic coding theory is to repeatedly select k bits at random from an n-bit ciphertext vector, which is corrupted by at most t errors, in hope that none of the selected k bits are in error until the cryptanalyst recovers the correct message. The method of determining whether the recovered message is the correct one has not been throughly investigated. In this paper, we suggest a systematic method of checking, and describe a generalized version of the cryptanalytic attack which reduces the work factor sigdicantly (factor of 211 for the commonly used example of n=1024 Goppa code case). Some more improvements are also given. We also note that these cryptanalytic algorithms can be viewed as generalized probabilistic decoding algorithms for any linear error correcting codes.