SPANSE: combining sparsity with density for efficient one-time code-based digital signatures

DOI10.1142/S0219498825500999MaRDI QIDQ6580201zbMATH OpenFDO

Authors Marco Baldi, Franco Chiaraluce, Paolo Santini

Publication date 29 July 2024

Published in Journal of Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

digital signaturescode-based cryptographyQC-LDPC codeslarge-weight decodingQC-LDGM codes

Mathematics Subject Classification ID

Cryptography (94A60) Combinatorial codes (94B25) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Using LDGM codes and sparse syndromes to achieve digital signatures
• Cryptanalysis of a code-based one-time signature
• Ranksign: an efficient signature algorithm based on the rank metric
• LESS is more: code-based signatures without syndromes
• scientific article; zbMATH DE number 2081064

Cites work

• scientific article; zbMATH DE number 1583774 (Why is no real title available?)
• scientific article; zbMATH DE number 3989251 (Why is no real title available?)
• scientific article; zbMATH DE number 1950338 (Why is no real title available?)
• scientific article; zbMATH DE number 1406769 (Why is no real title available?)
• A digital signature scheme based on random error-correcting codes
• A new identification scheme based on syndrome decoding
• An efficient attack on a code-based signature scheme
• An efficient attack on all concrete KKS proposals
• Efficient Encryption From Random Quasi-Cyclic Codes
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• LESS-FM: fine-tuning signatures from the code equivalence problem
• On the inherent intractability of certain coding problems (Corresp.)
• SPHINCS: practical stateless hash-based signatures
• Self-orthogonal quasi-cyclic codes
• Short signatures from regular syndrome decoding in the head
• Some new NP-complete coding problems
• Syndrome decoding in the head: shorter signatures from zero-knowledge proofs
• The return of the SDitH
• Using LDGM codes and sparse syndromes to achieve digital signatures
• Wave: a new family of trapdoor one-way preimage sampleable functions based on codes

This page was built for publication: SPANSE: combining sparsity with density for efficient one-time code-based digital signatures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6580201)