How to mask the structure of codes for a cryptographic use
From MaRDI portal
Publication:2572961
DOI10.1007/s10623-003-6151-2zbMath1136.11327OpenAlexW2026461145MaRDI QIDQ2572961
Thierry P. Berger, Pierre Loidreau
Publication date: 7 November 2005
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-003-6151-2
Related Items (27)
Enhanced public key security for the McEliece cryptosystem ⋮ Cryptanalysis of Public-Key Cryptosystems That Use Subcodes of Algebraic Geometry Codes ⋮ Cryptanalysis of the BBCRS System on Reed-Muller Binary Codes ⋮ Security analysis of a cryptosystem based on subspace subcodes ⋮ Properties of constacyclic codes under the Schur product ⋮ Square Code Attack on a Modified Sidelnikov Cryptosystem ⋮ Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes ⋮ The non-gap sequence of a subcode of a generalized Reed-Solomon code ⋮ Distinguishing and recovering generalized linearized Reed-Solomon codes ⋮ Structural attacks for public key cryptosystems based on Gabidulin codes ⋮ Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes ⋮ The syndromes decoding algorithm in group codes ⋮ Cryptanalysis of Ivanov-Krouk-Zyablov cryptosystem ⋮ A code-based hybrid signcryption scheme ⋮ On linear codes with random multiplier vectors and the maximum trace dimension property ⋮ On the unique representation of very strong algebraic geometry codes ⋮ Computational aspects of retrieving a representation of an algebraic geometry code ⋮ Code-Based Cryptosystems Using Generalized Concatenated Codes ⋮ Erasure decoding for Gabidulin codes ⋮ A NP-Complete Problem in Coding Theory with Application to Code Based Cryptography ⋮ Encryption scheme based on expanded Reed-Solomon codes ⋮ On the Berger - Loidreau Cryptosystem on the Tensor Product of Codes ⋮ Wild McEliece Incognito ⋮ Cryptanalysis of a system based on twisted Reed-Solomon codes ⋮ Classification of Hadamard products of one-codimensional subcodes of Reed-Muller codes ⋮ A Novel Niederreiter-like cryptosystem based on the (u|u + υ)-construction codes ⋮ On the structural security of a McEliece-type cryptosystem based on the sum of tensor products of binary Reed - Muller codes
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Theory of codes with maximum rank distance
- The automorphism groups of Reed-Solomon codes
- Severely denting the Gabidulin version of the McEliece public key cryptosystem
- The Security of the Gabidulin Public Key Cryptosystem
- On generator matrices of MDS codes (Corresp.)
- A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511
- Weak keys in the McEliece public-key cryptosystem
This page was built for publication: How to mask the structure of codes for a cryptographic use