Orderly enumeration of nonsingular binary matrices applied to text encryption
From MaRDI portal
Publication:4147611
DOI10.1145/359460.359464zbMath0371.68039OpenAlexW2013727096MaRDI QIDQ4147611
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
Random number generation in numerical analysis (65C10) Information theory (general) (94A15) Information storage and retrieval of data (68P20) Theory of error-correcting codes and error-detecting codes (94B99) Algorithms in computer science (68W99)
Related Items (4)
A comparative study of some pseudorandom number generators ⋮ 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 ⋮ Classes of GFSR sequences and their fast generation
This page was built for publication: Orderly enumeration of nonsingular binary matrices applied to text encryption
