A NP-Complete Problem in Coding Theory with Application to Code Based Cryptography

DOI10.1007/978-3-319-55589-8_15zbMath1365.94501OpenAlexW2593199740MaRDI QIDQ5739036

Jean Belo Klamti, Cheikh Thiecoumba Gueye, Thierry P. Berger

Publication date: 1 June 2017

Published in: Codes, Cryptology and Information Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-55589-8_15

zbMATH Keywords

code-based cryptographyidentification schemeequivalence subcode

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (3)

Security analysis of a cryptosystem based on subspace subcodes ⋮ A code-based hybrid signcryption scheme ⋮ Designing a Public Key Cryptosystem Based on Quasi-cyclic Subspace Subcodes of Reed-Solomon Codes

Uses Software

• McEliece

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved identification schemes based on error-correcting codes
• How to mask the structure of codes for a cryptographic use
• A Zero-Knowledge Identification Scheme Based on the q-ary Syndrome Decoding Problem
• Reducing Key Length of the McEliece Cryptosystem
• Compact McEliece Keys from Goppa Codes
• On the inherent intractability of certain coding problems (Corresp.)
• A new identification scheme based on syndrome decoding
• Is code equivalence easy to decide?
• The intractability of computing the minimum distance of a code
• Finding the permutation between equivalent linear codes: the support splitting algorithm
• The Hardness of Code Equivalence over $\mathbb{F}_q$ and Its Application to Code-Based Cryptography
• Public Key Cryptography - PKC 2006

This page was built for publication: A NP-Complete Problem in Coding Theory with Application to Code Based Cryptography