Encryption and decryption devices for public-key cryptosystems and recording medium with their processing programs recorded thereon
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
Nov 12, 2002
Grant Date -
N/A
app pub date -
Dec 17, 1998
filing date -
Dec 17, 1997
priority date (Note) -
In Force
status (Latency Note)
Importance
Abstract
In a public-key cryptosystem based on a multiplicative group, n=p.sup.2 q, where p and q are odd primes, and g, selected from (Z/nZ)* such that g.sub.p =g.sup.r-1 mod p.sup.2 has an order of p in (Z/ p.sup.2 Z)*, are made public. A plaintext m, a random number and n are used to calculate m+rn, and n and g are used to compute C=g.sup.m+rn mod n to generate it as ciphertext. For the ciphertext C, C mod p.sup.2 is calculated, then C.sub.p =C.sup.p-1 mod p.sup.2 is calculated to obtain (C.sub.p-1)/p=L(C.sub.p), and L(C.sub.p) is multiplied by a secret key L(g.sub.p).sup.-1 mod p to obtain the plaintext m.
First Claim
Family
International Classification(s)
Cited Art Landscape
Patent Citation Ranking
Recipient Email Address
Recipient Email Address
Comment
Recipient Email Address
Add to Portfolio(s)
To add this patent to one, or more, of your portfolios, simply click the add button.
This Patent is in these Portfolios:
Add to additional portfolios:
Last Refreshed On:
Changes done successfully