Security of a recently proposed bitwise block cipher GIFT is evaluated in this paper. In order to mount full round attacks on the cipher, biclique cryptanalysis method is applied. Both variants of the block cipher are attacked using Independent biclique approach. For recovering the secret keys of GIFT-64, the proposed attack requires 2127.45 full GIFT-64 encryption and 28 chosen plain texts. For recovering the secret keys of GIFT-128, the proposed attack requires 2127.82 full GIFT-128 encryption and 218 chosen plain texts. The attack complexity is compared with that of other attacks proposed previously. The security level of GIFT is also compared with that of the parent block cipher PRESENT, based on the analysis.
BogdanovA. and RechbergerC., A 3-Subset Meet-in-the-Middle Attack: Cryptanalysis of the Lightweight Block Cipher KTANTAN. In: A. Biryukov,G. Gong, D.R. Stinson, (eds.) SAC 2010. LNCS, Springer, Heidelberg vol. 6544,. pp. 229–240.
2.
BogdanovA., KhovratovichD. and RechbergerC., Biclique Cryptanalysis of the Full AES. In: D.H. Lee, X. Wang (eds)Advances in Cryptology –ASIACRYPT2011, Lecture Notes in Computer Science, Springer, Berlin, Heidelberg7073 (2011), 344–371.
3.
BogdanovA., KnudsenL.R. and LeanderG., PRESENT: An Ultra-Lightweight Block Cipher. In: P. Paillier, I. Verbauwhede (eds) Cryptographic Hardware and Embedded Systems –CHES 2007. Lecture Notes in Computer Science, Springer, Berlin, Heidelberg vol 4727. pp 450–466.
4.
ZhuB., DongX. and YuH., MILP-Based Differential Attack on Round-Reduced GIFT. In: Matsui M. (eds) Topics in Cryptology –CT-RSA 2019. CT-RSA 2019. Lecture Notes in Computer Science, (2019) vol 11405. Springer, Cham pp. 372–390.
5.
BouillaguetC., DerbezP. and FouqueP., Automatic Search of Attacks on Round Reduced AES and Applications. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, Springer, Heidelberg, vol. 6841 pp. 169–187.
6.
HongD., KooB. and KwonD., Biclique Attack on the Full HIGHT, ICISC 2011, LNCS 7259, Springer-Verlag, 2012. pp. 365–374.
7.
KhovratovichD., RechbergerC. and SavelievaA., Bicliques for preimages: attacks on Skein-512 and the SHA-2 family (2011), FSE 2012 LNCS 7549 pp. 244–263.
8.
BihamE., DunkelmanO. and KellerN., Related-Key Impossible Differential Attacks on AES-192. In: Pointcheval, D. (ed.) CT-RSA 2006. LNCS, Springer, Heidelberg 3860 (2006), 21–31.
9.
BihamE. and ShamirA., Differential cryptanalysis of DES-like cryptosystems. In A.J. Menezes, S.A. Vanstone, eds.: CRYPTO’90. Volume 537 of LNCS. Springer, Heidelberg 1991, pp. 2–21.
10.
AbedF., ForlerC., ListE., LucksS. and WenzelJ., Biclique Cryptanalysis of the PRESENT and LED Lightweight Ciphers, Cryptology ePrint Archive, Report 2012/591, 2012.
11.
BansodG., PisharotyN. and PatilA.J., PICO: An Ultra Lightweight and Low Power Encryption Design for Ubiquitous Computing, Defence Science Journal66(3) (2016), 259–265.
MalaH., DakhilalianM. and RijmenV., Improved Impossible Differential Cryptanalysis of 7-Round AES-128. In: G. Gong, K.C. Gupta (eds) Progress in Cryptology - INDOCRYPT 2010. Lecture Notes in Computer Science, vol 6498. Springer, Berlin, Heidelberg (2010), pp. 282–291.
14.
GuoJ., LingS., et al., Advanced Meet-in-the-Middle PreimageAttacks: First Results on Full Tiger, and Improved Results onMD4 and SHA-2. In:M.Abe, (ed.)ASIACRYPT 2010. Springer Heidelberg LNCS, vol. 6477, pp. 56–75.
15.
ZhaoJ., et al., Differential analysis of lightweight block cipher gift, J. Cryptologic Res5(4) (2018), 335–343.
16.
ChoJ.Y., Linear Cryptanalysis of Reduced-Round PRESENT. In: J. Pieprzyk (eds) Topics in Cryptology - CT-RSA 2010. Lecture Notes in Computer Science, vol 5985. Springer, Berlin, Heidelberg (2010),pp. 302–317.
17.
AokiK. and SasakiY., Meet-in-the-Middle Preimage Attacks Against Reduced SHA-0 and SHA-1. In: S. Halevi, (ed.) CRYPTO 2009. LNCS, Springer, Heidelberg 5677 (2009), 70–89.
18.
AokiK. and SasakiY., Preimage Attacks on One-Block MD4, 63-StepMD5 andMore. In: R.M. Avanzi, L. Keliher, F. Sica, (eds.) SAC 2008. LNCS, Springer, Heidelberg 5381 (2009), 103–119.
19.
JeongK. and KangH., Biclique cryptanalysis of lightweight block ciphers present, piccolo and led. IACR Cryptol. ePrint Arch. p. 621 (2012).
20.
OhkumaK., Weak Keys of Reduced-Round PRESENT for Linear Cryptanalysis. In: M.J. Jacobson, V. Rijmen, R. Safavi-Naini (eds) Selected Areas in Cryptography. SAC 2009. Lecture Notes in Computer Science, Springer, Berlin, Heidelberg vol 5867. pp 249–265.
21.
JithendraK.B. and ShahanaT.K., New Biclique Cryptanalysis on Full-Round PRESENT-80 Block Cipher. Springer Nature Journal of Computer Science. 1, 94 (2020). https://doi.org/10.1007/s42979-020-0103-z
22.
ÇobanM., KarakoçF. and Bizta¸sÖ., Biclique Cryptanalysis of TWINE, Cryptology ePrint Archive, Report 2012/422, 2012.
23.
MatsuiM., Linear Cryptanalysis Method for DES Cipher. In: Helleseth T. (eds) Advances in Cryptology —EURO-CRYPT ’93. EUROCRYPT 1993. Lecture Notes in Computer Science, Springer, vol 765. pp 386–397.
24.
PhanR.C., W.: Impossible Differential Cryptanalysis of 7-round Advanced Encryption Standard (AES). Information Processing Letters, 91 (2004), 33–38.
25.
BanikS. and PandeyS.K., GIFT:Asmall present - towards reaching the limit of lightweight encryption. In: Cryptographic Hardware and Embedded Systems –CHES 2017 –19th International Conference, Taipei, Taiwan, September 25–28, 2017, Proceedings. pp. 321–345.
26.
ChenS., Biclique Attack of the Full ARIA-256, Cryptology ePrint Archive, Report 2012/011, 2012.
27.
WuW., ZhangL. and BlockL., A Light weight Block Cipher. In: Lopez J., Tsudik G. (eds) Applied Cryptography and Network Security. ACNS 2011. Lecture Notes in Computer Science, Springer, Berlin, Heidelberg vol 6715. pp 327–344.
28.
LiuY. and SasakiY., Related-Key Boomerang Attacks on GIFT with Automated Trail Search Including BCT Effect. In: J. Jang-Jaccard, F. Guo (eds) Information Security and Privacy. ACISP 2019. LNCS, vol 11547. Springer, Cham (2019), pp. 555–572.
29.
GongZ., NikovaS. and LawY.W., KLEIN: A New Family of Lightweight Block Ciphers. In: A. Juels, C. Paar (eds) RFID. Security and Privacy. RFIDSec 2011. Lecture Notes in Computer Science, Springer, Berlin, Heidelberg vol 7055. pp 1–18.
