GIFT: A Small Present
From MaRDI portal
Publication:5114641
DOI10.1007/978-3-319-66787-4_16zbMath1450.94026OpenAlexW2741840250MaRDI QIDQ5114641
Yu Sasaki, Siang Meng Sim, Subhadeep Banik, Sumit Kumar Pandey, Thomas Peyrin, Yosuke Todo
Publication date: 24 June 2020
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-66787-4_16
Related Items (61)
Meet-in-the-middle attacks revisited: key-recovery, collision, and preimage attacks ⋮ Revisiting the security of DbHtS MACs: beyond-birthday-bound in the multi-user setting ⋮ Thinking outside the superbox ⋮ \textsf{PIPO}: a lightweight block cipher with efficient higher-order masking software implementations ⋮ Improved (related-key) differential cryptanalysis on GIFT ⋮ WARP: revisiting GFN for lightweight 128-bit block cipher ⋮ An STP-based model toward designing S-boxes with good cryptographic properties ⋮ Cryptanalysis of FlexAEAD ⋮ On the existence and non-existence of some classes of bent-negabent functions ⋮ Differential-ML distinguisher: machine learning based generic extension for differential cryptanalysis ⋮ Automatic search for bit-based division property ⋮ Transparency order of \((n, m)\)-functions -- its further characterization and applications ⋮ \textsf{Light-OCB}: parallel lightweight authenticated cipher with full security ⋮ Key guessing strategies for linear key-schedule algorithms in rectangle attacks ⋮ A greater \texttt{GIFT}: strengthening \texttt{GIFT} against statistical cryptanalysis ⋮ On the relationship between resilient Boolean functions and linear branch number of S-boxes ⋮ Generalized related-key rectangle attacks on block ciphers with linear key schedule: applications to SKINNY and GIFT ⋮ Out of Non-linearity: Search Impossible Differentials by the Bitwise Characteristic Matrix ⋮ On the existence of special nonlinear invariants for round functions of XSL-ciphers ⋮ Authenticated encryption for very short inputs ⋮ XOCB: beyond-birthday-bound secure authenticated encryption mode with rate-one computation ⋮ New method for combining Matsui's bounding conditions with sequential encoding method ⋮ Blockcipher-based authenticated encryption: how small can we go? ⋮ FUTURE: a lightweight block cipher using an optimal diffusion matrix ⋮ A small GIFT-COFB: lightweight bit-serial architectures ⋮ Cryptanalysis of reduced round SPEEDY ⋮ Implementing Grover oracle for lightweight block ciphers under depth constraints ⋮ Light but tight: lightweight composition of serialized S-boxes with diffusion layers for strong ciphers ⋮ Key-reduced variants of 3Kf9 with beyond-birthday-bound security ⋮ Generalized boomerang connectivity table and improved cryptanalysis of GIFT ⋮ Clustering effect of iterative differential and linear trails ⋮ Mind the \texttt{TWEAKEY} schedule: cryptanalysis on \texttt{SKINNYe-64-256} ⋮ Differential meet-in-the-middle cryptanalysis ⋮ Strong and tight security guarantees against integral distinguishers ⋮ Generic framework for key-guessing improvements ⋮ DEFAULT: cipher level resistance against differential fault attack ⋮ \textsf{tHyENA}: making \textsf{HyENA} even smaller ⋮ \textsf{Elastic-Tweak}: a framework for short tweak tweakable block cipher ⋮ Analyzing masked ciphers against transition and coupling effects ⋮ Automated key recovery attacks on round-reduced Orthros ⋮ Four by four MDS matrices with the fewest XOR gates based on words ⋮ Quantum attacks on beyond-birthday-bound MACs ⋮ See-in-the-middle attacks on blockciphers ARIA and DEFAULT ⋮ Mind the propagation of states. New automatic search tool for impossible differentials and impossible polytopic transitions ⋮ Lower bounds on the degree of block ciphers ⋮ Beyond birthday bound secure fresh rekeying: application to authenticated encryption ⋮ Improved security analysis for nonce-based enhanced hash-then-mask MACs ⋮ Obstacle Numbers of Planar Graphs ⋮ Finding integral distinguishers with ease ⋮ A First-Order SCA Resistant AES Without Fresh Randomness ⋮ Modeling for three-subset division property without unknown subset ⋮ Mind the composition: birthday bound attacks on EWCDMD and SoKAC21 ⋮ Tight security bounds for double-block hash-then-sum MACs ⋮ Modeling for three-subset division property without unknown subset. Improved cube attacks against Trivium and Grain-128AEAD ⋮ Fault template attacks on block ciphers exploiting fault propagation ⋮ Automatic search of meet-in-the-middle preimage attacks on AES-like hashing ⋮ GIFT ⋮ SAND: an AND-RX Feistel lightweight block cipher supporting S-box-based security evaluations ⋮ A note on the signal-to-noise ratio of \((n, m)\)-functions ⋮ Analyzing the provable security bounds of GIFT-COFB and Photon-Beetle ⋮ Cryptanalysis of stream cipher LIZARD using division property and MILP based cube attack
Uses Software
This page was built for publication: GIFT: A Small Present