Showing papers on "56-bit encryption published in 1985"
Patent•
6 May 1985
TL;DR: In this article, the authors proposed a method for the encryption, transmission, and subsequent decryption of digital keying data. The method utilizes the Data Encryption Standard and is implemented by means of a pair of apparatus, each of which is selectable to operate as either a master unit or a remote unit.
Abstract: A method for the encryption, transmission, and subsequent decryption of digital keying data. The method utilizes the Data Encryption Standard and is implemented by means of a pair of apparatus, each of which is selectable to operate as either a master unit or remote unit. Each unit contains a set of key encryption keys which are indexed by a common indexing system. The master unit operates upon command from the remote unit to generate a data encryption key and encrypt the data encryption key using a preselected key encryption key. The encrypted data encryption key and an index designator are then downloaded to the remote unit, where the data encryption key is decrypted for subsequent use in the encryption and transmission data. Downloading of the encrypted data encryption key enables frequent change of keys without requiring manual entry or storage of keys at the remote unit.
114 citations
18 Aug 1985
TL;DR: The purpose of this note is to describe some anomalies found in the structure of the S-boxes in Che Data Encryption Standard, which demonstrate the deficiencies of current certification techniques and the need for provably secure cryptosystems.
Abstract: The purpose of this note is to describe some anomalies found in the structure of the S-boxes in Che Data Encryption Standard. These anomalies are potentially dangerous, but so far they have not led to any successful cryptanalytic attack. While their significance is still unknown, they clearly demonstrate the deficiencies of current certification techniques and the need for provably secure cryptosystems.Each S-box is a mapping from six input bits ABCDEF to four output bits WXYZ. Even though they are visually random, they have a lot of intentional structure, which seems to have a positive effect on the security of DES. However, the design criteria used by IBM and the NSA were never made public.
49 citations
TL;DR: Using principles from the Data Encryption Standard (DES), a more software-compatible encryption algorithm is developed that addresses the major problems of DES: key size and secret design.
Abstract: Using principles from the Data Encryption Standard (DES). a more software-compatible encryption algorithm is developed that addresses the major problems of DES: key size and secret design.
10 citations
Proceedings Article•
18 Aug 1985
TL;DR: It is known that the RSA public-key cryptosystem can be broken if the composite modulus can be factored as mentioned in this paper, but it is not known whether the problem of breaking any RSA system is equivalent in difficulty to factoring the modulus.
Abstract: It is well known that the RSA public-key cryptosystem can be broken if the composite modulus can be factored. It is nor known, however, whether the problem of breaking any RSA system is equivalent in difficulty to factoring the modulus. In 1979 Rabin [5] introduced a public-key cryptosystem which is as difficult to break as it is to factor a modulus R=p1p2, where p1p2 are two distinct large primes. Esaentially Rabin suggested that the designer of such a scheme first determine p1 and p2, keep them secret and make R public. Anyone wishing to send a secure message H (0 < M < R ) to the designer would encrypt M as K , where
$$ K \equiv M^2 (\bmod R)$$
and 0 < K < R, then transmit K to the designer.
10 citations
Proceedings Article•
1 Dec 1985
TL;DR: In this article, the authors proposed a non linear time varying encryption algorithm, based on key layering in three levels (system key, intermediate key, running key) and on encryption organization into two or more sets of three operations (running key rotation, message digit substitution and transposition).
Abstract: To perform message authentication in a telesurveillance system, the paper proposes a non linear time varying encryption algorithm, based on key layering in three levels (system key, intermediate key, running key) and on encryption organization into two or more sets of three operations (running key rotation, message digit substitution and transposition). The algorithm was designed to be implemented on an 8-bit microprocessor.
1 citations
TL;DR: The following note examines the different encryption requirements and proposes protocol extensions to handle them.
Abstract: The 1984 CCITT recommendations on message handling provide for encrypted data but do not propose any standard method. Since use of both data encryption and electronic mail is increasing, the need for encryption standards within the message handling system will grow. The following note examines the different encryption requirements and proposes protocol extensions to handle them.