Secure and fast encryption (SAFE) with classical random number generators

DOI10.1145/3212673MaRDI QIDQ4611316zbMATH OpenOpenAlexWikidataFDO

Authors Lih-Yuan Deng, Jyh-Jen Horng Shiau, Henry Horng-Shing Lu, Dale Bowman

Publication date 18 January 2019

Published in ACM Transactions on Mathematical Software (Search for Journal in Brave)

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

zbMATH Keywords

MRGMT19937mutual-shuffling generatornext number predictor (NNP)pseudo-random number generator (PRNG)RC4

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Numerical algorithms for specific classes of architectures (65Y10) Cryptography (94A60)

Recommendations

• Design of Practical and Provably Good Random Number Generators
• scientific article; zbMATH DE number 897206
• Cryptanalytic attacks on pseudorandom number generators
• scientific article; zbMATH DE number 910854
• scientific article; zbMATH DE number 2086718

Cited in

(4)

• Guaranteeing the diversity of number generators
• A matrix PRNG with s-box output filtering
• An improved method for predicting truncated multiple recursive generators with unknown parameters
• Developments in secure random number generators

This page was built for publication: Secure and fast encryption (SAFE) with classical random number generators

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