The Number of Output Sequences of a Binary Sequence Generator

DOI10.1007/3-540-46416-6_14MaRDI QIDQ4037462zbMATH OpenOpenAlexFDO

Authors J. Dj. Golić

Publication date 18 May 1993

Published in Advances in Cryptology — EUROCRYPT ’91 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-46416-6_14

zbMATH Keywords

output sequencesbinary sequence generators for cryptographic applications

Mathematics Subject Classification ID

Cryptography (94A60) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Recommendations

• Minimal linear equivalent analysis of a variable-memory binary sequence generator
• On the balancedness of nonlinear generators of binary sequences.
• Binary Pseudo-Random Sequences Theory
• scientific article; zbMATH DE number 3273526
• An efficient algorithm to generate binary sequences for cryptographic purposes

Cited in

(2)

• A simple computational model for acceptance/rejection of binary sequence generators
• scientific article; zbMATH DE number 3273526 (Why is no real title available?)

This page was built for publication: The Number of Output Sequences of a Binary Sequence Generator

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