How to Generate Factored Random Numbers
From MaRDI portal
Recommendations
Cited in
(23)- Practic zero-knowledge proofs: Giving hints and using deficiencies
- Synthesizers and their application to the parallel construction of pseudo-random functions
- Generating random factored numbers, easily
- Fast generation of prime numbers and secure public-key cryptographic parameters.
- One-way permutations on elliptic curves
- Sieve algorithms for perfect power testing
- Algorithms for the Multiplication Table Problem
- Generating random factored Gaussian integers, easily
- The dark side of ``black-box cryptography or: should we trust Capstone?
- Randomized algorithms in number theory
- Generating random factored ideals in number fields
- Asymptotic semismoothness probabilities
- scientific article; zbMATH DE number 2119690 (Why is no real title available?)
- Close to uniform prime number generation with fewer random bits
- Counting hypergraph colorings in the local lemma regime
- PPAD is as hard as LWE and iterated squaring
- Cryptanalysis of algebraic verifiable delay functions
- Codes correcting restricted errors
- A complete security proof of SQIsign
- How (not) to hash into class groups of imaginary quadratic fields?
- SQIsign2D-West. The fast, the small, and the safer
- Sampling cubic rings
- A discrete logarithm implementation of perfect zero-knowledge blobs
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)
