The Secure Generation of RSA Moduli Using Poor RNG
George Purdy

TL;DR
This paper presents a method, called Lenstra's fix, for generating secure RSA moduli despite the use of weak random number generators, enhancing cryptographic security in resource-constrained environments.
Contribution
Introduces a novel procedure to securely generate RSA moduli using poor RNGs, improving cryptographic robustness.
Findings
The procedure effectively mitigates risks from weak RNGs.
It ensures the generation of secure RSA moduli under adverse conditions.
Provides a practical solution for cryptography in constrained environments.
Abstract
We discuss a procedure, which should be called Lenstra's fix, for producing secure RSA moduli even when the random number generation is very poor.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsChaos-based Image/Signal Encryption · Cryptography and Residue Arithmetic
