Communication system for messages enciphered according to an RSA-type procedure
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
Jun 2, 1998
Grant Date -
N/A
app pub date -
Jul 18, 1996
filing date -
Jul 26, 1995
priority date (Note) -
In Force
status (Latency Note)
Importance
Abstract
The procedure involves key numbers 'd' and 'e' and a modulus N, so hat 'N' is the product of two factors 'p' and 'q' which are prime numbers N=p.q, and e.d=1.sub.MOD.phi.(N), where .phi.(N) is the Euler indicator function. The procedure provides enciphered message parts and for deciphering them comprises: a modulus-determining step for determining a deciphering modulus chosen from 'p' and 'q', a modular reduction step for making a first modular reduction of the number 'd' with a modulus equal to said deciphering modulus '(p-1),(q-1)' with the aim of producing a reduced number, a reduction step for making a second modular reduction of each enciphered message part with a modulus equal to said deciphering modulus with the aim of producing a reduced enciphered message part, an exponentiation step for computing a modular exponentiation of each reduced enciphered message part with a modulus equal to said deciphering modulus and with an exponent equal to said reduced number with the aim of restoring said message.
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