(Enter summary)
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... (Update)
Context of citations to this paper: More
...a very powerful technique for the analysis of block ciphers. It has been used with success against many block ciphers, e.g. [1, 2, 3, 4, 21]. One weakness of differential cryptanalysis is that it finds chosen plaintext attacks; these are much less practical than known plaintext...
...chosen plaintext pairs, our attack would seem to requires 2 127 plaintexts. We are able to reduce the number to 2 by a well known trick shown in [2]. We use the notations 1L, 1M and 1N as in the previous section. The equation 1L 8 1M = 1N holds for these three differences....
Cited by: More
Unknown - We Also Denote
(Correct)
Cryptanalysis of the CFB mode of the DES with a.. - Preneel, Nuttin.. (1993)
(Correct)
Security and Privacy in Radio-Frequency Identification Devices - Weis (2003)
(Correct)
Active bibliography (related documents): More All
1.4: Differential Cryptanalysis attacks - Biham, Shamir (1991)
(Correct)
0.7: Differential Fault Analysis of Secret Key Cryptosystems - Biham, Shamir (1997)
(Correct)
0.6: Block Ciphers - Robshaw (1995)
(Correct)
Similar documents based on text: More All
0.6: Linear Cryptanalysis of the Fast Data Encipherment Algorithm - Ohta, Aoki (1994)
(Correct)
0.5: Iterative Characteristics of DES and s²-DES - Knudsen
(Correct)
0.5: New Types of Cryptanalytic Attacks Using Related Keys - Biham (1994)
(Correct)
Related documents from co-citation: More All
16: Differential Cryptanalysis of DES-like Cryptosystems
- Biham, Shamir - 1991
8: Differential Cryptanalysis of Snefru (context) - Biham, Shamir - 1992
7: Cryptanalysis of DES with a reduced number of rounds (context) - Chaum, Evertse - 1985
BibTeX entry: (Update)
E. Biham and A. Shamir. Differential cryptanalysis of FEAL and N-Hash. In Advances in Cryptology --- Eurocrypt '91, pages 1--16, 1991. http://citeseer.ist.psu.edu/article/biham91differential.html More
@inproceedings{ biham91differential,
author = "Biham, E. and Shamir, A.",
title = "Differential cryptanalysis of {FEAL} and {N}-{H}ash",
booktitle = "Advances in Cryptology --- Eurocrypt '91",
publisher = "Springer-Verlag",
address = "Berlin",
editor = "D.W. Davies",
pages = "1--16",
year = "1991",
url = "citeseer.ist.psu.edu/article/biham91differential.html" }
Citations (may not include all citations):
202
Data Encryption Standard (context) - of - 1977
155
Differential Cryptanalysis of DES-like Cryptosystems
- Biham, Shamir - 1990
155
Differential Cryptanalysis of DES-like Cryptosystems
- Biham, Shamir - 1991
17
Fast Data Encryption Algorithm FEAL (context) - Shimizu, Miyaguchi - 1987
17
Fast Data Encryption Algorithm FEAL (context) - Shimizu, Miyaguchi - 1987
12
Fast Data Encryption Algorithm FEAL
- Miyaguchi, Shiraishi et al. - 1988
7
bit hash function (context) - Miyaguchi, Ohta et al. - 1990
5
The Cryptanalysis of FEAL-4 with 20 Chosen Plaintexts (context) - Murphy - 1990
4
A Statistical Attack on the FEAL-8 Cryptosystem (context) - Gilbert, Chasse - 1990
4
Lecture Notes in Computer Science (context) - Miyaguchi, cipher - 1990
3
Lecture Notes in Computer Science (context) - Fumy, F-function et al. - 1987
3
technical note (context) - Miyaguchi, specifications - 1989
2
Lecture Notes in Computer Science (context) - Den-Boer, of - 1988
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.technion.ac.il/~biham/publications.html): More
Cryptanalysis of Skipjack Reduced to 31 Rounds using.. - Biham, Biryukov, Shamir (1999)
(Correct)
An Improvement of Davies' Attack on DES - Biham, al. (1994)
(Correct)
Two Practical and Provably Secure Block Ciphers: BEAR and LION - Anderson, Biham (1996)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC