Efficient MILP modelings for sboxes and linear layers of SPN ciphers
C Boura, D Coggia - IACR Transactions on Symmetric Cryptology, 2020 - inria.hal.science
Mixed Integer Linear Programming (MILP) solvers are regularly used by designers for
providing security arguments and by cryptanalysts for searching for new distinguishers. For …
providing security arguments and by cryptanalysts for searching for new distinguishers. For …
Out of oddity–new cryptanalytic techniques against symmetric primitives optimized for integrity proof systems
The security and performance of many integrity proof systems like SNARKs, STARKs and
Bulletproofs highly depend on the underlying hash function. For this reason several new …
Bulletproofs highly depend on the underlying hash function. For this reason several new …
MILP-aided method of searching division property using three subsets and applications
S Wang, B Hu, J Guan, K Zhang, T Shi - … on the Theory and Application of …, 2019 - Springer
Division property is a generalized integral property proposed by Todo at EUROCRYPT
2015, and then conventional bit-based division property (CBDP) and bit-based division …
2015, and then conventional bit-based division property (CBDP) and bit-based division …
New automatic search tool for impossible differentials and zero-correlation linear approximations
Impossible differential and zero-correlation linear cryptanalysis are two of the most powerful
cryptanalysis methods in the field of symmetric key cryptography. There are several …
cryptanalysis methods in the field of symmetric key cryptography. There are several …
An algebraic attack on ciphers with low-degree round functions: application to full MiMC
M Eichlseder, L Grassi, R Lüftenegger… - Advances in Cryptology …, 2020 - Springer
Algebraically simple PRFs, ciphers, or cryptographic hash functions are becoming
increasingly popular, for example due to their attractive properties for MPC and new proof …
increasingly popular, for example due to their attractive properties for MPC and new proof …
Improved rectangle attacks on SKINNY and CRAFT
The boomerang and rectangle attacks are adaptions of differential cryptanalysis that regard
the target cipher E as a composition of two sub-ciphers, ie, E= E 1∘ E 0, to construct a …
the target cipher E as a composition of two sub-ciphers, ie, E= E 1∘ E 0, to construct a …
Forkcipher: a new primitive for authenticated encryption of very short messages
E Andreeva, V Lallemand, A Purnal… - … Conference on the …, 2019 - Springer
Highly efficient encryption and authentication of short messages is an essential requirement
for enabling security in constrained scenarios such as the CAN FD in automotive systems …
for enabling security in constrained scenarios such as the CAN FD in automotive systems …
Revisiting differential-linear attacks via a boomerang perspective with application to AES, Ascon, CLEFIA, SKINNY, PRESENT, KNOT, TWINE, WARP, LBlock, Simeck …
Abstract In 1994, Langford and Hellman introduced differential-linear (DL) cryptanalysis,
with the idea of decomposing the block cipher E into two parts, E u and E ℓ, such that E u …
with the idea of decomposing the block cipher E into two parts, E u and E ℓ, such that E u …
Catching the Fastest Boomerangs: Application to SKINNY
In this paper we describe a new tool to search for boomerang distinguishers. One limitation
of the MILP model of Liu et al. is that it handles only one round for the middle part while …
of the MILP model of Liu et al. is that it handles only one round for the middle part while …
Lower bounds on the degree of block ciphers
Lower Bounds on the Degree of Block Ciphers | SpringerLink Skip to main content
Advertisement SpringerLink Account Menu Find a journal Publish with us Track your …
Advertisement SpringerLink Account Menu Find a journal Publish with us Track your …