Guessing less and better: improved attacks on GIFT-64

DOI10.1007/S10623-024-01527-2MaRDI QIDQ7009881zbMATH OpenFDO

Authors Federico Canale, María Naya-Plasencia

Publication date 19 March 2025

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10623-024-01527-2

zbMATH Keywords

differential cryptanalysisgeneric frameworkGIFT-64key-recoverylist mergingparallel guessing

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• Accurate estimates of the data complexity and success probability for various cryptanalyses
• Generalized related-key rectangle attacks on block ciphers with linear key schedule: applications to SKINNY and GIFT
• Generic framework for key-guessing improvements
• GIFT: a small present. Towards reaching the limit of lightweight encryption
• How to improve rebound attacks
• scientific article; zbMATH DE number 503238 (Why is no real title available?)
• Improved (related-key) differential cryptanalysis on GIFT
• Improved differential attacks on GIFT-64
• Key guessing strategies for linear key-schedule algorithms in rectangle attacks
• MILP-based differential attack on round-reduced GIFT
• New attacks from old distinguishers improved attacks on serpent
• Related-key boomerang attacks on GIFT with automated trail search including BCT effect
• Sieve-in-the-middle: improved MITM attacks

Cited in

(1)

• A linearisation method for identifying dependencies in differential characteristics: examining the intersection of deterministic linear relations and nonlinear constraints

This page was built for publication: Guessing less and better: improved attacks on GIFT-64

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7009881)