Cryptology ePrint Archive: Report 2017/760

GIFT: A Small Present (Full version)

Subhadeep Banik and Sumit Kumar Pandey and Thomas Peyrin and Yu Sasaki and Siang Meng Sim and Yosuke Todo

Abstract: In this article, we revisit the design strategy of PRESENT, leveraging all the advances provided by the research community in construction and cryptanalysis since its publication, to push the design up to its limits. We obtain an improved version, named GIFT, that provides a much increased efficiency in all domains (smaller and faster), while correcting the well-known weakness of PRESENT with regards to linear hulls.

GIFT is a very simple and clean design that outperforms even SIMON or SKINNY for round-based implementations, making it one of the most energy efficient ciphers as of today. It reaches a point where almost the entire implementation area is taken by the storage and the Sboxes, where any cheaper choice of Sbox would lead to a very weak proposal. In essence, GIFT is composed of only Sbox and bit-wiring, but its natural bitslice data flow ensures excellent performances in all scenarios, from area-optimised hardware implementations to very fast software implementation on high-end platforms.

We conducted a thorough analysis of our design with regards to state-of-the-art cryptanalysis, and we provide strong bounds with regards to differential/linear attacks.

Category / Keywords: secret-key cryptography / lightweight cryptography, block cipher, PRESENT, GIFT

Original Publication (with major differences): IACR-CHES-2017

Date: received 6 Aug 2017, withdrawn 7 Aug 2017

Contact author: ssim011 at e ntu edu sg

Available format(s): (-- withdrawn --)

Note: This is the full version of the same work published in CHES 2017.

Version: 20170808:001134 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]