GIFT: A Small Present Towards Reaching the Limit of Lightweight Encryption

作者: Subhadeep Banik , Yosuke Todo , Siang Meng Sim , Yu Sasaki , Thomas Peyrin

DOI:

关键词: Computer scienceLimit (mathematics)Differential (infinitesimal)Theoretical computer scienceComputer engineeringCryptanalysisEfficient energy useData flow diagramImplementationEncryptionDesign strategy

摘要: In this article, we revisit the design strategy of PRESENT, leveraging all advances provided by research community in construction and cryptanalysis since its publication, to push up limits. We obtain an improved version, named GIFT, that provides a much increased efficiency domains (smaller faster), while correcting well-known weakness PRESENT with regards linear hulls. GIFT is very simple clean outperforms even SIMON or SKINNY for round-based implementations, making it one most energy efficient ciphers as today. It reaches point where almost entire implementation area taken storage Sboxes, any cheaper choice Sbox would lead weak proposal. essence, composed only bit-wiring, but natural bitslice data flow ensures excellent performances scenarios, from area-optimised hardware implementations fast software on high-end platforms. conducted thorough analysis our state-of-the-art cryptanalysis, provide trong bounds differential/linear attacks.

参考文章(30)
Céline Blondeau, Kaisa Nyberg, Links between Truncated Differential and Multidimensional Linear Properties of Block Ciphers and Underlying Attack Complexities theory and application of cryptographic techniques. pp. 165- 182 ,(2014) , 10.1007/978-3-642-55220-5_10
Jian Guo, Thomas Peyrin, Axel Poschmann, The PHOTON family of lightweight Hash functions international cryptology conference. ,vol. 2011, pp. 222- 239 ,(2011) , 10.1007/978-3-642-22792-9_13
Gregor Leander, Mohamed Ahmed Abdelraheem, Hoda AlKhzaimi, Erik Zenner, A cryptanalysis of PRINTcipher: the invariant subspace attack international cryptology conference. pp. 206- 221 ,(2011) , 10.1007/978-3-642-22792-9_12
Markku-Juhani O. Saarinen, Cryptographic Analysis of All 4 × 4-Bit S-Boxes Selected Areas in Cryptography. pp. 118- 133 ,(2012) , 10.1007/978-3-642-28496-0_7
Andrey Bogdanov, Miroslav Knežević, Gregor Leander, Deniz Toz, Kerem Varıcı, Ingrid Verbauwhede, spongent: A Lightweight Hash Function Cryptographic Hardware and Embedded Systems – CHES 2011. ,vol. 6917, pp. 312- 325 ,(2011) , 10.1007/978-3-642-23951-9_21
Andrey Bogdanov, Christian Rechberger, A 3-subset meet-in-the-middle attack: cryptanalysis of the lightweight block cipher KTANTAN international conference on selected areas in cryptography. ,vol. 6544, pp. 229- 240 ,(2010) , 10.1007/978-3-642-19574-7_16
Eli Biham, Ross Anderson, Lars Knudsen, Serpent: A New Block Cipher Proposal Fast Software Encryption. pp. 222- 238 ,(1998) , 10.1007/3-540-69710-1_15
Jan-Hendrik Evertse, David Chaum, Crytanalysis of DES with a Reduced Number of Rounds: Sequences of Linear Factors in Block Ciphers international cryptology conference. pp. 192- 211 ,(1985)
Yu Sasaki, Kazumaro Aoki, Finding Preimages in Full MD5 Faster Than Exhaustive Search international cryptology conference. pp. 134- 152 ,(2009) , 10.1007/978-3-642-01001-9_8