Refined Method of Impossible Differentials Search with Application to Kalyna-Like Ciphers
DOI:
https://doi.org/10.20535/tacs.2664-29132025.1.332345Abstract
This work addresses the problem of evaluating the security of block ciphers against impossible differential cryptanalysis, with a particular focus on Kalyna-like ciphers. Based on formalized methods—specifically the Wu-Wang method—this work introduces refined rules tailored to AES- and Kalyna-like ciphers. These refinements simplify compatibility checks by replacing large systems of linear equations with computationally efficient conditions. Experimental results have identified several classes of impossible differentials for three-round versions of certain Kalyna cipher variants, thereby demonstrating the security of full-round ciphers against this method of cryptanalysis.
Downloads
Published
Issue
Section
License
Authors who publish with this journal agree to the following terms:
Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
