SAFER K-64: A byte-oriented block-ciphering algorithm
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.
KeywordsBlock Cipher Data Encryption Standard Output Transformation Differential Cryptanalysis Hadamard Transform
- C.E. Shannon, “Communication Theory of Secrecy Systems”, Bell System Tech. J., vol. 28, pp. 656–715, Oct., 1949.Google Scholar
- U.S. Department of Commerce/National Bureau of Standards, FIPS Pub 46, Data Encryption Standard, April 1977.Google Scholar
- E. Biham and A. Shamir, Differential Cryptanalysis of the Data Encryption Standard. New York: Springer-Verlag, 1993.Google Scholar
- X. Lai, J. L. Massey and S. Murphy, “Markov Ciphers and Differential Cryptanalysis,” pp. 17–38 in Advances in Cryptology — EUROCRYPT '91 (Ed. D. W. Davies), Lecture Notes in Computer Science No. 547. Heidelberg and New York: Springer-Verlag, 1991Google Scholar