An observation on the security of McEliece's public-key cryptosystem
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Quantum Cryptanalysis of Hash and Claw-Free Functions
LATIN '98 Proceedings of the Third Latin American Symposium on Theoretical Informatics
A method for finding codewords of small weight
Proceedings of the 3rd International Colloquium on Coding Theory and Applications
Algorithms for quantum computation: discrete logarithms and factoring
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Attacking and Defending the McEliece Cryptosystem
PQCrypto '08 Proceedings of the 2nd International Workshop on Post-Quantum Cryptography
Post Quantum Cryptography
SAC'10 Proceedings of the 17th international conference on Selected areas in cryptography
Quantum McEliece public-key cryptosystem
Quantum Information & Computation
Zero-knowledge protocols for the mceliece encryption
ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
The non-gap sequence of a subcode of a generalized Reed---Solomon code
Designs, Codes and Cryptography
Proof of plaintext knowledge for code-based public-key encryption revisited
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
| Hi-index | 0.00 |
This paper shows that quantum information-set-decoding attacks are asymptotically much faster than non-quantum information-set-decoding attacks.