On Linear Complexity of Finite Sequences: Coding Theory and Applications to Cryptography
From MaRDI portal
Publication:6487414
DOI10.1007/978-3-031-15255-9_2zbMath1520.94089MaRDI QIDQ6487414
Tovohery Hajatiana Randrianarisoa, Edoardo Persichetti
Publication date: 18 January 2023
Linear codes (general theory) (94B05) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some new NP-complete coding problems
- An algebraic attack on rank metric code-based cryptosystems
- LESS-FM: fine-tuning signatures from the code equivalence problem
- A reaction attack against cryptosystems based on LRPC codes
- Durandal: a rank metric based signature scheme
- Improvements of algebraic attacks for solving the rank decoding and MinRank problems
- Reducing Key Length of the McEliece Cryptosystem
- Compact McEliece Keys from Goppa Codes
- Analysis of the Berlekamp-Massey Linear Feedback Shift-Register Synthesis Algorithm
- On the inherent intractability of certain coding problems (Corresp.)
- Transform Techniques for Error Control Codes
- Compact McEliece keys based on quasi-dyadic Srivastava codes
- LESS is More: Code-Based Signatures Without Syndromes
- Syndrome decoding in the head: shorter signatures from zero-knowledge proofs
This page was built for publication: On Linear Complexity of Finite Sequences: Coding Theory and Applications to Cryptography
