Fast Generation of Secure RSA-Moduli with Almost Maximal Diversity
- 18 May 2001
- book chapter
- Published by Springer Nature
- p. 636-647
- https://doi.org/10.1007/3-540-46885-4_60
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Strong Primes are Easy to FindPublished by Springer Nature ,2000
- Implementation of a New Primality TestMathematics of Computation, 1987
- Almost all primes can be quickly certifiedPublished by Association for Computing Machinery (ACM) ,1986
- A public key cryptosystem and a signature scheme based on discrete logarithmsIEEE Transactions on Information Theory, 1985
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984
- Primality Testing and Jacobi SumsMathematics of Computation, 1984
- On Distinguishing Prime Numbers from Composite NumbersAnnals of Mathematics, 1983
- How to generate random integers with known factorizationPublished by Association for Computing Machinery (ACM) ,1983
- New directions in cryptographyIEEE Transactions on Information Theory, 1976
- New Primality Criteria and Factorizations of 2 m ± 1Mathematics of Computation, 1975