Simple and effective public-key cryptosystem
First Claim
1. A method of securely communicating over an insecure communication channel of the type wherein an original information signal is transformed into an encoded information signal according to an encryption algorithm, transmitted over said information channel between a transmitter and a receiver, received by said receiver and decoded to obtain said original information signal, said original information signal comprising at least two integers m1 and m2 where at least m1 represents information and 0<
- m1 <
M1 and 0<
m2 <
M2, where M1 and M2 are integers, said method comprising the steps of;
producing a cryptogram x from said original information signal and a public encryption key (c1, c2 r), where c1, c2 and r are all integers, r is the product of two relatively prime numbers p1 and p2, and c1 and r are well as c2 and r are relatively prime, said cryptogram x being defined by;
space="preserve" listing-type="equation">x=c.sub.1 m.sub.1 +c.sub.2 m.sub.2 (mod r)where c1 m1 +c2 m2 (mod r) is defined as the remainder of (c1 m1 +c2 m2)/r;
transmitting said cryptogram x as said encoded information signal from said transmitter to said receiver;
receiving said encoded information signal at said receiver;
generating two simultaneous linear equations from said encryption algorithm; and
solving said two simultaneous linear equations using said received cryptogram x, to thereby obtain said integers m1 and m2 of said original information signal.
1 Assignment
0 Petitions
Accused Products
Abstract
A public encryption key (c1, c2, r) in which r is the product of two relatively prime numbers, and in which c1 and r, as well as c2 and r, are relatively prime numbers, is used in an encryption algorithm
x=c.sub.1 m.sub.1 +c.sub.2 m.sub.2 (mod r).
The decryption algorithm will be equivalent to solving simultaneous linear equations derived from the encryption algorithm. Thus, both encrypting and decrypting are quite simplified while still maintaining a high degree of security.
-
Citations
6 Claims
-
1. A method of securely communicating over an insecure communication channel of the type wherein an original information signal is transformed into an encoded information signal according to an encryption algorithm, transmitted over said information channel between a transmitter and a receiver, received by said receiver and decoded to obtain said original information signal, said original information signal comprising at least two integers m1 and m2 where at least m1 represents information and 0<
- m1 <
M1 and 0<
m2 <
M2, where M1 and M2 are integers, said method comprising the steps of;producing a cryptogram x from said original information signal and a public encryption key (c1, c2 r), where c1, c2 and r are all integers, r is the product of two relatively prime numbers p1 and p2, and c1 and r are well as c2 and r are relatively prime, said cryptogram x being defined by;
space="preserve" listing-type="equation">x=c.sub.1 m.sub.1 +c.sub.2 m.sub.2 (mod r)where c1 m1 +c2 m2 (mod r) is defined as the remainder of (c1 m1 +c2 m2)/r; transmitting said cryptogram x as said encoded information signal from said transmitter to said receiver; receiving said encoded information signal at said receiver; generating two simultaneous linear equations from said encryption algorithm; and solving said two simultaneous linear equations using said received cryptogram x, to thereby obtain said integers m1 and m2 of said original information signal. - View Dependent Claims (2, 3, 4, 5, 6)
- m1 <
Specification