Random number generators based on permutations can pass the collision test

DOI10.4213/MVK350MaRDI QIDQ3383141zbMATH OpenOpenAlexFDO

Authors A. V. Urivskiy

Publication date 23 September 2021

Published in Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography] (Search for Journal in Brave)

Full work available at URL http://mathnet.ru/eng/mvk350

zbMATH Keywords

permutationblock cipherunpredictabilitycollisionpseudorandom number generator

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• On some properties of PRNGs based on block ciphers in counter mode
• On the adequacy of pseudy-random number generators (or: How big a period do we need?)
• scientific article; zbMATH DE number 4084824
• Monkey tests for random number generators
• scientific article; zbMATH DE number 897206

Cites work

• A Proof of Security in O(2 n ) for the Xor of Two Random Permutations
• On some properties of PRNGs based on block ciphers in counter mode
• The sum of PRPs is a secure PRF

Cited in

(1)

• On some properties of PRNGs based on block ciphers in counter mode

This page was built for publication: Random number generators based on permutations can pass the collision test

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