Results 11 to 20 of about 34,772 (247)
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
A Meet in the Middle Attack on Reduced Round Kiasu-BC
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2016 Amr M. Youssef, Ahmed Abdelkhalek
exaly +2 more sources
Meet-in-the-Middle Attacks on Reduced-Round XTEA [PDF]
, 2011 Summary: The block cipher GOST (GOST 28147-89) is a Russian standard for encryption and message authentication that is included in OpenSSL 1.0.0. In this paper, we present meet-in-the-middle attacks on several block ciphers, each consisting of 22 or fewer rounds of GOST.
Sekar, Gautham +3 more
openaire +4 more sources
A novel security analysis for a new NTRU variant with additional private key [PDF]
International Journal of Data and Network Science, 2023 This paper proposes a new variant of NTRU with a slightly different critical formulation. The significance of this new variant is that it requires an additional private key to provide a tighter scheme.
Nurshamimi Salleh +2 more
doaj +1 more source
A Meet-in-the-Middle Attack on 8-Round AES [PDF]
, 2008 We present a 5-round distinguisher for AES. We exploit this distinguisher to develop a meet-in-the-middle attack on 7 rounds of AES-192 and 8 rounds of AES-256. We also give a time-memory tradeoff generalization of the basic attack which gives a better balancing between different costs of the attack.
Hüseyin Demirci, Ali Aydin Selçuk
openaire +4 more sources
Improved Meet-in-the-Middle Attacks on Crypton and mCrypton
KSII Transactions on Internet and Information Systems, 2017 This study presents several meet‐in‐the‐middle attacks on reduced‐round Crypton and mCrypton block ciphers. Using the generalised δ ‐set, the authors construct 5‐round distinguishers on Crypton and mCrypton.
Jingyi Cui +3 more
openaire +2 more sources
Meet-in-the-Middle Attacks on SHA-3 Candidates [PDF]
, 2009 We present preimage attacks on the SHA-3 candidates Boole, EnRUPT, Edon-R, and Sarmal, which are found to be vulnerable against a meet-in-the-middle attack. The idea is to invert (or partially invert) the compression function and to exploit its non-randomness. To launch an attack on a large internal state we manipulate the message blocks to be injected
Dmitry Khovratovich +2 more
openaire +1 more source
Improved Meet-in-the-Middle Attacks on AES
, 2009 We improve the existing distinguishers of AES. Our work is mainly built upon the works by Gilbert& Miner [17] and Demirci & Selcuk [14]. We find out that some part of the inner encryption function of AES can be expressed with relatively few constants under certain conditions. These new distinguishers are exploited to develop a meet-in-the-middle attack
Hüseyin Demirci +3 more
openaire +3 more sources
Preimage and pseudo-collision attacks on 29-step SM3 hash function with padding
Tongxin xuebao, 2014 The security of SM3 hash function was revaluated by using the meet-in-the-middle attack. The preimage and pseudo-collision attack on 29-step SM3 hash function (from the 1-st step) with padding was presented.
Gao-li WANG, Yan-zhao SHEN
doaj +2 more sources