Showing papers on "40-bit encryption published in 1980"
TL;DR: The Rivest, Shamir, and Adleman (RSA) public-key encryption algorithm can be broken if the integer R used as the modulus can be factored as discussed by the authors.
Abstract: The Rivest, Shamir, and Adleman (RSA) public-key encryption algorithm can be broken if the integer R used as the modulus can be factored. It my however be possible to break this system without factoring R . A modification of the RSA scheme is described. For this modified version it is shown that, if the encryption procedure can be broken in a certain number of operations, then R can be factored in only a few more operations. Furthermore, this technique can also be used to produce digital signatures, in much the same manner as the RSA scheme.
285 citations
Patent•
25 Mar 1980TL;DR: In this paper, a data encryption/decryption system providing for security of data communications channels, a sub-system for generating, transporting and introducing encryption and decryption keys and introducing those keys into the system while at the same time providing a high level of security for the keys and hence, hence, the system.
Abstract: In a data encryption/decryption system providing for security of data communications channels, a sub-system for generating, transporting encryption/decryption keys and for introducing those keys into the system while at the same time providing a high level of security for the keys and, hence, the encryption/decryption system. Secure data is transferred between at least two security modules and the system includes generating means (32) for generating at least one key word in response to the times of an operator's switch (54), key loading means (34) being provided for storing and transporting the said at least one key word, and the key loading means (34) and the generating means (32) having interfaces fortrans- ferring said at least one key word from the generating means to the key loading means (34) in a form readable only by the system.
5 citations
01 Jan 1980
TL;DR: The concept of a block cipher with "subkeys" is introduced, and a subkey encryption algorithm based on the Chinese Remainder Theorem is presented.
Abstract: The difficulties of protecting data stored in a general purpose data base are discussed. Encrypting the data solves many of the problems left by traditional security mechanisms, but traditional encryption schemes fail to satisfy some of the peculiar requirements of data bases. The concept of a block cipher with "subkeys" is introduced, and a subkey encryption algorithm based on the Chinese Remainder Theorem is presented.
1 citations