How to Generate Factored Random Numbers
From MaRDI portal
Publication:3783345
DOI10.1137/0217012zbMath0642.10003MaRDI QIDQ3783345
Publication date: 1988
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0217012
algorithm; random variate generation; computational number theory; prime factorization; primality testing; running time
65C10: Random number generation in numerical analysis
11-04: Software, source code, etc. for problems pertaining to number theory
11A41: Primes
68W99: Algorithms in computer science
Related Items
Asymptotic semismoothness probabilities, A discrete logarithm implementation of perfect zero-knowledge blobs, Practic zero-knowledge proofs: Giving hints and using deficiencies, Synthesizers and their application to the parallel construction of pseudo-random functions, Fast generation of prime numbers and secure public-key cryptographic parameters., One-way permutations on elliptic curves, Sieve algorithms for perfect power testing