Results 211 to 220 of about 34,772 (247)
Some of the next articles are maybe not open access.

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   +3 more sources

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

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   +2 more sources

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

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 0001   +3 more
openaire   +2 more sources

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.
Patrick Derbez, Pierre-Alain Fouque
openaire   +2 more sources

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   +2 more sources

Home - About - Disclaimer - Privacy