On Linear Hulls and Trails

Tomer Ashur, Vincent Rijmen

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

3 Citaten (Scopus)
1 Downloads (Pure)


This paper improves the understanding of linear cryptanalysis by highlighting some previously overlooked aspects. It shows that linear hulls are sometimes formed already in a single round, and that overlooking such hulls may lead to a wrong estimation of the linear correlation, and thus of the data complexity. It shows how correlation matrices can be used to avoid this, and provides a tutorial on how to use them properly. By separating the input and output masks from the key mask it refines the formulas for computing the expected correlation and the expected linear potential. Finally, it shows that when the correlation of a hull is not properly estimated (e.g., by using the correlation of a single trail as the correlation of the hull), the success probability of Matsui’s Algorithm 1 drops, sometimes drastically. It also shows that when the trails composing the hull are properly accounted for, more than a single key bit can be recovered using Algorithm 1. All the ideas presented in this paper are followed by examples comparing previous methods to the corrected ones, and verified experimentally with reduced-round versions of Simon32/64.
Originele taal-2Engels
TitelInternational Conference on Cryptology in India
RedacteurenOrr Dunkelman, Somitra Kumar Sanadhya
Plaats van productieCham
Aantal pagina's18
ISBN van elektronische versie978-3-319-49890-4
ISBN van geprinte versie978-3-319-49889-8
StatusGepubliceerd - 2016
Extern gepubliceerdJa
Evenement17th International Conference on Cryptology - Kolkata, India
Duur: 11 dec 201614 dec 2016

Publicatie series

NaamLecture Notes in Computer Science


Congres17th International Conference on Cryptology

Vingerafdruk Duik in de onderzoeksthema's van 'On Linear Hulls and Trails'. Samen vormen ze een unieke vingerafdruk.

Citeer dit