Algebraic Cryptanalysis of McEliece Variants with Compact Keys

DOI10.1007/978-3-642-13190-5_14zbMath1280.94051OpenAlexW1566154368WikidataQ62039175 ScholiaQ62039175MaRDI QIDQ3563840

Ludovic Perret, Ayoub Otmani, Jean-Pierre Tillich, Jean-Charles Faugère

Publication date: 1 June 2010

Published in: Advances in Cryptology – EUROCRYPT 2010 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13190-5_14

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

Structural cryptanalysis of McEliece schemes with compact keys, Improved Information Set Decoding for Code-Based Cryptosystems with Constrained Memory, Squaring attacks on McEliece public-key cryptosystems using quasi-cyclic codes of even dimension, A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory, Efficient Code Based Hybrid and Deterministic Encryptions in the Standard Model, Security analysis of a cryptosystem based on subspace subcodes, Performance bounds for QC-MDPC codes decoders, ECC\(^2\): error correcting code and elliptic curve based cryptosystem, Properties of constacyclic codes under the Schur product, Square Code Attack on a Modified Sidelnikov Cryptosystem, Moderate classical McEliece keys from quasi-centrosymmetric Goppa codes, Code-Based Signature Schemes from Identification Protocols in the Rank Metric, On new problems in asymmetric cryptography based on error-resistant coding, Software implementation of a code-based key encapsulation mechanism from binary QD generalized Srivastava codes, Computational aspects of retrieving a representation of an algebraic geometry code, Asymptotic behaviour of codes in rank metric over finite fields, Designing a Public Key Cryptosystem Based on Quasi-cyclic Subspace Subcodes of Reed-Solomon Codes, Dihedral codes with prescribed minimum distance, Reproducible families of codes and cryptographic applications, DAGS: key encapsulation using dyadic GS codes, Generalization of BJMM-ISD Using May-Ozerov Nearest Neighbor Algorithm over an Arbitrary Finite Field $$\mathbb {F}_q$$, On quasi-cyclic codes as a generalization of cyclic codes, Differential Power Analysis of a McEliece Cryptosystem, Wild McEliece, Parallel-CFS, A Zero-Knowledge Identification Scheme Based on the q-ary Syndrome Decoding Problem, Implementation of McEliece Based on Quasi-dyadic Goppa Codes for Embedded Devices, Monoidic Codes in Cryptography, Cryptanalysis of a system based on twisted Reed-Solomon codes

Uses Software

• FGb