2022
DOI: 10.1007/978-981-16-9650-3_31
|View full text |Cite
|
Sign up to set email alerts
|

Deep Learning-Based Differential Distinguisher for Lightweight Cipher GIFT-COFB

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
4
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 5 publications
0
4
0
Order By: Relevance
“…Side channel Elephant KRA using CPA -recovers the key for the 160-bit variant in about a minute using 35 power traces [55] GIFT-COFB KRA with DCSCA -TC: 2 18.39 and MC: 2 25.39 , the TC is 2 13.39 if 32 encryptions per session are assumed Others GIFT-COFB KRA -TC:2 4 for 2-round GIFT-COFB [56]; FA -success probability qd/2 n/2 , given qd forgery attempts, also shows FA possible with 2 n/2 attempts using a single known-plaintext encryption query [57]; DA -2 and 6 rounds of GIFT-COFB [58]; updated bound for privacy [59] PHOTON-Beetle KRA, QC: 2 22.8 [60]; related key FA with an updated security bound of the authentication [59] Romulus MA on Romulus-M [61] SPARKLE MITM based DA -Sparkle-256/384/512 with 4/4/5 steps, respectively, with practical TCs and MCs [62] TinyJambu DA [63] -TC/DC: 2 23 for 544-round in secret-key settings, TC/DC: 2 16 /2 23 for full-round 128/192-bit versions in known-key settings, TC/DC: 2 23 for 1152-round 256-bit version in known-key settings Xoodyak DA-12-round Xoodoo (permutation of Xoodyak) with TC:2 33 [64]…”
Section: Summary Of Existing Cryptanalyses Of Nist Lwc Finalist Algor...mentioning
confidence: 99%
“…Side channel Elephant KRA using CPA -recovers the key for the 160-bit variant in about a minute using 35 power traces [55] GIFT-COFB KRA with DCSCA -TC: 2 18.39 and MC: 2 25.39 , the TC is 2 13.39 if 32 encryptions per session are assumed Others GIFT-COFB KRA -TC:2 4 for 2-round GIFT-COFB [56]; FA -success probability qd/2 n/2 , given qd forgery attempts, also shows FA possible with 2 n/2 attempts using a single known-plaintext encryption query [57]; DA -2 and 6 rounds of GIFT-COFB [58]; updated bound for privacy [59] PHOTON-Beetle KRA, QC: 2 22.8 [60]; related key FA with an updated security bound of the authentication [59] Romulus MA on Romulus-M [61] SPARKLE MITM based DA -Sparkle-256/384/512 with 4/4/5 steps, respectively, with practical TCs and MCs [62] TinyJambu DA [63] -TC/DC: 2 23 for 544-round in secret-key settings, TC/DC: 2 16 /2 23 for full-round 128/192-bit versions in known-key settings, TC/DC: 2 23 for 1152-round 256-bit version in known-key settings Xoodyak DA-12-round Xoodoo (permutation of Xoodyak) with TC:2 33 [64]…”
Section: Summary Of Existing Cryptanalyses Of Nist Lwc Finalist Algor...mentioning
confidence: 99%
“…Recently, with the development of deep learning [2][3][4][5][6][7][8], various studies on deeplearning-based distinguishers [9,10] have been presented [11][12][13][14][15][16][17][18][19][20][21]. Deep learning is wellsuited for probabilistically distinguishing data that satisfy differential characteristics, as it has the capability to make probabilistic predictions about data.…”
Section: Introductionmentioning
confidence: 99%
“…That is, since a differential characteristic exists with a certain probability and can be predicted probabilistically, deep learning is suitable as a solution for this. Since Gohr’s work [ 4 ], numerous studies on deep-learning-based distinguishers have been conducted [ 5 , 6 , 7 , 8 , 9 , 10 , 11 ]. In addition, as quantum computers have been developed in recent years, a quantum neural network utilizing a quantum computer is attracting attention.…”
Section: Introductionmentioning
confidence: 99%