True Dimension of Some Binary Quadratic Trace Goppa Codes
Designs, Codes and Cryptography
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
A Statistical Decoding Algorithm for General Linear Block Codes
Proceedings of the 8th IMA International Conference on Cryptography and Coding
Column scrambler for the GPT cryptosystem
Discrete Applied Mathematics - Special issue: International workshop on coding and cryptography (WCC 2001)
Upper Bounds on the Dual Distance of BCH(255, k)
Designs, Codes and Cryptography
How to Mask the Structure of Codes for a Cryptographic Use
Designs, Codes and Cryptography
Semantic security for the McEliece cryptosystem without random oracles
Designs, Codes and Cryptography
Cryptanalysis of the Sidelnikov Cryptosystem
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
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
McEliece Cryptosystem Implementation: Theory and Practice
PQCrypto '08 Proceedings of the 2nd International Workshop on Post-Quantum Cryptography
Syndrome Based Collision Resistant Hashing
PQCrypto '08 Proceedings of the 2nd International Workshop on Post-Quantum Cryptography
Side Channels in the McEliece PKC
PQCrypto '08 Proceedings of the 2nd International Workshop on Post-Quantum Cryptography
Blind detection of interleaver parameters
Signal Processing
Coding-Based Oblivious Transfer
Mathematical Methods in Computer Science
IEICE - Transactions on Information and Systems
A Practical Key Recovery Attack on Basic TCHo
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
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
Reducing Key Length of the McEliece Cryptosystem
AFRICACRYPT '09 Proceedings of the 2nd International Conference on Cryptology in Africa: Progress in Cryptology
On the decoding of binary cyclic codes with the Newton identities
Journal of Symbolic Computation
Provably good codes for hash function design
IEEE Transactions on Information Theory
Zero-Knowledge Protocols for NTRU: Application to Identification and Proof of Plaintext Knowledge
ProvSec '09 Proceedings of the 3rd International Conference on Provable Security
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
Linearization Framework for Collision Attacks: Application to CubeHash and MD6
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
A Distinguisher for the Compression Function of SIMD-512
INDOCRYPT '09 Proceedings of the 10th International Conference on Cryptology in India: Progress in Cryptology
Recovering a code's length and synchronization from a noisy intercepted bitstream
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
On the probabilistic computation of the stopping redundancy of LDPC codes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
When stream cipher analysis meets public-key cryptography
SAC'06 Proceedings of the 13th international conference on Selected areas in cryptography
A public key encryption scheme based on the polynomial reconstruction problem
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
TCHo: a hardware-oriented trapdoor cipher
ACISP'07 Proceedings of the 12th Australasian conference on Information security and privacy
Analysis of multivariate hash functions
ICISC'07 Proceedings of the 10th international conference on Information security and cryptology
Attacking reduced round SHA-256
ACNS'08 Proceedings of the 6th international conference on Applied cryptography and network security
Adding integrity verification capabilities to the LDPC-staircase erasure correction codes
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
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
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
Smaller decoding exponents: ball-collision decoding
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
Finding good differential patterns for attacks on SHA-1
WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
Analysis of step-reduced SHA-256
FSE'06 Proceedings of the 13th international conference on Fast Software Encryption
CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
Information-set decoding for linear codes over Fq
PQCrypto'10 Proceedings of the Third international conference on Post-Quantum Cryptography
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
A smart card implementation of the mceliece PKC
WISTP'10 Proceedings of the 4th IFIP WG 11.2 international conference on Information Security Theory and Practices: security and Privacy of Pervasive Systems and Smart Devices
Exploiting coding theory for collision attacks on SHA-1
IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
PQCrypto'11 Proceedings of the 4th international conference on Post-Quantum Cryptography
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
Cryptanalysis of round-reduced HAS-160
ICISC'11 Proceedings of the 14th international conference on Information Security and Cryptology
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
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
| Hi-index | 754.90 |
An algorithm for finding minimum-weight words in large linear codes is developed. It improves all previous attacks on the public-key cryptosystems based on codes and it notably points out some weaknesses in McEliece's (1978) cipher. We also determine with it the minimum distance of some BCH codes of length 511