Integer linear programming for three-subset meet-in-the-middle attacks: application to GIFT

DOI10.1007/978-3-319-97916-8_15zbMath1398.94157OpenAlexW2884051710MaRDI QIDQ1800725

Yu Sasaki

Publication date: 24 October 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-97916-8_15

zbMATH Keywords

block cipherinteger linear programmingcryptanalysismeet-in-the-middlesymmetric-keygift

Mathematics Subject Classification ID

Integer programming (90C10) Cryptography (94A60)

Related Items (8)

Meet-in-the-middle attacks revisited: key-recovery, collision, and preimage attacks ⋮ Generalized related-key rectangle attacks on block ciphers with linear key schedule: applications to SKINNY and GIFT ⋮ Meet-in-the-middle attack with splice-and-cut technique and a general automatic framework ⋮ Improved attacks against reduced-round Whirlwind ⋮ Meet-in-the-middle preimage attacks on sponge-based hashing ⋮ Mind the \texttt{TWEAKEY} schedule: cryptanalysis on \texttt{SKINNYe-64-256} ⋮ \textsf{tHyENA}: making \textsf{HyENA} even smaller ⋮ Automatic search of meet-in-the-middle preimage attacks on AES-like hashing

This page was built for publication: Integer linear programming for three-subset meet-in-the-middle attacks: application to GIFT