A digital signature scheme based on random error-correcting codes

DOI10.1007/BFb0024461zbMath1083.94516OpenAlexW1754098121MaRDI QIDQ4400578

Ben Smeets, Eugeny Krouk, Grigory Kabatiansky

Publication date: 1997

Published in: Crytography and Coding (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0024461

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (11)

A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory ⋮ Attack on a code-based signature scheme from QC-LDPC codes ⋮ Code-Based Signature Schemes from Identification Protocols in the Rank Metric ⋮ Interleaved Prange: a new generic decoder for interleaved codes ⋮ Analysis of (U,U+V)-code problem with Gramian over binary and ternary fields ⋮ On new problems in asymmetric cryptography based on error-resistant coding ⋮ A Secure and Efficient Code-Based Signature Scheme ⋮ Cryptanalysis of a rank-based signature with short public keys ⋮ An Efficient Attack on All Concrete KKS Proposals ⋮ The security of the code-based signature scheme based on the Stern identification protocol ⋮ An algebraic approach to the rank support learning problem

This page was built for publication: A digital signature scheme based on random error-correcting codes