Integer Linear Programming for Three-Subset Meet-in-the-Middle Attacks: Application to GIFT

This article presents a new usage of integer-linear-programming (ILP) for block-cipher analysis, in particular for automating a procedure to search for optimal independent key bits used in a meet-in-the-middle (MitM) attack. The research is motivated by a recent lightweight block-cipher design GIFT,...

Full description

Saved in:
Bibliographic Details
Published inAdvances in Information and Computer Security Vol. 11049; pp. 227 - 243
Main Author Sasaki, Yu
Format Book Chapter
LanguageEnglish
Published Switzerland Springer International Publishing AG 2018
Springer International Publishing
SeriesLecture Notes in Computer Science
Subjects
Block cipher
Cryptanalysis
GIFT
Integer linear programming
Meet-in-the-middle
Symmetric-key
Online AccessGet full text

Cover

Abstract This article presents a new usage of integer-linear-programming (ILP) for block-cipher analysis, in particular for automating a procedure to search for optimal independent key bits used in a meet-in-the-middle (MitM) attack. The research is motivated by a recent lightweight block-cipher design GIFT, in which the evaluation by the designers has some room to be improved. The developed tool finds optimal choices of independent key bits, which improves the complexity of the 15-round MitM attack, the current best attack, on GIFT-64 from 2120 $$2^{120}$$ to 2112 $$2^{112}$$ .
AbstractList This article presents a new usage of integer-linear-programming (ILP) for block-cipher analysis, in particular for automating a procedure to search for optimal independent key bits used in a meet-in-the-middle (MitM) attack. The research is motivated by a recent lightweight block-cipher design GIFT, in which the evaluation by the designers has some room to be improved. The developed tool finds optimal choices of independent key bits, which improves the complexity of the 15-round MitM attack, the current best attack, on GIFT-64 from 2120 $$2^{120}$$ to 2112 $$2^{112}$$ .
Author Sasaki, Yu
Author_xml – sequence: 1
  givenname: Yu
  surname: Sasaki
  fullname: Sasaki, Yu
  email: sasaki.yu@lab.ntt.co.jp
  organization: NTT Secure Platform Laboratories, Musashino-shi, Japan
BookMark eNo1kMFOIzEMhsMCK1roG3DICwSceDJJuFUI2EpFINE97SHKtJ52oMzMJuH9N4XlZOm3P8v-puykH3pi7FLClQQw185YgQKlE844WQvrpT5iUyzJZ2B-sImspRSIlTtmszL_3dPyhE0AQRW0wp9sKqFytnJaqzM2S-kVABRYp62bsD-LPtOWIl92PYXIn-OwjeH9veu3vB0iX-0ikXj5aBJl_kiURdeLvCPx2G02e-LznMP6Ld3w-Tjuu3XI3dDzPPCHxf3qgp22YZ9o9r-es9_3d6vbX2L59LC4nS_FVlmVBW2sJqiCahpoNCjb1i3U0hhpK2wJQ_kp2NagNU5ji0a1ZVJtUEvbgAM8Z-prbxpjuZuib4bhLXkJ_uDSFzcefbHjP9X5g8sCVV_QGIe_H5SypwO1pj7HsF_vwpgpJl8jyFpXXmntlbL4D3fXcvE
ContentType Book Chapter
Copyright Springer Nature Switzerland AG 2018
Copyright_xml – notice: Springer Nature Switzerland AG 2018
DBID FFUUA
DEWEY 005.8
DOI 10.1007/978-3-319-97916-8_15
DatabaseName ProQuest Ebook Central - Book Chapters - Demo use only
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISBN 3319979167
9783319979168
EISSN 1611-3349
Editor Inomata, Atsuo
Yasuda, Kan
Editor_xml – sequence: 1
  fullname: Yasuda, Kan
– sequence: 2
  fullname: Inomata, Atsuo
