The syndromes decoding algorithm in group codes
From MaRDI portal
Publication:6156920
DOI10.1016/j.ffa.2023.102206zbMath1522.94116OpenAlexW4365505970MaRDI QIDQ6156920
Consuelo Martínez, Unnamed Author
Publication date: 19 June 2023
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ffa.2023.102206
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Decoding (94B35)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New examples of non-abelian group codes
- Enhanced public key security for the McEliece cryptosystem
- Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes
- An intrinsical description of group codes
- A reaction attack on the QC-LDPC McEliece cryptosystem
- McEliece public key cryptosystems using algebraic-geometric codes
- When are all group codes of a noncommutative group abelian (a computational approach)?
- Reducing the key size of McEliece cryptosystem from automorphism-induced Goppa codes via permutations
- Non-abelian group codes over an arbitrary finite field
- How to mask the structure of codes for a cryptographic use
- GROUP CODES OVER NON-ABELIAN GROUPS
- Algebraic Attack against Variants of McEliece with Goppa Polynomial of a Special Form
- Cryptanalysis of the Niederreiter Public Key Scheme Based on GRS Subcodes
- Reducing Key Length of the McEliece Cryptosystem
- A public-key cryptosystem based on binary Reed-Muller codes
- On the edge-independence number and edge-covering number for regular graphs
- Compact McEliece keys based on quasi-dyadic Srivastava codes
- Cryptanalysis of the Sidelnikov Cryptosystem
- Public Key Cryptography - PKC 2006