An efficient algorithm to generate binary sequences for cryptographic purposes

DOI10.1016/S0304-3975(00)00410-2MaRDI QIDQ5941301zbMATH OpenOpenAlexFDO

Authors Amparo Fúster-Sabater, L. J. García-Villalba

Publication date 20 August 2001

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-3975(00)00410-2

zbMATH Keywords

cryptographylinear complexitynonlinear filtersperiodpseudorandom generators

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Recommendations

• On the linear complexity of nonlinearly filtered pn-sequences
• Binary Pseudo-Random Sequences Theory
• Coding and Cryptography
• An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/
• Binary sequences from a pair of elliptic curves

Cites work

• An analysis of the structure and complexity of nonlinear binary sequence generators
• Bounds on the linear span of bent sequences
• scientific article; zbMATH DE number 4023423 (Why is no real title available?)
• scientific article; zbMATH DE number 54007 (Why is no real title available?)
• scientific article; zbMATH DE number 954401 (Why is no real title available?)
• Linear Complexity and Random Sequences
• On the general classification of nonlinear filters of \(m\)-sequences

Cited in

(5)

• JPEG image encryption using fuzzy PN sequences
• An efficient binary sequence generator with cryptographic applications
• The Number of Output Sequences of a Binary Sequence Generator
• An algorithm for generating M-sequences using the amalgamation-circles method in F₂
• Orthogonal residue sequences

This page was built for publication: An efficient algorithm to generate binary sequences for cryptographic purposes

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