Showing papers on "Plaintext-aware encryption published in 1982"
05 May 1982
TL;DR: This paper proposes an Encryption Scheme that possess the following property : An adversary, who knows the encryption algorithm and is given the cyphertext, cannot obtain any information about the clear-text.
Abstract: This paper proposes an Encryption Scheme that possess the following property : An adversary, who knows the encryption algorithm and is given the cyphertext, cannot obtain any information about the clear-text. Any implementation of a Public Key Cryptosystem, as proposed by Diffie and Hellman in [8], should possess this property. Our Encryption Scheme follows the ideas in the number theoretic implementations of a Public Key Cryptosystem due to Rivest, Shamir and Adleman [13], and Rabin [12].
836 citations
29 Mar 1982
TL;DR: The "Method of Formal Coding" consists in representing each bit of a DES ciphertext block as an XOR-sum-of-products of the plaintext bits and the key bits.
Abstract: The "Method of Formal Coding" consists in representing each bit of a DES ciphertext block as an XOR-sum-of-products of the plaintext bits and the key bits. Subsequent introduction of the "MFC-complexity measure" yields interesting results on the security of the DES and the influecce of various parameters.
42 citations
26 Apr 1982
TL;DR: A two-stage encryption method for sharing access to a database where no single agency or device can ever encrypt or decrypt the data directly and an attack by an opponent would have to succeed at two separate points.
Abstract: This article presents a two-stage encryption method for sharing access to a database where no single agency or device can ever encrypt or decrypt the data directly. Thus an attack by an opponent would have to succeed at two separate points. The main tool needed is a secure cryptosystem closed under composition: encrypting and re-encrypting using two successive keys is equivalent to a single encryption using some third key. An example cryptosystem satisfying this condition is exponentiation modulo a fixed prime.