Elliptic Curve Cryptosytems and Their Applications

Kenji KOYAMA; Tatsuaki OKAMOTO

Elliptic Curve Cryptosytems and Their Applications

Kenji KOYAMA, Tatsuaki OKAMOTO

Full Text Views

0

Share
Cite this

Summary :

We propose two types of public-key cryptographic schemes based on elliptic curves modulo n, where n is the product of secret large primes p and q. The RSA-type scheme has an encryption function with an odd multiplier. The Rabin-type scheme has an encryption function with a multiplier of 2. The security of the proposed schemes is based on the difficulty of factoring n. Other security characteristics are also discussed. We show some applications to a master key scheme and blind signature scheme.

Publication: IEICE TRANSACTIONS on Information Vol.E75-D No.1 pp.50-57

Publication Date: 1992/01/25

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Section on Theoretical Foundations of Computing)

Category

Cite this

Copy

Kenji KOYAMA, Tatsuaki OKAMOTO, "Elliptic Curve Cryptosytems and Their Applications" in IEICE TRANSACTIONS on Information, vol. E75-D, no. 1, pp. 50-57, January 1992, doi: .
Abstract: We propose two types of public-key cryptographic schemes based on elliptic curves modulo n, where n is the product of secret large primes p and q. The RSA-type scheme has an encryption function with an odd multiplier. The Rabin-type scheme has an encryption function with a multiplier of 2. The security of the proposed schemes is based on the difficulty of factoring n. Other security characteristics are also discussed. We show some applications to a master key scheme and blind signature scheme.
URL: https://globals.ieice.org/en_transactions/information/10.1587/e75-d_1_50/_p

Copy

@ARTICLE{e75-d_1_50,
author={Kenji KOYAMA, Tatsuaki OKAMOTO, },
journal={IEICE TRANSACTIONS on Information},
title={Elliptic Curve Cryptosytems and Their Applications},
year={1992},
volume={E75-D},
number={1},
pages={50-57},
abstract={We propose two types of public-key cryptographic schemes based on elliptic curves modulo n, where n is the product of secret large primes p and q. The RSA-type scheme has an encryption function with an odd multiplier. The Rabin-type scheme has an encryption function with a multiplier of 2. The security of the proposed schemes is based on the difficulty of factoring n. Other security characteristics are also discussed. We show some applications to a master key scheme and blind signature scheme.},
keywords={},
doi={},
ISSN={},
month={January},}

Copy

TY - JOUR
TI - Elliptic Curve Cryptosytems and Their Applications
T2 - IEICE TRANSACTIONS on Information
SP - 50
EP - 57
AU - Kenji KOYAMA
AU - Tatsuaki OKAMOTO
PY - 1992
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E75-D
IS - 1
JA - IEICE TRANSACTIONS on Information
Y1 - January 1992
AB - We propose two types of public-key cryptographic schemes based on elliptic curves modulo n, where n is the product of secret large primes p and q. The RSA-type scheme has an encryption function with an odd multiplier. The Rabin-type scheme has an encryption function with a multiplier of 2. The security of the proposed schemes is based on the difficulty of factoring n. Other security characteristics are also discussed. We show some applications to a master key scheme and blind signature scheme.
ER -