A Deterministic Method of Large Prime Number Generation 


Vol. 7,  No. 9, pp. 2913-2919, Sep.  2000
10.3745/KIPSTE.2000.7.9.2913


PDF
  Abstract

It is essential to get large prime numbers in the design of asymmetric encryption algorithm. However, the pseudoprime numbers with high possibility to be primes have been generally used in the asymmetric encryption algorithms, because it is very difficult to find large deterministic prime numbers. In this paper, we propose a new method of deterministic prime number generation. The prime numbers generated by the proposed method have a 100% precise prime characteristic. They are also guaranteed reliability, security strength, and an ability of primitive element generation.

  Statistics
  Cite this article

[IEEE Style]

J. G. Park, B. J. Park, K. Y. Baek, W. S. Chun, J. C. Ryou, "A Deterministic Method of Large Prime Number Generation," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 7, no. 9, pp. 2913-2919, 2000. DOI: 10.3745/KIPSTE.2000.7.9.2913.

[ACM Style]

Jung Gil Park, Bong Joo Park, Ki Young Baek, Wang Sung Chun, and Jae Cheol Ryou. 2000. A Deterministic Method of Large Prime Number Generation. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 7, 9, (2000), 2913-2919. DOI: 10.3745/KIPSTE.2000.7.9.2913.

Forms

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)

Old Journals

Indexing

All publications of TKIPS is indexed in DOI, EBSCO, Google Scholar, Crossref, and CrossCheck.

TKIPS is also selected as the Journal for Accreditation by NRF (National Research Foundation of Korea).

Related Journals