Results 1 to 10 of about 33,641 (152)
Meet-in-the-Middle Attacks on Reduced-Round Midori64
IACR Transactions on Symmetric Cryptology, 2017 Midori is a lightweight block cipher designed by Banik et al. at ASIACRYPT 2015 to achieve low energy consumption. One version of Midori uses a 64-bit state, another uses a 128-bit state and we denote these versions Midori64 and Midori128.
Li Lin, Wenling Wu
doaj +4 more sources
Quantum meet-in-the-middle attack on Feistel construction
Quantum Information Processing, 2023 18 pages, 3 ...
Yinsong Xu
exaly +4 more sources
An automated model for differential meet in the middle attacks on AndRX ciphers [PDF]
Scientific ReportsIn recent years, research in block cipher cryptanalysis has been significantly influenced by the development of differential meet in the middle techniques.
Debasmita Chakraborty +3 more
doaj +2 more sources
Programming the Demirci-Selçuk Meet-in-the-Middle Attack with Constraints [PDF]
Lecture Notes in Computer Science, 2018 Cryptanalysis with SAT/SMT, MILP and CP has increased in popularity among symmetric-key cryptanalysts and designers due to its high degree of automation. So far, this approach covers differential, linear, impossible differential, zero-correlation, and integral cryptanalysis.
Siwei Sun, Yosuke Tōdō, Danping Shi
exaly +3 more sources
A Hybrid of Dual and Meet-in-the-Middle Attack on Sparse and Ternary Secret LWE
IEEE Access, 2019 The dual attack is one of the most efficient attack algorithms for learning with errors (LWE) problem. Recently, an efficient variant of the dual attack for sparse and small secret LWE was reported by Albrecht (Eurocrypt 2017), which forces some LWE ...
Jung Hee Cheon +3 more
doaj +3 more sources
The parallel-cut meet-in-the-middle attack [PDF]
Cryptography and Communications, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ivica Nikolic +2 more
openaire +3 more sources
Classical and Quantum Meet-in-the-Middle Nostradamus Attacks on AES-like Hashing
IACR Transactions on Symmetric Cryptology, 2023 At EUROCRYPT 2006, Kelsey and Kohno proposed the so-called chosen target forced-prefix (CTFP) preimage attack, where for any challenge prefix P, the attacker can generate a suffix S such that H(P∥S) = y for some hash value y published in advance by the ...
Zhiyu Zhang +3 more
doaj +1 more source
Generalized Meet in the Middle Cryptanalysis of Block Ciphers With an Automated Search Algorithm
IEEE Access, 2020 Meet in the middle (MITM) attack is one of the most important and applicable methods for cryptanalysis of block ciphers. In this paper, a more generalized method for MITM attack is considered.
Siavash Ahmadi, Mohammad Reza Aref
doaj +1 more source
Meet‐in‐the‐middle attacks on round‐reduced CRAFT based on automatic search
IET Information Security, 2023 CRAFT is a lightweight block cipher designed by Beierle et al. to effectively resist differential fault attacks at fast software encryption 2019. In this article, Demirci‐Selçuk meet‐in‐the‐middle (DS‐MITM) attacks on round‐reduced CRAFT based on ...
Zhangjun Ma, Manman Li, Shaozhen Chen
doaj +1 more source
Time-Memory Analysis of Parallel Collision Search Algorithms
Transactions on Cryptographic Hardware and Embedded Systems, 2021 Parallel versions of collision search algorithms require a significant amount of memory to store a proportion of the points computed by the pseudo-random walks.
Monika Trimoska +2 more
doaj +1 more source