Filters








9 Hits in 5.3 sec

Sieve-in-the-Middle: Improved MITM Attacks [chapter]

Anne Canteaut, María Naya-Plasencia, Bastien Vayssière
2013 Lecture Notes in Computer Science  
This paper first provides a new generic improvement of MITM algorithms, named sieve-in-the-middle, which allows to attack a higher number of rounds.  ...  This paper presents a new generic technique, named sieve-in-the-middle, which improves meet-in-the-middle attacks in the sense that it provides an attack on a higher number of rounds.  ...  Combining Sieve-in-the-Middle and Bicliques Sieve-in-the-middle, as a generic technique, can be combined with other improvements of MITM attacks, in particular with bicliques [6, 30] .  ... 
doi:10.1007/978-3-642-40041-4_13 fatcat:3vv2tgi545be5e37e7fb5jdhla

Differential Sieving for 2-Step Matching Meet-in-the-Middle Attack with Application to LBlock [chapter]

Riham AlTawy, Amr M. Youssef
2015 Lecture Notes in Computer Science  
This technique improves the scope of the basic meet in the middle attack by providing means to extend the matching point for an extra round through differential matching and hence the overall number of  ...  the attacked rounds is extended.  ...  The authors would like to thank the anonymous reviewers for their valuable comments and suggestions that helped improve the quality of the paper.  ... 
doi:10.1007/978-3-319-16363-5_8 fatcat:hsffes4ovnaqjmo747xjgc7kcu

New Attacks on Feistel Structures with Improved Memory Complexities [chapter]

Itai Dinur, Orr Dunkelman, Nathan Keller, Adi Shamir
2015 Lecture Notes in Computer Science  
In this paper we describe improved attacks on Feistel structures with more than 4 rounds.  ...  Our new attacks are not just theoretical generic constructions -in fact, we can use them to improve the best known attacks on several concrete cryptosystems such as CAST-128 (where we reduce the memory  ...  14, 20] , bicliques [3] , sieve-in-the-middle [6] , and many others.  ... 
doi:10.1007/978-3-662-47989-6_21 fatcat:hjfo7sd4bvayvjwr6zsnyxcmiu

Bicliques with Minimal Data and Time Complexity for AES [chapter]

Andrey Bogdanov, Donghoon Chang, Mohona Ghosh, Somitra Kumar Sanadhya
2015 Lecture Notes in Computer Science  
Each attack just requires 2 (for AES-128 and AES-192) or 3 (for AES-256) known plaintexts for success probability 1. We obtain these results using the improved biclique attack proposed in Crypto'13.  ...  In Crypto'13, Canteaut et al. proposed biclique attack where the data complexity of the attack was reduced to a single plaintext-ciphertext pair.  ...  Fig. 12 : 12 Fastest biclique attack on AES-256: time 2 253.87 and full codebook. 8 Improving Biclique Attack Complexities on AES through Sieve-in-the-middle processSieve-in-the-middle process (SIM),  ... 
doi:10.1007/978-3-319-15943-0_10 fatcat:d4o7mo6xsva3pmxsma4kclot4q

Improved All-Subkeys Recovery Attacks on FOX, KATAN and SHACAL-2 Block Ciphers [chapter]

Takanori Isobe, Kyoji Shibutani
2015 Lecture Notes in Computer Science  
Combining the ASR attack with some advanced techniques such as the function reduction and the repetitive ASR attack, we show the improved ASR attacks on the 7-round reduced FOX64 and FOX128.  ...  Preliminary All-Subkeys Recovery Approach [16] The all-subkeys recovery (ASR) attack was proposed in [16] as an extension of the meet-in-themiddle (MITM) attack.  ...  24] , the biclique cryptanalysis [6, 19] , the internal state guess [14, 10] , the sieve-in-the-middle technique [9] and the parallel-cut technique [23] .  ... 
doi:10.1007/978-3-662-46706-0_6 fatcat:y773ga26wvbx7nturdgrfbc26a

Efficient Dissection of Bicomposite Problems with Cryptanalytic Applications

Itai Dinur, Orr Dunkelman, Nathan Keller, Adi Shamir
2018 Journal of Cryptology  
To demonstrate the generality of the new dissection technique, we show how to use it in a generic way in order to improve rebound attacks on hash functions and to solve with better time complexities (for  ...  All the previous error-free attacks required time T and memory M satisfying TM = 2 rn , and even if "false negatives" are allowed, no attack could achieve TM < 2 3rn/4 .  ...  [7] used dissection in their 'sieve in the middle' generic technique for MITM attacks, Lallemand and Naya-Plasencia [20] used it in their semi-practical attack on the full stream cipher Sprout, Baek  ... 
doi:10.1007/s00145-018-9303-2 fatcat:zdkipy2k3bdmtnyz7cpt6x2fba

Generic Key Recovery Attack on Feistel Scheme [chapter]

Takanori Isobe, Kyoji Shibutani
2013 Lecture Notes in Computer Science  
Keywords: block cipher, key scheduling function, all-subkeys-recovery attack, meet-in-the-middle attack, key recovery attack, low-data complexity attack.  ...  To demonstrate the usefulness of our approach, we show a key recovery attack on the 8-round reduced CAST-128, which is the best attack with respect to the number of attacked rounds.  ...  Moreover, we expect that our attacks could be improved by combining with the recent attack called sieve-in-the-middle attack [17] .  ... 
doi:10.1007/978-3-642-42033-7_24 fatcat:7ib6wifyvzditfsf7x6kic7saq

LBC-IoT: Lightweight Block Cipher for IoT Constraint Devices

Rabie A. Ramadan, Bassam W. Aboshosha, Kusum Yadav, Ibrahim M. Alseadoon, Munawar J. Kashout, Mohamed Elhoseny
2021 Computers Materials & Continua  
Besides, it is immune to different types of attacks such as linear, differential, and side-channel as well as exible in terms of implementation.  ...  , 6 rounds 0.09 µm/0.13 µm 3286/3491 • Sieve-in-the-Middle, 8 rounds • Multiple differentials, 10 rounds SIMECK 32 Feistel 32 • Differential (22/28/35 rounds 0.13 µm 549/765 48 36 SIMECK-32/48/64) 778/  ...  It is an improved version of the DES algorithm with smart implementation. It uses a single S-Box, where DES uses eight S-boxes.  ... 
doi:10.32604/cmc.2021.015519 fatcat:i5fq2pf3ybbo5ict2imqwrdxhu

Impossible-Differential and Boomerang Cryptanalysis of Round-Reduced Kiasu-BC [chapter]

Christoph Dobraunig, Eik List
2017 Lecture Notes in Computer Science  
This work proposes impossible-differential and boomerang attacks on eight rounds of Kiasu-BC in the single-key model, using the core idea that the tweak input allows to construct local collisions.  ...  Improvement from the Sieve-in-the-Middle Approach. One can apply the sieve-in-the-middle approach by Canteaut et al. [12] to further reduce the computational complexity.  ...  Regarding Meet-in-the-Middle attacks, the designers [17, Sec. 4.2] conclude that "the same [MitM] attacks existing for AES-128 appl[y] to Kiasu-BC".  ... 
doi:10.1007/978-3-319-52153-4_12 fatcat:z6pzmirzcza5lhvxjxoduukwoe