Skip to Main content Skip to Navigation
Conference papers

Improving Key-Recovery in Linear Attacks: Application to 28-Round PRESENT

Abstract : Linear cryptanalysis is one of the most important tools in usefor the security evaluation of symmetric primitives. Many improvementsand refinements have been published since its introduction, and manyapplications on different ciphers have been found. Among these upgrades,Collard et al. proposed in 2007 an acceleration of the key-recovery partof Algorithm 2 for last-round attacks based on the FFT.In this paper we present a generalized, matrix-based version of the pre-vious algorithm which easily allows us to take into consideration an ar-bitrary number of key-recovery rounds. We also provide efficient variantsthat exploit the key-schedule relations and that can be combined withmultiple linear attacks.Using our algorithms we provide some new cryptanalysis on PRESENT,including, to the best of our knowledge, the first attack on 28 rounds.
Document type :
Conference papers
Complete list of metadata

https://hal.inria.fr/hal-03139574
Contributor : Antonio Florez Gutierrez Connect in order to contact the contributor
Submitted on : Friday, February 12, 2021 - 10:25:42 AM
Last modification on : Friday, January 21, 2022 - 3:22:54 AM
Long-term archiving on: : Thursday, May 13, 2021 - 6:30:04 PM

File

Improving the key recovery in ...
Files produced by the author(s)

Identifiers

Collections

Citation

Antonio Florez-Gutierrez, María Naya-Plasencia. Improving Key-Recovery in Linear Attacks: Application to 28-Round PRESENT. EUROCRYPT 2020 - 39th Annual International Conference on the Theory and Applications of Cryptographic, May 2020, Zagreb / Virtual, Croatia. pp.221-249, ⟨10.1007/978-3-030-45721-1_9⟩. ⟨hal-03139574⟩

Share

Metrics

Les métriques sont temporairement indisponibles