Showing papers on "Plaintext-aware encryption published in 1981"
TL;DR: It is shown that although either technique significantly improves security over single encryption, the new technique does not significantly increase security over simple double encryption.
Abstract: Double encryption has been suggested to strengthen the Federal Data Encryption Standard (DES). A recent proposal suggests that using two 56-bit keys but enciphering 3 times (encrypt with a first key, decrypt with a second key, then encrypt with the first key again) increases security over simple double encryption. This paper shows that although either technique significantly improves security over single encryption, the new technique does not significantly increase security over simple double encryption. Cryptanalysis of the 112-bit key requires about 256 operations and words of memory, using a chosen plaintext attack. While DES is used as an example, the technique is applicable to any similar cipher.
240 citations
TL;DR: A new cryptosystem that is suitable for database encryption is presented, based on the Chinese Remainder Theorem, which has the important property of having subkeys that allow the encryption and decryption of fields within a record.
Abstract: A new cryptosystem that is suitable for database encryption is presented. The system has the important property of having subkeys that allow the encryption and decryption of fields within a record. The system is based on the Chinese Remainder Theorem.
178 citations
TL;DR: It is shown that the clypta6 system is extremely weak and can always be cryptanalyzed under a known plaintext attack.
3 citations
TL;DR: It is shown that under ai chosen plaintext attack [2] the security of the system will be compromised unless the parameters of the cryptosystam fulfill some simple conditions.
2 citations