An observation on the security of McEliece's public-key cryptosystem
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
A new identification scheme based on syndrome decoding
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
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
Fast Correlation Attacks: An Algorithmic Point of View
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: 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
A New Efficient Threshold Ring Signature Scheme Based on Coding Theory
PQCrypto '08 Proceedings of the 2nd International Workshop on Post-Quantum Cryptography
Attacking and Defending the McEliece Cryptosystem
PQCrypto '08 Proceedings of the 2nd International Workshop on Post-Quantum Cryptography
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Post Quantum Cryptography
Reducing Key Length of the McEliece Cryptosystem
AFRICACRYPT '09 Proceedings of the 2nd International Conference on Cryptology in Africa: Progress in Cryptology
The knapsack hash function proposed at Crypto'89 can be broken
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
A family of fast syndrome based cryptographic hash functions
Mycrypt'05 Proceedings of the 1st international conference on Progress in Cryptology in Malaysia
IEEE Transactions on Information Theory
Provably Secure Code-Based Threshold Ring Signatures
Cryptography and Coding '09 Proceedings of the 12th IMA International Conference on Cryptography and Coding
Post-quantum cryptography: code-based signatures
AST/UCMA/ISA/ACN'10 Proceedings of the 2010 international conference on Advances in computer science and information technology
Code-based public-key cryptosystems and their applications
ICITS'09 Proceedings of the 4th international conference on Information theoretic security
Interpreting hash function security proofs
ProvSec'10 Proceedings of the 4th international conference on Provable security
Zero-sum distinguishers for iterated permutations and application to KECCAK-f and Hamsi-256
SAC'10 Proceedings of the 17th international conference on Selected areas in cryptography
SAC'10 Proceedings of the 17th international conference on Selected areas in cryptography
Parallel-CFS: strengthening the CFS McEliece-based signature scheme
SAC'10 Proceedings of the 17th international conference on Selected areas in cryptography
Faster 2-regular information-set decoding
IWCC'11 Proceedings of the Third international conference on Coding and cryptology
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
Smaller decoding exponents: ball-collision decoding
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Algebraic cryptanalysis of mceliece variants with compact keys
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
Full cryptanalysis of the chen identification protocol
PQCrypto'11 Proceedings of the 4th international conference on Post-Quantum Cryptography
PQCrypto'11 Proceedings of the 4th international conference on Post-Quantum Cryptography
An efficient attack on all concrete KKS proposals
PQCrypto'11 Proceedings of the 4th international conference on Post-Quantum Cryptography
Monoidic codes in 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
A code-based 1-out-of-n oblivious transfer based on mceliece assumptions
ISPEC'12 Proceedings of the 8th international conference on Information Security Practice and Experience
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
Improving the performance of the SYND stream cipher
AFRICACRYPT'12 Proceedings of the 5th international conference on Cryptology in Africa
An efficient IND-CCA2 secure variant of the niederreiter encryption scheme in the standard model
ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
Zero-knowledge protocols for the mceliece encryption
ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
Proof of plaintext knowledge for code-based public-key encryption revisited
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
Computational aspects of retrieving a representation of an algebraic geometry code
Journal of Symbolic Computation
| Hi-index | 0.01 |
Code-based cryptography is often viewed as an interesting "Post-Quantum" alternative to the classical number theory cryptography. Unlike many other such alternatives, it has the convenient advantage of having only a few, well identified, attack algorithms. However, improvements to these algorithms have made their effective complexity quite complex to compute. We give here some lower bounds on the work factor of idealized versions of these algorithms, taking into account all possible tweaks which could improve their practical complexity. The aim of this article is to help designers select durably secure parameters.