Efficient deterministic and non-deterministic pseudorandom number generation
From MaRDI portal
Publication:1996941
Recommendations
Cites work
- scientific article; zbMATH DE number 1583765 (Why is no real title available?)
- scientific article; zbMATH DE number 1942441 (Why is no real title available?)
- scientific article; zbMATH DE number 854547 (Why is no real title available?)
- (Non-)random sequences from (non-)random permutations -- analysis of RC4 stream cipher
- Attacks on the RC4 stream cipher
- Cryptanalysis of Sosemanuk and SNOW 2.0 Using Linear Masks
- MARC: modified ARC4
- Statistical attack on RC4. Distinguishing WPA
- TestU01
- The Stream Cipher HC-128
Cited in
(14)- On Optimal GFSR Pseudorandom Number Generators
- Number-theoretic constructions of efficient pseudo-random functions
- An asymptotically perfect pseudorandom generator
- Optimized random number generation in an interval
- True random number generation from bioelectrical and physical signals
- Efficient implementation of Bailey and Borwein pseudo-random number generator based on normal numbers
- Efficient Parallel Pseudorandom Number Generation
- MaD0: an ultrafast nonlinear pseudorandom number generator
- scientific article; zbMATH DE number 6985601 (Why is no real title available?)
- Implementing a chaotic cryptosystem in a 64-bit embedded system by using multiple-precision arithmetic
- Efficient Pseudorandom Generators Based on the DDH Assumption
- An efficient image encryption scheme based on chaotic and deoxyribonucleic acid sequencing
- Separation of random number generation and resolvability
- A novel method for generating pseudorandom integer strings and pseudorandom sequences
This page was built for publication: Efficient deterministic and non-deterministic pseudorandom number generation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1996941)