Cryptanalysis of a code-based one-time signature
DOI10.1007/S10623-020-00737-8zbMATH Open1454.94064OpenAlexW2912251528MaRDI QIDQ2200516FDOQ2200516
Authors: 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
Recommendations
- Asymptotically efficient lattice-based digital signatures
- Asymptotically Efficient Lattice-Based Digital Signatures
- Lattice signatures without trapdoors
- Lattice signatures and bimodal Gaussians
- Lattice-based signcryption without random oracles
- Public Key Cryptography - PKC 2005
- Analysis of error terms of signatures based on learning with errors
- Transcript secure signatures based on modular lattices
- Publication:3202944
Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50)
Cites Work
- Security arguments for digital signatures and blind signatures
- Title not available (Why is that?)
- Trapdoors for hard lattices and new cryptographic constructions
- On the inherent intractability of certain coding problems (Corresp.)
- Lattice signatures without trapdoors
- Ouroboros: a simple, secure and efficient key exchange protocol based on coding theory
- Title not available (Why is that?)
- Efficient Encryption From Random Quasi-Cyclic Codes
Cited In (5)
Uses Software
This page was built for publication: Cryptanalysis of a code-based one-time signature
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2200516)
