On Linear Complexity of Finite Sequences: Coding Theory and Applications to Cryptography

DOI10.1007/978-3-031-15255-9_2MaRDI QIDQ6487414zbMATH OpenFDO

Authors Edoardo Persichetti, Tovohery Hajatiana Randrianarisoa

Publication date 18 January 2023

Full work available at URL https://doi.org/10.1007/978-3-031-15255-9_2

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Authentication, digital signatures and secret sharing (94A62) Linear codes (general theory) (94B05)

Recommendations

• scientific article; zbMATH DE number 5150220
• Linear recurrent sequences over a finite field and applications in cryptography
• scientific article; zbMATH DE number 4062996
• Some Applications of Coding Theory in Computational Complexity
• scientific article; zbMATH DE number 5529045
• Progress in Cryptology - INDOCRYPT 2003
• Linear complexity of a class of pseudorandom sequences over a general finite field
• scientific article; zbMATH DE number 606784
• Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
• On the linear complexity of Legendre-Sidelnikov sequences

Cites work

• A reaction attack against cryptosystems based on LRPC codes
• An algebraic attack on rank metric code-based cryptosystems
• Analysis of the Berlekamp-Massey Linear Feedback Shift-Register Synthesis Algorithm
• Compact McEliece keys based on quasi-dyadic Srivastava codes
• Compact McEliece keys from Goppa codes
• Durandal: a rank metric based signature scheme
• scientific article; zbMATH DE number 3989251 (Why is no real title available?)
• scientific article; zbMATH DE number 1284420 (Why is no real title available?)
• scientific article; zbMATH DE number 967590 (Why is no real title available?)
• Improvements of algebraic attacks for solving the rank decoding and MinRank problems
• LESS is more: code-based signatures without syndromes
• LESS-FM: fine-tuning signatures from the code equivalence problem
• On the inherent intractability of certain coding problems (Corresp.)
• Reducing Key Length of the McEliece Cryptosystem
• Some new NP-complete coding problems
• Syndrome decoding in the head: shorter signatures from zero-knowledge proofs
• Transform Techniques for Error Control Codes

Cited in

(3)

• Recent results and problems on constructions of linear codes from cryptographic functions
• Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
• On binary linear codes and binary pseudo-random sequences

This page was built for publication: On Linear Complexity of Finite Sequences: Coding Theory and Applications to Cryptography

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487414)