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

@inproceedings{Massey1993SAFERKA,
  title={SAFER K-64: A Byte-Oriented Block-Ciphering Algorithm},
  author={James L. Massey},
  booktitle={FSE},
  year={1993}
}
  • J. Massey
  • Published in FSE 9 December 1993
  • Computer Science, Mathematics
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… 
JEA K-128: a novel encryption algorithm using VHDL
TLDR
A new block- ciphering algorithm, JEA K-128 (for Jamal Encryption Algorithm with a Key of length 128 bits) is described, a symmetric block cipher suitable for hardware or software implementations.
A New Byte-Oriented Block Cipher
TLDR
In this paper, a new byte-oriented block cipher with a key of length 64 bits is proposed and the design principles of the proposed cipher are explained and a sample data is given.
Block Ciphers - A Survey
  • L. Knudsen
  • Computer Science, Mathematics
    State of the Art in Applied Cryptography
  • 1997
TLDR
This paper gives a short overview of the state of the art of secret key block ciphers, namely for encryption, and focuses on the main application of block cips for encryption.
A Key-schedule Weakness in SAFER K-64
  • R.
  • Computer Science, Mathematics
  • 2002
TLDR
It is shown that for almost every key K, there exists at least one different key K’, such that for many plaintexts the outputs after 6 rounds of encryption are equal.
Twofish : A 128-bit block cipher
TLDR
The design of both the round function and the key schedule permits a wide variety of tradeoffs between speed, software size, key setup time, gate count, and memory.
Design and Implementation of an ASIP-Based Crypto Processor for IDEA and SAFER K-64
A New crypto processor is proposed in this paper for International Data Encryption Algorithm (IDEA), and Secure And Fast Encryption Routine with 64-bit Key (SAFER K64). The utilized platform is based
Two sh : A 128-Bit Block
TLDR
The design of both the round function and the key schedule permits a wide variety of tradeoos between speed, software size, key setup time, gate count, and memory.
A Key-schedule Weakness in SAFER K-64
TLDR
A weakness in the key schedule of SAFER K-64 has the effect that for almost every key K, there exists at least one different key K*, such that for many plaintexts the outputs after 6 rounds of encryption are equal.
A structured symmetric-key block cipher
A Detailed Analysis of SAFER K
  • L. Knudsen
  • Computer Science, Mathematics
    Journal of Cryptology
  • 2015
TLDR
A weakness in the key schedule is shown that for almost every key there exists on the average three and a half other keys such that the encryptions of plaintexts different in one of eight bytes yield ciphertexts also different in only one byte.
...
...

References

SHOWING 1-10 OF 10 REFERENCES
Markov Ciphers and Differential Cryptanalysis
TLDR
It is shown that PES (8) and PES(16) are immune to differential cryptanalysis after sufficiently many rounds, and a new design principle for Markov ciphers, viz., that their transition probability matrices should not be symmetric is suggested.
Differential Cryptanalysis of the Data Encryption Standard
TLDR
This book introduces a new cryptographic method, called differential cryptanalysis, which can be applied to analyze cryptosystems, and describes the cryptanalysis of DES, deals with the influence of its building blocks on security, and analyzes modified variants.
Communication theory of secrecy systems
  • C. Shannon
  • Computer Science, Mathematics
    Bell Syst. Tech. J.
  • 1949
TLDR
A theory of secrecy systems is developed on a theoretical level and is intended to complement the treatment found in standard works on cryptography.
"J."
however (for it was the literal soul of the life of the Redeemer, John xv. io), is the peculiar token of fellowship with the Redeemer. That love to God (what is meant here is not God’s love to men)
Lecture Notes in Computer Science No. 547
  • Lecture Notes in Computer Science No. 547
  • 1991
FIPS Pub
  • FIPS Pub
  • 1977
Type 0 and CR to continue or -1 and CR to stop run.'); read(flag); END UNTIL flag < 0
  • Type 0 and CR to continue or -1 and CR to stop run.'); read(flag); END UNTIL flag < 0
Type 0 and CR to continue or -1 and CR to stopp run.'); read(flag); END UNTIL flag < 0
  • Type 0 and CR to continue or -1 and CR to stopp run.'); read(flag); END UNTIL flag < 0
} b1:= exptab[a1]; b2:= logtab[a2]; b3:= logtab[a3]; b4:== exptab[a4]; b5:= exptab[a5]; b6:= logtab[a6]; b7:= logtab[a7]
  • {The result now passes through the nonlinear layer
FIPSS Pub
  • FIPSS Pub
  • 1977