EndPage 243
ExternalDocumentID EBC6301654_255_228
GroupedDBID 0D6
0DA
38.
AABBV
AEDXK
AEJLV
AEKFX
AEZAY
ALMA_UNASSIGNED_HOLDINGS
ANXHU
BBABE
BICGV
BJAWL
BUBNW
CVGDX
CZZ
EDOXC
FFUUA
FOYMO
I4C
IEZ
NQNQZ
OEBZI
SBO
TPJZQ
TSXQS
Z7R
Z7S
Z7U
Z7X
Z7Y
Z7Z
Z81
Z83
Z84
Z85
Z88
-DT
-GH
-~X
1SB
29L
2HA
2HV
5QI
875
AASHB
ABMNI
ACGFS
ADCXD
AEFIE
EJD
F5P
FEDTE
HVGLF
LAS
LDH
P2P
RIG
RNI
RSU
SVGTG
VI1
~02
ID FETCH-LOGICAL-g282t-ed85e04a2bb0b5028f6f061771843fe3a791a8f7387953f372fbb02d3518b0903
ISBN 9783319979151
3319979159
ISSN 0302-9743
IngestDate Tue Jul 29 20:10:58 EDT 2025
Thu May 29 16:14:15 EDT 2025
IsPeerReviewed true
IsScholarly true
LCCallNum QA76.9.A25
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-g282t-ed85e04a2bb0b5028f6f061771843fe3a791a8f7387953f372fbb02d3518b0903
Notes Original Abstract: This article presents a new usage of integer-linear-programming (ILP) for block-cipher analysis, in particular for automating a procedure to search for optimal independent key bits used in a meet-in-the-middle (MitM) attack. The research is motivated by a recent lightweight block-cipher design GIFT, in which the evaluation by the designers has some room to be improved. The developed tool finds optimal choices of independent key bits, which improves the complexity of the 15-round MitM attack, the current best attack, on GIFT-64 from 2120\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$2^{120}$$\end{document} to 2112\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$2^{112}$$\end{document}.
OCLC 1049849552
PQID EBC6301654_255_228
PageCount 17
ParticipantIDs springer_books_10_1007_978_3_319_97916_8_15
proquest_ebookcentralchapters_6301654_255_228
PublicationCentury 2000
PublicationDate 2018
PublicationDateYYYYMMDD 2018-01-01
PublicationDate_xml – year: 2018
  text: 2018
PublicationDecade 2010
PublicationPlace Switzerland
PublicationPlace_xml – name: Switzerland
– name: Cham
PublicationSeriesSubtitle Security and Cryptology
PublicationSeriesTitle Lecture Notes in Computer Science
PublicationSeriesTitleAlternate Lect.Notes Computer
PublicationSubtitle 13th International Workshop on Security, IWSEC 2018, Sendai, Japan, September 3-5, 2018, Proceedings
PublicationTitle Advances in Information and Computer Security
PublicationYear 2018
Publisher Springer International Publishing AG
Springer International Publishing
Publisher_xml – name: Springer International Publishing AG
– name: Springer International Publishing
RelatedPersons Kleinberg, Jon M.
Mattern, Friedemann
Naor, Moni
Mitchell, John C.
Terzopoulos, Demetri
Steffen, Bernhard
Pandu Rangan, C.
Kanade, Takeo
Kittler, Josef
Weikum, Gerhard
Hutchison, David
Tygar, Doug
RelatedPersons_xml – sequence: 1
  givenname: David
  surname: Hutchison
  fullname: Hutchison, David
  organization: Lancaster University, Lancaster, United Kingdom
– sequence: 2
  givenname: Takeo
  surname: Kanade
  fullname: Kanade, Takeo
  organization: Carnegie Mellon University, Pittsburgh, USA
– sequence: 3
  givenname: Josef
  surname: Kittler
  fullname: Kittler, Josef
  organization: University of Surrey, Guildford, United Kingdom
– sequence: 4
  givenname: Jon M.
  surname: Kleinberg
  fullname: Kleinberg, Jon M.
  organization: Cornell University, Ithaca, USA
– sequence: 5
  givenname: Friedemann
  surname: Mattern
  fullname: Mattern, Friedemann
  organization: ETH Zurich, Zurich, Switzerland
– sequence: 6
  givenname: John C.
  surname: Mitchell
  fullname: Mitchell, John C.
  organization: Stanford University, Stanford, USA
