Results 21 to 30 of about 306,267 (282)
A detailed analysis of the hybrid lattice-reduction and meet-in-the-middle attack
Over the past decade, the hybrid lattice-reduction and meet-in-the middle attack (called hybrid attack) has been used to evaluate the security of many lattice-based cryptographic schemes such as NTRU, NTRU Prime, BLISS and more.
Wunderer Thomas
doaj +2 more sources
Differential Meet-In-The-Middle Cryptanalysis [PDF]
International audienceIn this paper we introduce the differential meet-in-the-middle framework, a new cryptanalysis technique for symmetric primitives.
Boura, Christina +4 more
core +2 more sources
Current low COVID-19 vaccination rates in low- and middle-income countries reflect an inequitable global vaccine distribution; however, local attitudes towards the COVID-19 vaccine are an important factor to meet vaccination benchmarks.
M. Aron +8 more
semanticscholar +1 more source
Classical and Quantum Meet-in-the-Middle Nostradamus Attacks on AES-like Hashing
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
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
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
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 novel security analysis for a new NTRU variant with additional private key [PDF]
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
Meet-in-the-Middle Attacks on Reduced-Round XTEA [PDF]
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 +3 more sources
Improved meet-in-the-middle attacks on reduced-round tweakable block ciphers Kiasu-BC and Deoxys-BC
Tweakable block ciphers Kiasu-BC and Deoxys-BC are both the internal block ciphers of the candidates for the CAESAR authenticated encryption competition.
Zhangjun Ma, Manman Li, Shaozhen Chen
doaj +1 more source

