A Method for Generating Crytographically Strong Primes

Mitsunori OGIWARA

A Method for Generating Crytographically Strong Primes

Mitsunori OGIWARA

Full Text Views

0

Share
Cite this

Summary :

After Diffie and Hellman's paper, there have been published many cryptosystems, where large composite numbers are used as the public keys, and the factorization of them are used as the secret keys. But, on the other hand, there also have been published many integer-factoring algorithms that factor composite numbers rapidly. So methodologies to construct primes that are strong for such algorithms are needed to guarantee the safety of such cryptosystems. Here we propose a randon polynomial time algorithm for constructing strong primes that uses a probabilistic primality testing algorithm.

Publication: IEICE TRANSACTIONS on transactions Vol.E73-E No.6 pp.985-994

Publication Date: 1990/06/25

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Information Security

Authors

Mitsunori OGIWARA

Keyword

Cite this

Copy

Mitsunori OGIWARA, "A Method for Generating Crytographically Strong Primes" in IEICE TRANSACTIONS on transactions, vol. E73-E, no. 6, pp. 985-994, June 1990, doi: .
Abstract: After Diffie and Hellman's paper, there have been published many cryptosystems, where large composite numbers are used as the public keys, and the factorization of them are used as the secret keys. But, on the other hand, there also have been published many integer-factoring algorithms that factor composite numbers rapidly. So methodologies to construct primes that are strong for such algorithms are needed to guarantee the safety of such cryptosystems. Here we propose a randon polynomial time algorithm for constructing strong primes that uses a probabilistic primality testing algorithm.
URL: https://globals.ieice.org/en_transactions/transactions/10.1587/e73-e_6_985/_p

Copy

@ARTICLE{e73-e_6_985,
author={Mitsunori OGIWARA, },
journal={IEICE TRANSACTIONS on transactions},
title={A Method for Generating Crytographically Strong Primes},
year={1990},
volume={E73-E},
number={6},
pages={985-994},
abstract={After Diffie and Hellman's paper, there have been published many cryptosystems, where large composite numbers are used as the public keys, and the factorization of them are used as the secret keys. But, on the other hand, there also have been published many integer-factoring algorithms that factor composite numbers rapidly. So methodologies to construct primes that are strong for such algorithms are needed to guarantee the safety of such cryptosystems. Here we propose a randon polynomial time algorithm for constructing strong primes that uses a probabilistic primality testing algorithm.},
keywords={},
doi={},
ISSN={},
month={June},}

Copy

TY - JOUR
TI - A Method for Generating Crytographically Strong Primes
T2 - IEICE TRANSACTIONS on transactions
SP - 985
EP - 994
AU - Mitsunori OGIWARA
PY - 1990
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E73-E
IS - 6
JA - IEICE TRANSACTIONS on transactions
Y1 - June 1990
AB - After Diffie and Hellman's paper, there have been published many cryptosystems, where large composite numbers are used as the public keys, and the factorization of them are used as the secret keys. But, on the other hand, there also have been published many integer-factoring algorithms that factor composite numbers rapidly. So methodologies to construct primes that are strong for such algorithms are needed to guarantee the safety of such cryptosystems. Here we propose a randon polynomial time algorithm for constructing strong primes that uses a probabilistic primality testing algorithm.
ER -