– sequence: 7
  givenname: Moni
  surname: Naor
  fullname: Naor, Moni
  organization: Dept Applied Math & Computer Science, Weizmann Institute of Science, Rehovot, Israel
– sequence: 8
  givenname: C.
  surname: Pandu Rangan
  fullname: Pandu Rangan, C.
  organization: Indian Institute of Technology Madras, Chennai, India
– sequence: 9
  givenname: Bernhard
  surname: Steffen
  fullname: Steffen, Bernhard
  organization: TU Dortmund University, Dortmund, Germany
– sequence: 10
  givenname: Demetri
  surname: Terzopoulos
  fullname: Terzopoulos, Demetri
  organization: University of California, Los Angeles, USA
– sequence: 11
  givenname: Doug
  surname: Tygar
  fullname: Tygar, Doug
  organization: University of California, Berkeley, USA
– sequence: 12
  givenname: Gerhard
  surname: Weikum
  fullname: Weikum, Gerhard
  organization: Max Planck Institute for Informatics, Saarbrücken, Germany
SSID ssj0002089589
ssj0002792
Score 2.2277837
Snippet This article presents a new usage of integer-linear-programming (ILP) for block-cipher analysis, in particular for automating a procedure to search for optimal...
SourceID springer
proquest
SourceType Publisher
StartPage 227
SubjectTerms Block cipher
Cryptanalysis
GIFT
Integer linear programming
Meet-in-the-middle
Symmetric-key
Title Integer Linear Programming for Three-Subset Meet-in-the-Middle Attacks: Application to GIFT
URI http://ebookcentral.proquest.com/lib/SITE_ID/reader.action?docID=6301654&ppg=228
http://link.springer.com/10.1007/978-3-319-97916-8_15
Volume 11049
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV07T8MwELagLIiBt3jLA1tllMZ5OGwFlUdFEUNBSAxWnDiIgSKBGeDXc5fYbRK6wBJVlhu5_lzr7rv77gg59iOeZ2A6sDhJYxaoHgYJc84010GYebmfBqh3Ht1GV_fB8DF8dN3srbrEqJPse66u5D-owhjgiirZPyA7fSkMwGfAF56AMDxbxm-TZq3Si6vofZnPakVFxuUWu14Nlk43X_WTgSQgan3BDcUqPndVhtarS6kcA7qa4YWiTXektWEvEwZmIhuVXEa3bwzq8ktGcRb9Rhv28tqyUZZF6IkWi-BYxBYPWaPC-pcNz5NzzFBJerZarLtKwblL5l7M9VwM1E3hdyMmZKXlbNbB9q1cvFkHe3B2HvFSfCXBDZIwaZEsxiLskKX-YHjzMGXWfE8koUhQyOMWmVSllmaLroko562p4W60IuSl4TFeIysoRqGoEoFVrpMFPdkgqw5eam_mTfJkQaUVqLQGKgVQaR1U-htUakE9pTVIqXmjCOkWub8YjM-vmO2bwZ7BgTZM5yLUXpD6SnkqBAOyiAq0VGPs7VNonsLvTEURc2w0zwse-wXM9HMe9oRC3m6bdCZvE71DqIr8TAfwf-a8CEJwzjPwP8Fq9gqhYDzbJcxtlCyj-zalOKu25UO2INslXbebEqd_SFc2G2CQXAIMsoRBIgx7f3z7Plmene0D0jHvn_oQbEajjuwh-QFBtmZe
linkProvider Library Specific Holdings
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=bookitem&rft.title=Advances+in+Information+and+Computer+Security&rft.atitle=Integer+Linear+Programming+for+Three-Subset+Meet-in-the-Middle+Attacks%3A+Application+to+GIFT&rft.date=2018-01-01&rft.pub=Springer+International+Publishing+AG&rft.isbn=9783319979151&rft.volume=11049&rft_id=info:doi/10.1007%2F978-3-319-97916-8_15&rft.externalDBID=228&rft.externalDocID=EBC6301654_255_228
thumbnail_s http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Febookcentral.proquest.com%2Fcovers%2F6301654-l.jpg