Orderly enumeration of nonsingular binary matrices applied to text encryption

DOI10.1145/359460.359464MaRDI QIDQ4147611zbMATH OpenOpenAlexWikidataFDO

Authors W. H. Payne, K. L. McMillen

Publication date 1978

Published in Communications of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/359460.359464

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Information storage and retrieval of data (68P20) Algorithms in computer science (68W99) Information theory (general) (94A15) Theory of error-correcting codes and error-detecting codes (94B99)

Cited in

(4)

• A comparative study of some pseudorandom number generators
• Classes of GFSR sequences and their fast generation
• Random number generation with the recursion \(X_ t=X_{t-3p}\oplus X_{t-3q}\)
• An equivalence relation between Tausworthe and GFSR sequences and applications

This page was built for publication: Orderly enumeration of nonsingular binary matrices applied to text encryption

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