The search functionality is under construction.
The search functionality is under construction.

New Methods of Generating Primes Secure against Both P-1 and P+1 Methods

Yoshizo SATO, Yasuyuki MURAKAMI, Masao KASAHARA

  • Full Text Views

    0

  • Cite this

Summary :

Since cryptosystem based on the problem of factoring the composite number N can be attacked with P-1 and P+1 methods, it is required that P-1 and P+1 should be difficult to be factored into many small primes, where we assume that the P is a factor of N. In this paper, first, we consider the distribution of secure primes against both P-1 and P+1 methods. Second, we propose two efficient algorithms for generating secure primes against both P-1 and P+1 methods by extending the trial division method.

Publication
IEICE TRANSACTIONS on Fundamentals Vol.E82-A No.10 pp.2161-2166
Publication Date
1999/10/25
Publicized
Online ISSN
DOI
Type of Manuscript
Special Section PAPER (Special Section on Information Theory and Its Applications)
Category
Security

Authors

Keyword