Skip to main content
Conference ProceedingsOPEN ACCESS

Strong primes are easy to find

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1985) 209 LNCS 216-223
DOI: 10.1007/3-540-39757-4_19
44Citations
Citations of this article
40Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A simple method is given for finding strong, random, large primes of a given number of bits, for use in conjunction with the RSA Public Key Cryptosystem. A strong prime p is a prime satisfying: * p = 1 mod r * p = sāˆ’1 mod s * r = 1 mod t, where r,s and t are all large, random primes of a given number of bits. It is shown that the problem of finding strong, random, large primes is only 19% harder than finding random, large primes.

Cite

CITATION STYLE

APA

Gordon, J. (1985). Strong primes are easy to find. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 209 LNCS, pp. 216ā€“223). Springer Verlag. https://doi.org/10.1007/3-540-39757-4_19

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free