Results 151 to 160 of about 518,524 (183)
Some of the next articles are maybe not open access.

Match Box Meet-in-the-Middle Attack Against KATAN

2015
Recent years have seen considerable interest in lightweight cryptography. One particular consequence is a renewed study of meet-in-the-middle attacks, which aim to exploit the relatively simple key schedules often encountered in lightweight ciphers. In this paper we propose a new technique to extend the number of rounds covered by a meet-in-the-middle ...
Thomas Fuhr, Brice Minaud
openaire   +1 more source

Automatic Search of Meet-in-the-Middle and Impossible Differential Attacks

2016
Tracking bits through block ciphers and optimizing attacks at hand is one of the tedious task symmetric cryptanalysts have to deal with. It would be nice if a program will automatically handle them at least for well-known attack techniques, so that cryptanalysts will only focus on finding new attacks.
Derbez, Patrick, Fouque, Pierre-Alain
openaire   +2 more sources

12 Birthday Paradox and Meet-in-the-Middle Attack

2004
In this chapter, we will discuss the aspect of integrity, i.e., the danger that Eve could change the message sent by Alice so that Bob does not notice that the message he receives is now fraudulent.
openaire   +1 more source

Improved Meet-in-the-Middle Attacks on Reduced Round Kuznyechik

2018
Kuznyechik is an SPN block cipher that has been chosen recently to be standardized by the Russian federation as a new GOST cipher. The cipher employs a 256-bit key which is used to generate ten 128-bit round keys. The encryption procedure updates the 16-byte state by iterating the round function for nine rounds.
Mohamed Tolba, Amr M. Youssef
openaire   +1 more source

Meet-in-the-Middle Attacks on Reduced-Round Hierocrypt-3

2015
Hierocrypt-3 is an SPN-based block cipher designed by Toshiba Corporation. It operates on 128-bit state using either 128, 192 or 256-bit key. In this paper, we present two meet-in-the-middle attacks in the single-key setting on the 4-round reduced Hierocrypt-3 with 256-bit key. The first attack is based on the differential enumeration approach where we
Ahmed Abdelkhalek   +3 more
openaire   +1 more source

Meet in the Middle Attack on Type-1 Feistel Construction

2018
We provide a key recovery attack on type-1 Feistel construction based on the meet-in-the-middle technique. This construction is described by Zheng, Matsumoto, and Imai in CRYPTO 1989. Type-1 Feistel structure is a well-known construction used to construct ciphers and hash functions, such as CAST-256 and Lesamnta.
Yuanhao Deng, Chenhui Jin, Rongjia Li
openaire   +1 more source

Algebraic Meet-in-the-Middle Attack on LowMC

2022
Fukang Liu   +4 more
openaire   +1 more source

Three-Subset Meet-in-the-Middle Attack on Reduced XTEA

2012
This paper presents an improved single-key attack on a block-cipher XTEA by using the three-subset meet-in-the-middle (MitM) attack. Firstly, a technique on a generic block-cipher is discussed. It points out that the previous work applying the splice-and-cut technique to the three-subset MitM attack contains incomplete arguments, and thus it requires a
Yu Sasaki   +4 more
openaire   +1 more source

Integrative oncology: Addressing the global challenges of cancer prevention and treatment

Ca-A Cancer Journal for Clinicians, 2022
Jun J Mao,, Msce   +2 more
exaly  

The Meet-in-the-middle Attacks on Zodiac

Journal of Electronics & Information Technology, 2013
Xin Hai, Xue-hai Tang, Chao Li
openaire   +1 more source

Home - About - Disclaimer - Privacy