Elliptic Curve Cryptosytems and Their Applications

Kenji KOYAMA  Tatsuaki OKAMOTO  

Publication
IEICE TRANSACTIONS on Information and Systems   Vol.E75-D   No.1   pp.50-57
Publication Date: 1992/01/25
Online ISSN: 
DOI: 
Print ISSN: 0916-8532
Type of Manuscript: Special Section PAPER (Special Section on Theoretical Foundations of Computing)
Category: 
Keyword: 
public-key cryptosystem,  elliptic curve,  factoring,  

Full Text: PDF(643.5KB)>>
Buy this Article




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.