초록 ▼

A cryptographic system transmits a computationally secure cryptogram that is generated from a secret transformation of the message sent by the authorized transmitter; the cryptogram is again transformed by the authorized receiver using a secret reciprocal transformation to reproduce the message sent

A cryptographic system transmits a computationally secure cryptogram that is generated from a secret transformation of the message sent by the authorized transmitter; the cryptogram is again transformed by the authorized receiver using a secret reciprocal transformation to reproduce the message sent. The secret transformations use secret cipher keys that are known only by the authorized transmitter and receiver. The transformations are performed with nonsecret operations, exponentiation, that are easily performed but extremely difficult to invert. It is computationally infeasible for an eavesdropper either to solve known plaintext-ciphertext pairs for the secret cipher keys, or to invert the nonsecret operations that are used to generate the cryptogram.

대표청구항 ▼

In a method of communicating securely over an insecure communication channel of the type which communicates a message from a transmitter to a receiver by enciphering the message with a secret enciphering key at the transmitter, transmitting the enciphered message from the transmitter to the receiver

In a method of communicating securely over an insecure communication channel of the type which communicates a message from a transmitter to a receiver by enciphering the message with a secret enciphering key at the transmitter, transmitting the enciphered message from the transmitter to the receiver, and deciphering the enciphered message with a secret deciphering key at the receiver, the improvement characterized by: generating the secret deciphering key as the multiplicative inverse, in modular arithmetic, of the secret enciphering key; generating the enciphered message by exponentiating, in modular arithmetic, the message with the secret enciphering key; deciphering the enciphered message by exponentiating, in modular arithmetic, the enciphered message with the secret deciphering key, wherein the step of: generating the secret deciphering key is performed by generating a secret deciphering key D, such that D=K-1(mod q-1) where 1≤D≤q-2, q is a prime number, and the secret enciphering key K is an independent random number chosen uniformly from the set of integers (1, 2, . . . q-2) which are relatively prime to q-1; generating the enciphered message is performed by generating an enciphered message C, such that C=PK(mod q) where P is the message; and deciphering the enciphered message is performed by generating the message P, where P=CD(mod q).