Results 211 to 220 of about 33,740 (251)
Some of the next articles are maybe not open access.

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

Lecture Notes in Computer Science, 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
Ohta Kazuo, Sakiyama Kazuo, Sasaki Yu
exaly   +2 more sources

Meet-in-the-Middle Attacks on Reduced Round Piccolo

Science China Information Sciences, 2016
Piccolo is a lightweight block cipher designed by Sony Corporation and published in CHES 2011. It inherits the Generalized Feistel Network GFN structure and operates on a 64-bit state. It has two versions; Piccolo-80 and Piccolo-128 with 80-bit and 128-bit keys, respectively.
Mohamed Tolba   +2 more
openaire   +2 more sources

Meet-in-the-Middle Attacks Revisited: Key-Recovery, Collision, and Preimage Attacks

2021
At EUROCRYPT 2021, Bao et al. proposed an automatic method for systematically exploring the configuration space of meet-in-the-middle (MITM) preimage attacks. We further extend it into a constraint-based framework for finding exploitable MITM characteristics in the context of key-recovery and collision attacks by taking the subtle peculiarities of both
Xiaoyang Dong 0001   +5 more
openaire   +1 more source

Meet-in-the-Middle Attacks on Round-Reduced Khudra

2015
Khudra is a hardware-oriented lightweight block cipher that is designed to run efficiently on Field Programmable Gate Arrays. It employs an 18-rounds Generalized type-2 Feistel Structure with a 64-bit block length and an 80-bit key. In this paper, we present Meet-in-the-Middle MitM attacks on 13 and 14 round-reduced Khudra.
Mohamed Tolba   +2 more
openaire   +1 more source

A meet-in-the-middle attack on the LBlock cipher

IEEE Conference Anthology, 2013
LBlock is a new lightweight Block cipher which was proposed by Wu and Zhang at ACNS2011. The block size of LBlock is 64 bits and its key size is 80 bits. It was reported that the cipher is very suitable for many resource constrained environments (for instance RFID and sensor networking) which usually have weak computation ability, strict power ...
Yongzhuang Wei   +2 more
openaire   +1 more source

Meet-in-the-middle attack on digital signature schemes

2006
The meet-in-the-middle attack can be used for forging signatures on mixed-type digital signature schemes, and takes less time than an exhaustive attack. This paper formulates a meet-in-the-middle attack on mixed-type digital signature schemes, shows the necessary conditions for success, and discusses the relationships between computational and space ...
Kazuo Ohta, Kenji Koyama
openaire   +1 more source

Meet-in-the-middle attacks on AES with value constraints

Designs, Codes and Cryptography
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaoli Dong   +4 more
openaire   +1 more source

Meet-in-the-middle attacks on 10-round AES-256

Designs, Codes and Cryptography, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rongjia Li, Chenhui Jin
openaire   +1 more source

Extended meet-in-the-middle attacks on some Feistel constructions

Designs, Codes and Cryptography, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jian Guo 0001   +3 more
openaire   +1 more source

Side-Channel Attack Using Meet-in-the-Middle Technique

The Computer Journal, 2009
In this paper, we introduce a new side-channel attack using block cipher cryptanalysis named a meet-in-the-middle attack. Using our new side-channel technique we show that advanced encryption standard (AES) with reduced 10 masked rounds is broken, which is faster than the exhaustive key search attack. This implies that one has to mask the entire rounds
Jongsung Kim, Seokhie Hong
openaire   +1 more source

Home - About - Disclaimer - Privacy