Generating and testing cryptographically secure random numbers

MaRDI QIDQ3428856zbMATH OpenFDO

Authors Gergely Borbás, Pál András Papp, Tibor O. H. Nemetz

Publication date 29 March 2007

zbMATH Keywords

cryptographically securerandom numbers

Mathematics Subject Classification ID

Pseudo-random numbers; Monte Carlo methods (11K45) Random number generation in numerical analysis (65C10) Data encryption (aspects in computer science) (68P25)

Recommendations

• scientific article; zbMATH DE number 176069
• scientific article; zbMATH DE number 17389
• scientific article; zbMATH DE number 897206
• scientific article; zbMATH DE number 934075
• Generating good pseudo-random numbers

Cited in

(13)

• Experimental study of the efficiency of generators of pseudo-random numbers based on the RC5 and RC6 cryptographic algorithms
• Combining the solitaire encryption algorithm with lagged Fibonacci pseudorandom number generators
• scientific article; zbMATH DE number 1954177 (Why is no real title available?)
• scientific article; zbMATH DE number 1979300 (Why is no real title available?)
• scientific article; zbMATH DE number 1979301 (Why is no real title available?)
• Cryptanalytic attacks on pseudorandom number generators
• scientific article; zbMATH DE number 1878326 (Why is no real title available?)
• scientific article; zbMATH DE number 897206 (Why is no real title available?)
• On Random Number Generation for Kernel Applications
• Construction of RNG using random automata and ``one-way functions
• Cryptography based on transcendental numbers
• Exploiting randomness on continuous sets
• An improvement of a cryptanalysis algorithm

This page was built for publication: Generating and testing cryptographically secure random numbers

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