How to Generate Factored Random Numbers
DOI10.1137/0217012zbMATH Open0642.10003OpenAlexW1971297422MaRDI QIDQ3783345FDOQ3783345
Authors: Eric Bach 
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
Recommendations
algorithmrandom variate generationcomputational number theoryprime factorizationprimality testingrunning time
Random number generation in numerical analysis (65C10) Primes (11A41) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to number theory (11-04)
Cited In (19)
- Counting hypergraph colorings in the local lemma regime
- Generating random factored Gaussian integers, easily
- Fast generation of prime numbers and secure public-key cryptographic parameters.
- Generating random factored numbers, easily
- Sieve algorithms for perfect power testing
- Generating random factored ideals in number fields
- A discrete logarithm implementation of perfect zero-knowledge blobs
- Asymptotic semismoothness probabilities
- Randomized algorithms in number theory
- Close to uniform prime number generation with fewer random bits
- Title not available (Why is that?)
- The dark side of ``black-box cryptography or: should we trust Capstone?
- Practic zero-knowledge proofs: Giving hints and using deficiencies
- PPAD is as hard as LWE and iterated squaring
- Synthesizers and their application to the parallel construction of pseudo-random functions
- Cryptanalysis of algebraic verifiable delay functions
- Algorithms for the Multiplication Table Problem
- Codes correcting restricted errors
- One-way permutations on elliptic curves
This page was built for publication: How to Generate Factored Random Numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3783345)
