Linear Cryptanalysis of Block Ciphers in the Cluster Computational Environment
Abstract
This paper presents some results concerning synthesis of new cryptosystems equivalent to SAFER+ and SAFER++ to perform their linear cryptanalysis in the cluster computational environment. A parallel software package “LinearCryptanalyser” is developed to find such "Armenian Shuffles" which were chosen as secure against differential cryptanalysis and now will be checked if they are also secure against linear cryptanalysis. The research is focused on both theoretical and practical aspects of existence of linked I/O sums. The software package “LinearCryptanalyser” analyzes the existence of linked I/O sums and the absence of such sums will indicate cryptоresistance of block ciphers against last-round attack.
References
J. L. Massey, G. H. Khachatrian and M. K. Kuregian, ``Nomination of SAFER+ as Candidate algorithm for the Advanced Encryption Standard (AES)”, Submission document from Cylink Corporation to NIST, June 1998.
J. L. Massey, G. H. Khachatrian and M. K. Kuregian, ``Nomination of SAFER++ as Candidate Algorithm for the New European Schemes for Signatures, Integrity, and Encryption (NESSIE)”, Submission document from Cylink Corporation, 2000.
C. Harpes, ``Cryptanalysis of iterated block ciphers”, ETH Series in Information Processing, editor: James L. Massey. v. 7, Hartung-Gorre Verlang Konstanz, 1996.
C. Harpes, G. G. Kramer and J. L. Massey, ``A generalization of linear cryptanalysis and the applicability of Matsui’s piling-up lemma”, Presented at Eurocrypt ’95.
C. Harpes, ``A generalization of linear cryptanalysis applied to SAFER”, Signal and Info. Proc. Lab., CH-8092 Zurich, March 9, 1995.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
