@inproceedings{5d6f3d1374f64d4ab68ee7b7a8784bc4,

title = "Rotational Cryptanalysis on MAC Algorithm Chaskey",

abstract = "In this paper we generalize the Markov theory with respect to a relation between two plaintexts and not their difference and apply it for rotational pairs. We perform a related-key attack over Chaskey- a lightweight MAC algorithm for 32-bit micro controllers - and find a distinguisher by using rotational probabilities. Having a message m we can forge and present a valid tag for some message under a related key with probability for 8 rounds and for all 12 rounds of the permutation for keys in a defined weak-key class. This attack can be extended to full key recovery with complexity for the full number of rounds.",

keywords = "Rotational Cryptanalysis, Lightweight Cryptography, ARX, Chaskey, Markov Theory, Rotational cryptanalysis, Lightweight, Markov theory",

author = "Liliya Kraleva and Tomer Ashur and Vincent Rijmen",

year = "2020",

doi = "10.1007/978-3-030-57808-4_8",

language = "English",

isbn = "978-3-030-57807-7",

series = " Lecture Notes in Computer Science ",

publisher = "Springer",

pages = "153--168",

editor = "Mauro Conti and Jianying Zhou and Emiliano Casalicchio and Angelo Spognardi",

booktitle = "Applied Cryptography and Network Security - 18th International Conference, ACNS 2020, Proceedings",

address = "Germany",

}