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

DOI10.1142/S0219498825500999zbMATH Open1544.94277MaRDI QIDQ6580201

Franco Chiaraluce, Paolo Santini, Marco Baldi

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Some new NP-complete coding problems
• LESS-FM: fine-tuning signatures from the code equivalence problem
• Wave: a new family of trapdoor one-way preimage sampleable functions based on codes
• An Efficient Attack on a Code-Based Signature Scheme
• SPHINCS: Practical Stateless Hash-Based Signatures
• An Efficient Attack on All Concrete KKS Proposals
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• On the inherent intractability of certain coding problems (Corresp.)
• A new identification scheme based on syndrome decoding
• A digital signature scheme based on random error-correcting codes
• Using LDGM Codes and Sparse Syndromes to Achieve Digital Signatures
• Efficient Encryption From Random Quasi-Cyclic Codes
• Self-orthogonal quasi-cyclic codes
• Short signatures from regular syndrome decoding in the head
• The return of the SDitH
• Syndrome decoding in the head: shorter signatures from zero-knowledge proofs

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)