The study of some pseudorandom sequences used in cryptography

DOI10.5209/REV_REMA.1998.V11.N1.17307MaRDI QIDQ1128206zbMATH OpenOpenAlexWikidataFDO

Authors Pino Caballero-Gil, Amparo Fúster-Sabater

Publication date 8 November 1998

Published in Revista Matemática Complutense (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/44475

zbMATH Keywords

linear complexitypseudorandom binary sequencesstream ciphers

Mathematics Subject Classification ID

Pseudo-random numbers; Monte Carlo methods (11K45) Random number generation in numerical analysis (65C10) Analysis of algorithms and problem complexity (68Q25) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Recommendations

• Binary Pseudo-Random Sequences Theory
• On finite pseudorandom binary sequences and their applications in cryptography
• Linear Complexity and Random Sequences
• An algorithm for the k-error linear complexity of binary sequences with period 2/sup n/

Cited in

(5)

• scientific article; zbMATH DE number 5901698 (Why is no real title available?)
• Binary Pseudo-Random Sequences Theory
• scientific article; zbMATH DE number 4055526 (Why is no real title available?)
• Linear Complexity and Random Sequences
• On finite pseudorandom binary sequences and their applications in cryptography

This page was built for publication: The study of some pseudorandom sequences used in cryptography

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