scientific article; zbMATH DE number 2081064

zbMath1062.94556MaRDI QIDQ4474171

Nicolas T. Courtois, Matthieu Finiasz, Nicolas Sendrier

Publication date: 4 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2248/22480157.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Goppa codesdigital signatureMcEliece cryptosystemNiederreiter cryptosystemsyndrome decodingshort signatures

Mathematics Subject Classification ID

Cryptography (94A60) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35) Authentication, digital signatures and secret sharing (94A62)

Related Items (68)

Enhanced public key security for the McEliece cryptosystem ⋮ SoK: how (not) to design and implement post-quantum cryptography ⋮ A scalable post-quantum hash-based group signature ⋮ LESS is More: Code-Based Signatures Without Syndromes ⋮ On the security of the Courtois-Finiasz-Sendrier signature ⋮ A digital signature scheme $\mathrm{mCFS}^{\mathrm{QC{-}LDPC}}$ based on $\mathrm{QC}$-$\mathrm{LDPC}$ codes ⋮ A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory ⋮ A correction to a code-based blind signature scheme ⋮ Using low-density parity-check codes to improve the McEliece cryptosystem ⋮ Asymptotically efficient lattice-based digital signatures ⋮ Square Code Attack on a Modified Sidelnikov Cryptosystem ⋮ Identity based identification from algebraic coding theory ⋮ Attack on a code-based signature scheme from QC-LDPC codes ⋮ A new key recovery attack on a code-based signature from the Lyubashevsky framework ⋮ On codes and learning with errors over function fields ⋮ Code-Based Signature Schemes from Identification Protocols in the Rank Metric ⋮ A code-based signature scheme from the Lyubashevsky framework ⋮ Chosen-ciphertext secure code-based threshold public key encryptions with short ciphertext ⋮ Improved information set decoding algorithms over Galois ring in the Lee metric ⋮ Analysis of (U,U+V)-code problem with Gramian over binary and ternary fields ⋮ Structural attacks for public key cryptosystems based on Gabidulin codes ⋮ Retracted: Invertible matrices over some quotient rings: identification, generation, and analysis ⋮ A code-based hybrid signcryption scheme ⋮ Statistical zero-knowledge and analysis of rank-metric zero-knowledge proofs of knowledge ⋮ On the dimension and structure of the square of the dual of a Goppa code ⋮ Computational aspects of retrieving a representation of an algebraic geometry code ⋮ Asymptotic behaviour of codes in rank metric over finite fields ⋮ A New Efficient Threshold Ring Signature Scheme Based on Coding Theory ⋮ On the Key-Privacy Issue of McEliece Public-Key Encryption ⋮ Public key compression for constrained linear signature schemes ⋮ Quantum-assisted QD-CFS signatures ⋮ A provably secure short signature scheme based on discrete logarithms ⋮ Cryptanalysis of a code-based full-time signature ⋮ A code-based group signature scheme ⋮ DAGS: key encapsulation using dyadic GS codes ⋮ A New Dynamic Code-Based Group Signature Scheme ⋮ Code-Based Public-Key Cryptosystems and Their Applications ⋮ A post-quantum UC-commitment scheme in the global random oracle model from code-based assumptions ⋮ On the dimension of the subfield subcodes of 1-point Hermitian codes ⋮ Wave Parameter Selection ⋮ High weight code-based signature scheme from QC-LDPC codes ⋮ \textsf{FuLeeca}: a Lee-based signature scheme ⋮ A Secure and Efficient Code-Based Signature Scheme ⋮ On two modifications of the McEliece PKE and the CFS signature scheme ⋮ Post-quantum secure fully-dynamic logarithmic-size deniable group signature in code-based setting ⋮ On the rank decoding problem over finite principal ideal rings ⋮ A new approach based on quadratic forms to attack the McEliece cryptosystem ⋮ Injective rank metric trapdoor functions with homogeneous errors ⋮ A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model ⋮ Accelerating Signature-Based Broadcast Authentication for Wireless Sensor Networks ⋮ Probabilistic hash-and-sign with retry in the quantum random oracle model ⋮ Semantic security for the McEliece cryptosystem without random oracles ⋮ Post-quantum cryptosystems: open problems and current solutions. Isogeny-based and code-based cryptosystems ⋮ FuLeakage: breaking FuLeeca by learning attacks ⋮ Wild McEliece ⋮ Parallel-CFS ⋮ Cryptanalysis of a rank-based signature with short public keys ⋮ Decoding One Out of Many ⋮ An Efficient Attack on All Concrete KKS Proposals ⋮ Monoidic Codes in Cryptography ⋮ Ensuring Message Embedding in Wet Paper Steganography ⋮ Variant of Niederreiter-based signature scheme for blockchain technology ⋮ Invertible matrices over some quotient rings: identification, generation, and analysis ⋮ Computer algebra tales on Goppa codes and McEliece cryptography ⋮ Oblivious Transfer Based on the McEliece Assumptions ⋮ Towards a Concrete Security Proof of Courtois, Finiasz and Sendrier Signature Scheme ⋮ A Post-quantum Digital Signature Scheme Based on Supersingular Isogenies ⋮ The security of the code-based signature scheme based on the Stern identification protocol

This page was built for publication: