An observation on the security of McEliece's public-key cryptosystem
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
A method for finding codewords of small weight
Proceedings of the 3rd International Colloquium on Coding Theory and Applications
A Generalized Birthday Problem
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Secure Human Identification Protocols
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
More on Average Case vs Approximation Complexity
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
A variant of a public key cryptosystem based on Goppa Codes
ACM SIGACT News - A special issue on cryptography
On lattices, learning with errors, random linear codes, and cryptography
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Attacking and Defending the McEliece Cryptosystem
PQCrypto '08 Proceedings of the 2nd International Workshop on Post-Quantum Cryptography
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
Efficient authentication from hard learning problems
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Improved generic algorithms for hard knapsacks
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Smaller decoding exponents: ball-collision decoding
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
New generic algorithms for hard knapsacks
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Information-set decoding for linear codes over Fq
PQCrypto'10 Proceedings of the Third 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
IEEE Transactions on Information Theory
Finding the permutation between equivalent linear codes: the support splitting algorithm
IEEE Transactions on Information Theory
An improved threshold ring signature scheme based on error correcting codes
WAIFI'12 Proceedings of the 4th international conference on Arithmetic of Finite Fields
A new version of mceliece PKC based on convolutional codes
ICICS'12 Proceedings of the 14th international conference on Information and Communications Security
IND-CCA secure cryptography based on a variant of the LPN problem
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
Proof of plaintext knowledge for code-based public-key encryption revisited
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
Smaller keys for code-based cryptography: QC-MDPC mceliece implementations on embedded devices
CHES'13 Proceedings of the 15th international conference on Cryptographic Hardware and Embedded Systems
Computational aspects of retrieving a representation of an algebraic geometry code
Journal of Symbolic Computation
| Hi-index | 0.00 |
Decoding random linear codes is a well studied problem with many applications in complexity theory and cryptography. The security of almost all coding and LPN/LWE-based schemes relies on the assumption that it is hard to decode random linear codes. Recently, there has been progress in improving the running time of the best decoding algorithms for binary random codes. The ball collision technique of Bernstein, Lange and Peters lowered the complexity of Stern's information set decoding algorithm to 20.0556n. Using representations this bound was improved to 20.0537n by May, Meurer and Thomae. We show how to further increase the number of representations and propose a new information set decoding algorithm with running time 20.0494n.