Rotational Cryptanalysis on MAC Algorithm Chaskey

Liliya Kraleva, Tomer Ashur, Vincent Rijmen

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

1 Downloads (Pure)

Samenvatting

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.

Originele taal-2Engels
TitelApplied Cryptography and Network Security - 18th International Conference, ACNS 2020, Proceedings
SubtitelACNS 2020
RedacteurenMauro Conti, Jianying Zhou, Emiliano Casalicchio, Angelo Spognardi
UitgeverijSpringer
Pagina's153-168
Aantal pagina's16
ISBN van elektronische versie978-3-030-57808-4
ISBN van geprinte versie978-3-030-57807-7
DOI's
StatusGepubliceerd - 2020

Publicatie series

Naam Lecture Notes in Computer Science
Volume12146

Vingerafdruk Duik in de onderzoeksthema's van 'Rotational Cryptanalysis on MAC Algorithm Chaskey'. Samen vormen ze een unieke vingerafdruk.

Citeer dit