Automated Search Oriented to Key Recovery on Ciphers with Linear Key Schedule [PDF]
IACR Transactions on Symmetric Cryptology, 2021 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 +7 more sources
Improved Search for Integral, Impossible Differential and Zero-Correlation Attacks [PDF]
IACR Transactions on Symmetric CryptologyIntegral, 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 +5 more sources
1, 2, 3, Fork: Counter Mode Variants based on a Generalized Forkcipher [PDF]
IACR Transactions on Symmetric Cryptology, 2021 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 +5 more sources
Improved Rectangle Attacks on SKINNY and CRAFT [PDF]
IACR Transactions on Symmetric Cryptology, 2021 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 +2 more sources
Cryptanalysis of Forkciphers [PDF]
IACR Transactions on Symmetric Cryptology, 2020 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 +2 more sources
Generalized impossible differential attacks on block ciphers: application to SKINNY and ForkSKINNY [PDF]
Designs, Codes and CryptographyzbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ling Song 0001 +4 more
core +5 more sources
Automated Search Oriented to Key Recovery on Ciphers with Linear Key Schedule: Applications to Boomerangs in SKINNY and ForkSkinny [PDF]
, 2021 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 +1 more source
Meet-in-the-Middle Attacks Revisited: Key-recovery, Collision, and Preimage Attacks [PDF]
, 2021 At EUROCRYPT 2021, Bao et al. proposed an automatic method for systematically exploring the configuration space of meet-in-the-middle (MITM) preimage attacks.
Siwei Sun +5 more
core +1 more source
A Forkcipher-Based Pseudo-Random Number Generator
, 2023 Good randomness is needed for most cryptographic appli- cations. In practice pseudo-random number generators (PRNGs) are employed. CTR_DRBG is a popular choice and among the recommended PRNGs by NIST.
Andreeva, Elena; orcid: +1 more
core +1 more source
Forkcipher: a New Primitive for Authenticated Encryption of Very Short Messages [PDF]
, 2019 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
Reza Reyhanitabar +5 more
core +3 more sources