Showing papers on "40-bit encryption published in 1989"
Patent•
14 Apr 1989
TL;DR: In this article, the authors present an approach for secure transmission of data over the network channel in a manner which is essentially transparent to the standard network devices and users. But the encryption keys are made known only to those network devices which are permitted to handle information encrypted with the encryption key.
Abstract: Apparatus and methods, readily adapted to interface with a standard data transmission network having an unsecure transmission channel, eg, "Ethernet," for the provision of secure transmission of data over the network channel in a manner which is essentially transparent to the standard network devices and users, thereof, are provided Various encryption keys are generated and utilized within the system to disguise or encrypt information transferrred between network nodes The encryption keys are made known only to those network devices which are permitted to handle information encrypted with the encryption keys
202 citations
Patent•
06 Oct 1989TL;DR: An encryption key required to encrypt and decrypt data according to a predefined algorithm is usually retained in a volatile memory device Detection of loss or corruption of the key is frequently possible only be means of the encryption circuit itself testing the key Automated and repetitive testing of encryption keys by means of a processor or a control circuit periodically requesting the encryption key to test an encryption key minimizes data loss and system down time due to corrupted or lost keys as discussed by the authors.
Abstract: An encryption key, required to encrypt and decrypt data according to a predefined algorithm is usually retained in a volatile memory device Detection of loss of the key or corruption of the key is frequently possible only be means of the encryption circuit itself testing the key Automated and repetitive testing of encryption keys by means of a processor or a control circuit periodically requesting the encryption circuit to test an encryption key minimizes data loss and system down time due to corrupted or lost keys
31 citations
TL;DR: In this paper, a single-chip system capable of encryption using the Rivest, Shamir, and Adleman algorithm at rates significantly higher than other implementations is reported using a self-timed methodology and has been implemented in a 2 mu m technology.
Abstract: A single-chip system capable of encryption using the Rivest, Shamir, and Adleman algorithm at rates significantly higher than other implementations is reported. The chip uses a self-timed methodology and has been implemented in a 2 mu m technology. The chip is a complete system and includes registers for the storage of keys for duplex operation. It is provided with a standard interface to a number of common microprocessors. >
15 citations
Patent•
11 Aug 1989TL;DR: A decryption device with an encryption/decryption module can be operated at various clock speeds, and an associated processor can control these clock speeds depending upon the moment-to-moment processing interrelationship between the encryption and the processor as discussed by the authors.
Abstract: A decryption device wherein an encryption/decryption module can be operated at various clock speeds, and wherein an associated processor controls these clock speeds depending upon the moment to moment processing interrelationship between the encryption/decryption module and the processor. In particular, when loading a new key into the encryption module, or when utilizing the encryption module to decrypt an encrypted new key, the processor alters the usual clock rate for the encryption module.
6 citations
TL;DR: A simple rotor device is described which can generate two levels of encryption security: periodic encryption to any key length, and random-key encryption.
Abstract: A simple rotor device is described which can generate two levels of encryption security: periodic encryption to any key length, and random-key encryption. The latter depends on what appears to be a useful and widely-available source of at least pseudorandom numbers: the telephone directory.
4 citations
TL;DR: A new probabilistic encryption algorithm based on the scheme proposed by Jingmin and Kaicheng in 1988, which utilises the public key concept and recursively encrypts two bits at a time and is twice as fast.
Abstract: In this letter we present a new probabilistic encryption algorithm based on the scheme proposed by Jingmin and Kaicheng in 1988. This algorithm utilises the public key concept and recursively encrypts two bits at a time. The message bit expansion is very low and is the same as in their scheme. At the same time, this new scheme is twice as fast.
1 citations