Presentation 1998/7/31
Notes on Methods for Generating Primes
Yoshizo SATO, Yasuyuki MURAKAMI, Masao KASAHARA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In these days, many modern cryptosystems are based on factoring problem or discrete logarithm problem. Thus it is important to investigate the primes. In this paper, first, we consider the distribution of Sophie Germain prime and twin primes. Second, we sugest the method to generate primes efficiently. Finally, we apply twin primes and Sophie Germain prime to our method for generating primes to make it invulnerable to P+1 and P-1 method.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) twin primes / Sophie Germain prime / P-1 method / P+1 method
Paper # ISEC98-22
Date of Issue

Conference Information
Committee ISEC
Conference Date 1998/7/31(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Security (ISEC)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Notes on Methods for Generating Primes
Sub Title (in English)
Keyword(1) twin primes
Keyword(2) Sophie Germain prime
Keyword(3) P-1 method
Keyword(4) P+1 method
1st Author's Name Yoshizo SATO
1st Author's Affiliation Department of Information Science and Design, Kyoto Institute of Technology()
2nd Author's Name Yasuyuki MURAKAMI
2nd Author's Affiliation Department of Information Science and Design, Kyoto Institute of Technology
3rd Author's Name Masao KASAHARA
3rd Author's Affiliation Department of Information Science and Design, Kyoto Institute of Technology
Date 1998/7/31
Paper # ISEC98-22
Volume (vol) vol.98
Number (no) 228
Page pp.pp.-
#Pages 5
Date of Issue