This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
E. Bach and J. Shallit, “Factoring with cyclotomic polynomials,” Mathematics of Computation, Vol. 52, 1989, pp. 201–219.
J. Brandt, I.B. Damgård and P. Landrock, “Speeding up prime number generation,” Advances in Cryptology, Proc. Asiacrypt'91, LNCS 739, H. Imai, R. Rivest, and T. Matsumoto, Eds., Springer-Verlag, 1993, pp. 440–449.
J. Brandt and I.B. Damgård, “On generation of probable primes by incremental search,” Advances in Cryptology, Proc. Crypto'92, LNCS 740, E.F. Brickell, Ed., Springer-Verlag, 1993, pp. 358–369.
J. Brillhart, D.H. Lehmer and J.L. Selfridge, “New primality criteria and factorizations of 2m±1,” Mathematics of Computation, Vol. 29, 1975, pp. 620–647.
I.B. Damgård, P. Landrock and C. Pomerance, “Average case error estimates for the strong probable prime test,” Mathematics of Computation, Vol. 61, 1993, pp. 177–194.
M.J. Ganley, “Note on the generation of p0 for RSA keysets,” Electronic Letters, Vol. 26, No. 6, 1990, p. 369.
J. Gordon, “Strong primes are easy to find,” Advances in Cryptology, Proc. Eurocrypt'84, LNCS 209, N. Cot, T. Beth, and I. Ingemarsson, Eds., Springer-Verlag, 1985, pp. 216–223.
D.E. Knuth, The Art of Computer Programming, Vol. 2: Seminumerical Algorithms, 2nd Edition, Addison-Wesley, Reading Mass., 1981.
A.K. Lenstra and M.S. Manasse, “Factoring with two large primes,” Advances in Cryptology, Proc. Eurocrypt'90, LNCS 473, I.B. Damgård, Ed., Springer-Verlag, 1991, pp. 72–82.
A.K. Lenstra, H.W. Lenstra, Jr., M.S. Manasse and J.M. Pollard, “The number field sieve,” Proc. 22nd ACM Symp. Theory of Computing, 1990, pp. 464–572.
U.M. Maurer, “Fast generation of secure RSA-products with almost maximal diversity,” Advances in Cryptology, Proc. Eurocrypt'89, LNCS 434, J.-J. Quisquater and J. Vandewalle, Eds., Springer-Verlag, 1990, pp. 636–647.
S. Micali and C.P. Schnorr, “Efficient perfect polynomial random number generators,” Journal of Cryptology, Vol. 3, No. 3, 1991, pp. 157–172.
C. Pomerance, “On the distribution of pseudoprimes,” Mathematics of Computation, Vol. 37, 1981, pp. 587–593.
H.C. Williams, “A Modification of the RSA Public-Key Encryption Procedure,” IEEE Trans. on Information Theory, Vol. IT-26, No. 6, 1980, pp. 726–729.
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bosselaers, A., Preneel, B. (1995). RSA key generation. In: Bosselaers, A., Preneel, B. (eds) Integrity Primitives for Secure Information Systems. Lecture Notes in Computer Science, vol 1007. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60640-8_11
Download citation
DOI: https://doi.org/10.1007/3-540-60640-8_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60640-6
Online ISBN: 978-3-540-48517-9
eBook Packages: Springer Book Archive