How to Generate Factored Random Numbers
From MaRDI portal
Publication:3783345
DOI10.1137/0217012zbMath0642.10003OpenAlexW1971297422MaRDI 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
algorithmrandom variate generationcomputational number theoryprime factorizationprimality testingrunning time
Random number generation in numerical analysis (65C10) Software, source code, etc. for problems pertaining to number theory (11-04) Primes (11A41) Algorithms in computer science (68W99)
Related Items (14)
Sieve algorithms for perfect power testing ⋮ Generating random factored Gaussian integers, easily ⋮ The Dark Side of “Black-Box” Cryptography or: Should We Trust Capstone? ⋮ Fast generation of prime numbers and secure public-key cryptographic parameters. ⋮ Algorithms for the Multiplication Table Problem ⋮ PPAD is as hard as LWE and iterated squaring ⋮ A discrete logarithm implementation of perfect zero-knowledge blobs ⋮ Practic zero-knowledge proofs: Giving hints and using deficiencies ⋮ Generating random factored ideals in number fields ⋮ Codes correcting restricted errors ⋮ One-way permutations on elliptic curves ⋮ Asymptotic semismoothness probabilities ⋮ Counting Hypergraph Colorings in the Local Lemma Regime ⋮ Synthesizers and their application to the parallel construction of pseudo-random functions
This page was built for publication: How to Generate Factored Random Numbers