A greater \texttt{GIFT}: strengthening \texttt{GIFT} against statistical cryptanalysis
From MaRDI portal
Publication:2170083
Recommendations
- Improved (related-key) differential cryptanalysis on GIFT
- GIFT: a small present. Towards reaching the limit of lightweight encryption
- MILP-based differential attack on round-reduced GIFT
- Generalized boomerang connectivity table and improved cryptanalysis of GIFT
- Integer linear programming for three-subset meet-in-the-middle attacks: application to GIFT
Cites work
- Applying MILP method to searching integral distinguishers based on division property for 6 lightweight block ciphers
- Automatic security evaluation and (related-key) differential characteristic search: application to SIMON, PRESENT, Lblock, DES(L) and other bit-oriented block ciphers
- Cryptanalysis of Skipjack Reduced to 31 Rounds Using Impossible Differentials
- Differential and Linear Cryptanalysis Using Mixed-Integer Linear Programming
- GIFT: a small present. Towards reaching the limit of lightweight encryption
- scientific article; zbMATH DE number 2089131 (Why is no real title available?)
- scientific article; zbMATH DE number 503238 (Why is no real title available?)
- scientific article; zbMATH DE number 1088930 (Why is no real title available?)
- scientific article; zbMATH DE number 1394292 (Why is no real title available?)
- Improved (related-key) differential cryptanalysis on GIFT
- Linear cryptanalysis of reduced-round PRESENT
- Linear hulls with correlation zero and linear cryptanalysis of block ciphers
- MILP-based differential attack on round-reduced GIFT
- New impossible differential search tool from design and cryptanalysis aspects. Revealing structural properties of several ciphers
- Observations on the \textsf{SIMON} block cipher family
- PRESENT: An Ultra-Lightweight Block Cipher
- The \textsc{Simon} and \textsc{Speck} block ciphers on AVR 8-bit microcontrollers
- The PHOTON family of lightweight hash functions
- The SKINNY Family of Block Ciphers and Its Low-Latency Variant MANTIS
- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
Cited in
(9)- Integer linear programming for three-subset meet-in-the-middle attacks: application to GIFT
- Analyzing the provable security bounds of GIFT-COFB and Photon-Beetle
- MILP-based differential attack on round-reduced GIFT
- GIFT: a small present. Towards reaching the limit of lightweight encryption
- Generalized boomerang connectivity table and improved cryptanalysis of GIFT
- Improved differential attacks on GIFT-64
- Improved attacks on \texttt{GIFT-64}
- Investigation of the optimal linear characteristics of BAKSHEESH
- Improved (related-key) differential cryptanalysis on GIFT
This page was built for publication: A greater \texttt{GIFT}: strengthening \texttt{GIFT} against statistical cryptanalysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2170083)
