On Optimality of SAFER-256 Diffusion
Keywords:
Diffusion, Shuffle, Byte Permutation, Differential cryptanalysisAbstract
In this paper it is shown that the new block cipher SAFER-256 provides an optimal diffusion in the sense that the cipher is resistant against differential cryptanalysis attack after minimum possible number of rounds.
References
J. L. Massey, G. Khachatrian and M. Kyuregian, “Nomination of SAFER+ as candidate algorithm for the advanced encryption standard (AES)”, NIST AES Proposl, 1998.
K. Kyuregyan, “Some modifications of SAFER+”, In Reports of NAS RA, vol. 115, no 1, pp. 33-39, Yerevan, Armenia, 2015.
E. Biham and A. Shamir, “Differential cryptanalysis of DES-like cryptosystem”, Advances in Cryptology-CRYPTO’90, Lecture Notes in Computer Science, Heidelberg and New York, Springer, no. 537, pp. 212-241, 1990.
G. H. Khachatrian, M. K. Kyureghyan and K. M. Kyuregyan, “Design and cryptanalysis of a new encryption algorithm SAFER-256”, Transactions of IIAP NAS RA, Mathematical Problems of Computer Science, vol. 42, pp. 97-106, 2014.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
