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

SAFER K-64: A Byte-Oriented Block-Ciphering Algorithm

Abstract: A new non-proprietary secret-key block-enciphering algorithm, SAFER K-64 (for Secure And Fast Encryption Routine with a Key of length 64 bits) is described. The blocklength is 64 bits (8 bytes) and only byte operations are used in the processes of encryption and decryption. New cryptographic features in SAFER K-64 include the use of an unorthodox linear transform, called the Pseudo-Hadamard Transform, to achieve the desired “diffusion” of small changes in the plaintext or the key over the resulting ciphertext and the use of additive key biases to eliminate the possibility of “weak keys”. The design principles of K-64 are explained and a program is given, together with examples, to define the encryption algorithm precisely.

Cryptanalysis on schwartz graphical encryption method

Abstract: This paper discusses the chosen-plaintext attack and the known-plaintext attack on a graphical encryption method for encryption of computer data proposed by Charles Schwartz of the University of California at Berkeley in 1991. In cracking the Schwartz encryption method, this paper proposes what we call a mask approach. Using this approach, both chosen-plaintext attack and known-plaintext attack can break the Schwartz method. The mask approach is successful because the Schwartz method uses (1) exclusive-or (xor) operations, and (2) a process that is plaintext-independent.

Two Chosen Plaintext Attacks on the Li-Wang Joint Authentication and Encryption Scheme

Abstract: In [LW91], Li and Wang proposed a joint authentication and encryption scheme based on algebraic coding theory. They claimed that their scheme is as secure as the Rao-Nam scheme [RN89]. However, in contrast with their claim, it will be shown that this joint authentication and encryption scheme appears to be less secure. In this paper two inherently different chosen-plaintext attacks are presented.