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
QUARTZ, 128-Bit Long Digital Signatures
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
A method for finding codewords of small weight
Proceedings of the 3rd International Colloquium on Coding Theory and Applications
Can One Design a Signature Scheme Based on Error-Correctin Codes?
ASIACRYPT '94 Proceedings of the 4th International Conference on the Theory and Applications of Cryptology: Advances in Cryptology
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Is code equivalence easy to decide?
IEEE Transactions on Information Theory
The intractability of computing the minimum distance of a code
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Finding the permutation between equivalent linear codes: the support splitting algorithm
IEEE Transactions on Information Theory
Weak keys in the McEliece public-key cryptosystem
IEEE Transactions on Information Theory
Short Signatures in the Random Oracle Model
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
On the Security of HFE, HFEv- and Quartz
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Generic Attacks and the Security of Quartz
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Security Parallels between People and Pervasive Devices
PERCOMW '05 Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications Workshops
On Kabatianskii-Krouk-Smeets Signatures
WAIFI '07 Proceedings of the 1st international workshop on Arithmetic of Finite Fields
Towards a Concrete Security Proof of Courtois, Finiasz and Sendrier Signature Scheme
Research in Cryptology
Oblivious Transfer Based on the McEliece Assumptions
ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
A New Efficient Threshold Ring Signature Scheme Based on Coding Theory
PQCrypto '08 Proceedings of the 2nd International Workshop on Post-Quantum Cryptography
Coding-Based Oblivious Transfer
Mathematical Methods in Computer Science
A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model
CT-RSA '09 Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics 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
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
A lattice-based threshold ring signature scheme
LATINCRYPT'10 Proceedings of the First international conference on Progress in cryptology: cryptology and information security in Latin America
One-time signature scheme from syndrome decoding over generic error-correcting codes
Journal of Systems and Software
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
The future of high-speed cryptography: new computing platforms and new ciphers
Proceedings of the 21st edition of the great lakes symposium on Great lakes symposium on VLSI
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
McEliece and niederreiter cryptosystems that resist quantum fourier sampling attacks
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
A new signature scheme without random oracles from bilinear pairings
VIETCRYPT'06 Proceedings of the First international conference on Cryptology in Vietnam
A generic scheme based on trapdoor one-way permutations with signatures as short as possible
PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography
Authenticating pervasive devices with human protocols
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Designing an efficient and secure public-key cryptosystem based on reducible rank codes
INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
Designing a rank metric based mceliece cryptosystem
PQCrypto'10 Proceedings of the Third international conference on Post-Quantum Cryptography
Statistical decoding revisited
ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
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
Ensuring message embedding in wet paper steganography
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
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
An improved threshold ring signature scheme based on error correcting codes
WAIFI'12 Proceedings of the 4th international conference on Arithmetic of Finite Fields
ISC'12 Proceedings of the 15th international conference on Information Security
A new version of mceliece PKC based on convolutional codes
ICICS'12 Proceedings of the 14th international conference on Information and Communications Security
McBits: fast constant-time code-based cryptography
CHES'13 Proceedings of the 15th international conference on Cryptographic Hardware and Embedded Systems
Identity based identification from algebraic coding theory
Theoretical Computer Science
Asymptotic behaviour of codes in rank metric over finite fields
Designs, Codes and Cryptography
Computational aspects of retrieving a representation of an algebraic geometry code
Journal of Symbolic Computation
On provably secure code-based multiple grade proxy signature scheme
International Journal of High Performance Systems Architecture
| Hi-index | 0.00 |
McEliece is one of the oldest known public key cryptosystems. Though it was less widely studied than RSA, it is remarkable that all known attacks are still exponential. It is widely believed that code-based cryptosystems like McEliece do not allow practical digital signatures. In the present paper we disprove this belief and show a way to build a practical signature scheme based on coding theory. Its security can be reduced in the random oracle model to the well-known syndrome decoding problem and the distinguishability of permuted binary Goppa codes from a random code. For example we propose a scheme with signatures of 81-bits and a binary security workfactor of 283.