Cryptanalysis of a code-based one-time signature

DOI10.1007/s10623-020-00737-8zbMath1454.94064OpenAlexW2912251528MaRDI QIDQ2200516

Jean-Christophe Deneuville, Philippe Gaborit

Publication date: 22 September 2020

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://hal-enac.archives-ouvertes.fr/hal-02614017/file/DenGab20.pdf

zbMATH Keywords

signaturecryptanalysiscoding theorypost-quantum cryptographyone-time signature

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items

Cryptanalysis of a code-based full-time signature, Cryptanalysis of a rank-based signature with short public keys

Uses Software

• NTRU

Cites Work

• Security arguments for digital signatures and blind signatures
• Ouroboros: a simple, secure and efficient key exchange protocol based on coding theory
• Lattice Signatures without Trapdoors
• Trapdoors for hard lattices and new cryptographic constructions
• On the inherent intractability of certain coding problems (Corresp.)
• Efficient Encryption From Random Quasi-Cyclic Codes
• Unnamed Item
• Unnamed Item