Cryptanalysis of a code-based full-time signature
DOI10.1007/s10623-021-00902-7zbMath1472.94067arXiv2011.08326OpenAlexW3106358333MaRDI QIDQ1981793
Jean-Christophe Deneuville, Edoardo Persichetti, Marco Baldi, Nicolas Aragon, Karan Khathuria, Paolo Maria Santíni
Publication date: 6 September 2021
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2011.08326
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50) Decoding (94B35) Authentication, digital signatures and secret sharing (94A62)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Some new NP-complete coding problems
- Improved identification schemes based on error-correcting codes
- An algebraic attack on rank metric code-based cryptosystems
- Wave: a new family of trapdoor one-way preimage sampleable functions based on codes
- A code-based signature scheme from the Lyubashevsky framework
- Cryptanalysis of a code-based one-time signature
- Durandal: a rank metric based signature scheme
- Improvements of algebraic attacks for solving the rank decoding and MinRank problems
- Lattice Signatures without Trapdoors
- A Zero-Knowledge Identification Scheme Based on the q-ary Syndrome Decoding Problem
- A method for obtaining digital signatures and public-key cryptosystems
- On the inherent intractability of certain coding problems (Corresp.)
- A new identification scheme based on syndrome decoding
- Compact McEliece keys based on quasi-dyadic Srivastava codes
- LESS is More: Code-Based Signatures Without Syndromes
- A Distinguisher for High-Rate McEliece Cryptosystems
This page was built for publication: Cryptanalysis of a code-based full-time signature
