Differential Cryptanalysis of Feal and N-Hash

Differential Cryptanalysis of Feal and N-Hash (1991)

Cached

Download Links

[www.cs.technion.ac.il]

by Eli Biham , Adi Shamir

Citations:

27 - 2 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Differential Cryptanalysis of Feal and N-Hash	user correction - Legacy Corrections
AUTHOR NAME	Eli Biham	SVM HeaderParse 0.1
AUTHOR AFFIL	The Weizmann Institute of Science; Department of Applied Mathematics and Computer Science	SVM HeaderParse 0.2
AUTHOR ADDR	Rehovot 76100, Israel	SVM HeaderParse 0.1
AUTHOR NAME	Adi Shamir	SVM HeaderParse 0.1
AUTHOR AFFIL	The Weizmann Institute of Science; Department of Applied Mathematics and Computer Science	SVM HeaderParse 0.2
AUTHOR ADDR	Rehovot 76100, Israel	SVM HeaderParse 0.1
ABSTRACT	In [1,2] we introduced the notion of differential cryptanalysis and described its application to DES[11] and several of its variants. In this paper we show the applicability of differential cryptanalysis to the Feal family of encryption algorithms and to the N-Hash hash function. In addition, we show how to transform differential cryptanalytic chosen plaintext attacks into known plaintext attacks. 1 Introduction Feal is a family of encryption algorithms, which are designed to have simple and efficient software implementations on eight-bit microprocessors. The original member of this family, called Feal-4[13], had four rounds. This version was broken by Den Boer[3] using a chosen plaintext attack with 100 to 10000 ciphertexts. The designers of Feal reacted by creating a second version, called Feal-8[12,9] in which the number of rounds was increased to eight, while the F function was not changed. Feal-8 was broken by the differential cryptanalytic chosen plaintext attack described in thi...	user correction - Legacy Corrections
YEAR	1991	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	1--16	INFERENCE
VOLUME	547	INFERENCE
CITATIONS	12 found	ParsCit 1.0