Automated Search Oriented to Key Recovery on Ciphers with Linear Key Schedule [PDF]
Automatic modelling to search distinguishers with high probability covering as many rounds as possible, such as MILP, SAT/SMT, CP models, has become a very popular cryptanalysis topic today.
Lingyue Qin +4 more
doaj +5 more sources
Cryptanalysis of Forkciphers [PDF]
The forkcipher framework was designed in 2018 by Andreeva et al. for authenticated encryption of short messages. Two dedicated ciphers were proposed in this framework: ForkAES based on the AES (and its tweakable variant Kiasu-BC), and ForkSkinny based on
Augustin Bariant +2 more
doaj +6 more sources
Improved Rectangle Attacks on SKINNY and CRAFT [PDF]
The boomerang and rectangle attacks are adaptions of differential cryptanalysis that regard the target cipher E as a composition of two sub-ciphers, i.e., E = E1 ∘ E0, to construct a distinguisher for E with probability p2q2 by concatenating two short ...
Hosein Hadipour +2 more
doaj +3 more sources
Improved Search for Integral, Impossible Differential and Zero-Correlation Attacks
Integral, impossible-differential (ID), and zero-correlation (ZC) attacks are three of the most important attacks on block ciphers. However, manually finding these attacks can be a daunting task, which is why automated methods are becoming increasingly ...
Hosein Hadipour +3 more
doaj +2 more sources
Generalized impossible differential attacks on block ciphers: application to SKINNY and ForkSKINNY [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Song, Ling +4 more
openaire +4 more sources
1, 2, 3, Fork: Counter Mode Variants based on a Generalized Forkcipher
A multi-forkcipher (MFC) is a generalization of the forkcipher (FC) primitive introduced by Andreeva et al. at ASIACRYPT’19. An MFC is a tweakable cipher that computes s output blocks for a single input block, with s arbitrary but fixed.
Elena Andreeva +3 more
doaj +1 more source
Forkcipher: a New Primitive for Authenticated Encryption of Very Short Messages [PDF]
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 (max. message size 64 bytes), massive IoT, critical communication domains
Antoon Purnal +5 more
core +6 more sources
Optimized Software Implementations for theLightweight Encryption Scheme ForkAE [PDF]
In this work we develop optimized software implementationsfor ForkAE, a second round candidate in the ongoing NIST lightweight cryptography standardization process.
Angshuman Karmakar +4 more
core +2 more sources
Improved Search for Integral, Impossible-Differential and Zero-Correlation Attacks: Application to Ascon, ForkSKINNY, SKINNY, MANTIS, PRESENT and QARMAv2 [PDF]
Integral, impossible-differential (ID), and zero-correlation (ZC) attacks are three of the most important attacks on block ciphers. However, manually finding these attacks can be a daunting task, which is why automated methods are becoming increasingly ...
Hosein Hadipour +3 more
core
Automated Search Oriented to Key Recovery on Ciphers with Linear Key Schedule: Applications to Boomerangs in SKINNY and ForkSkinny [PDF]
Automatic modelling to search distinguishers with high probability covering as many rounds as possible, such as MILP, SAT/SMT, CP models, has become a very popular cryptanalysis topic today.
Keting Jia +4 more
core

