Showing papers on "Plaintext-aware encryption published in 1983"

Some Regular Properties of the ‘Data Encryption Standard’ Algorithm

Abstract: A cipher function y = E(k,x) should appear to be a random function of both the key k and the plaintext x Any regular behaviour is of interest to the users In the extreme case regular properties might point to a weakness of the cipher Precautions are needed in the use of a cipher that has regular features This note describes five regular properties of the ‘Data Encryption Standard’ or DES, two of which have been described elsewhere, are included for completeness

On Breaking the Iterated Merkle-Hellman Public-Key Cryptosystem

Abstract: In 1976 Diffie and Hellman introduced the concept of a public-key cryptosystem [1]. In 1977 Rivest, Shamir, and Adleman discovered the first incarnation of such a system [4], and soon afterwards Merkle and Hellman produced a second one [3]. Despite the widespread interest in the area, the years have produced no other public-key cryptosystems which have attracted widespread interest.

Public key cryptosystem using a reciprocal number with same intractability as factoring a large number

Abstract: This paper proposes a Public Key Cryptosystem using a reciprocal number. Breaking the proposed cryptosystem is proven to be as difficult as factoring a large number. Encryption requires O(n 2) bit operations and decryption requires O(n 3) bit operations. (n is the bit length of a plaintext.)