 Monitoring system for optical transmission line repeaters |
| It is an object, therefore, of the present invention to overcome the disadvantages and limitations ... |
|
| Piezoelectric electroacoustic transducer |
| We claim: 1. An electroacoustic transducer comprising a dielectric body centered on an axis and ... |
|
| Support arrangement for a flexible sound generating diaphragm |
| It is therefore an object of the invention to provide a mounting arrangement for piezoelectric ... |
|
| Acoustic insulator for a telephone handset microphone |
| The present invention encompasses an acoustic insulator substantially comprised of a single piece ... |
|
| Telephone privacy device |
| According to one aspect of the invention a telephone privacy protector for connection to a common ... |
|
| Adaptive multipath equalization |
| The invention meets these needs by providing method and apparatus for using a plurality (preferably ... |
|
| Receiver having a memory based search for fast acquisition of a spread spectrum signal |
| OF THE INVENTION FIG. 1 is a block diagram of a (global positioning system) GPS receiver of the ... |
|
| Phase-noise compensated digital communication receiver and method therefor |
| Accordingly, it is an advantage of the present invention that an improved phase-noise compensated ... |
|
| RFID tag having combined battery and passive power source |
| The present invention provides an RFID tag that is powered both by an internal battery and ... |
|
| Multi-band, multi-function integrated transceiver |
| OF THE INVENTION In the receiver shown in FIG. 1, a B-band, N-channel receiver is disclosed having ... |
|
|
RSA Public-key data encryption system having large random prime number generating microprocessor or the like
| Details |
Inventors: Miller, William J.; Trbovich, Nick G.;
Assignee: Racal-Milgo, Inc. (Miami, FL)
Primary Examiner: Birmiel; Howard A.
Assistant Examiner:
Attorney, Agent or Firm: Jackson, Jones & Price
A public-key data encryption system employing RSA public-key data encryption including a message encrypter capable of encrypting messages using a non-secret encryption key, a transmitter-receiver coupled to the message encrypter which transmits or receives an encrypted message to or from a remote location, the transmitter-receiver also being coupled to a decrypter capable of decrypting a received encrypted message using a decryption key which is a secret input to the decrypter, and an encryption-decryption key generator, including a microprocessor or other large-scale integrated circuit or circuits formed to generate a sequence of prime numbers beginning with a selected known prime number having a length relatively short with respect to the desired length of the last in the sequence of prime numbers, and which is constructed to form the sequence of prime numbers in the form hP+1 where P is the preceding prime number in the sequence, and to test hP+1 for primality by first determining if hP+1 has a GCD of 1 with x, wherein x is a composite number consisting of the product of all known prime numbers less than or equal to a pre-selected known prime number and if the GCD is not equal to 1, incrementing h to form a new hP+1 to be tested for a GCD equal to 1, and when a GCD is found to be 1, performing the primality tests to determine whether 2.sup.hP .ident.1 [mod (hP+1)] and 2.sup.h .notident.1 [mod (hP+1)], and if either 2.sup.hP .notident.1 [mod (hP+1)] or 2.sup.h .ident.1 [mod (hP+1)] further incrementing h and so on until a prime is found in this manner and then determining if the length of the prime number is of or greater than the desired length. If the hP+1 which has been determined to be prime is not of the desired length, hP+1 is placed in the sequence of prime numbers and a new h selected to be used to find the next prime number in the sequence in accordance with the above described procedure by forming a new hP+1 in which P is the previously determined prime number in the sequence of prime numbers. When a prime number in the sequence of prime numbers is found which is of the desired length it is input into the encryption-decryption key generator for generating the RSA public-key encryption and decryption keys. |
|
DETAILED DESCRIPTION The present invention relates to public-key encryption systems, which employ the RSA so-called "trap-door, one-way permutation" data encryption.
More particularly, the present invention relates to the method and apparatus employing a currently commercially available microprocessor for generating the large random prime numbers satisfying the requirements for the so-called "trap-door, one-way permutation," incorporated into an RSA public-key data encryption system.
Public-key data encryption, as originally suggested by Diffie and Hellman, "New Directions In Cryptography," I.
E.
E.
E.
Transactions on Information Theory (November 1976) (the disclosure of which is hereby incorporated by reference), and perfected by Rivest, Shamir, and Adelman, "A Method for Obtaining Digital Signatures in Public-Key Crypto Systems," MIT Technical Memo LCS/TM82 (August 1977) (the disclosure of which is hereby incorporated by reference), is by now well-known.
The basic reason for public-key encryption system is to ensure both the security of the information transferred along a data line, and to guarantee the identity of the transmitter and ensure the inability of a receiver to "forge" a transmission as being one from a subscriber on the data line.
Both of these desired results can be accomplished with public-key data encryption without the need for the maintenance of a list of secret keys specific to each subscriber on the data line and/or the periodic physical delivery or otherwise secure transmission of secret keys to the various subscribers on the data line.
Through the use of the so-called "open trap-door, one-way permutations" data can be sent from a transmitter to a receiver in an encrypted form using a publicly-known publicly transmitted encryption key, but at the same time not allowing an eavesdropper on the line to be able to decrypt the message within a period of time so large as to guarantee the security of the encrypted message.
This method of public-key encryption developed by Rivest, Shamir & Adelman, and now generally referred to as RSA, is based upon the use of two extremely large prime numbers which fulfill the criteria for the "trap-door, one-way permutation
|
|
Telecommunications 
