Abstract
Prime numbers satisying certain constraints are used in public-key cryptosystems. Consequently, some attention has been paid to algorithms which allow large, cryptographically useful, primes to be created. One algorithm, devised by Miller and Trbovich, was neglected until Nick Demytko of Telecom Research Laboratories published a theoretical examination of it in 1988. At Telecom's invitation the following practical analysis of the method was undertaken. An implementation of the algorithm was written, and nearly one million primes generated, and analysed. This paper gives details of the algorithm, implementation, experiments and results, and draws conclusions about the applicability of the algorithm.
This research was supported by Telecom Australia under contract 7027
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Condie, L.: Speech Signal Analysis and Investigations in Cryptography. Ph.D. thesis, Dept. of Computer Science, University College, University of New South Wales, Australian Defence Force Academy, 1991.
Demytko, N.: Generating multiprecision integers with guaranteed primality. IFIP SEC '88: Computer security in the age of information. 1988.
Ganley, M. J.: Note on the generation of p0 for RSA keysets. Electronics Letters, 26(6), 1990.
Gordon, J.: Strong RSA keys. Electronics Letters, 20(12), 1984.
Gordon, J.: Strong primes are easy to find. In Advances in Cryptology — Eurocrypt 84, Springer-Verlag, 1984.
Miller, W. J., Trbovich, N. G.: RSA public-key data encryption system having large random prime number generating microprocessor or the like. International Patent Classification: H04L9/00, International Publication Number: WO82/02129, 1982.
Shawe-Taylor, J.: Generating strong primes. Electronics Letters, 22(16), 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Condie, L. (1993). Prime generation with the Demytko-Miller-Trbovich algorithm. In: Seberry, J., Zheng, Y. (eds) Advances in Cryptology — AUSCRYPT '92. AUSCRYPT 1992. Lecture Notes in Computer Science, vol 718. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57220-1_79
Download citation
DOI: https://doi.org/10.1007/3-540-57220-1_79
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57220-6
Online ISBN: 978-3-540-47976-5
eBook Packages: Springer Book Archive