Design of high-quality of pseudo-random sequence generators

MaRDI QIDQ2563393zbMATH OpenFDO

Authors Yanyan Li

Publication date 11 December 1996

Published in Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)

zbMATH Keywords

finite automatapseudo-random sequence generator

Mathematics Subject Classification ID

Cryptography (94A60)

Review text

The problem of high quality pseudo-random sequence generators in cryptography is considered. The authors propose to implement a combination of two automata each of which is simple.

Cited in

(2)

• Algorithm 647: Implementation and Relative Efficiency of Quasirandom Sequence Generators
• scientific article; zbMATH DE number 910854 (Why is no real title available?)

This page was built for publication: Design of high-quality of pseudo-random sequence generators

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