Akihiro Shimizu, Shoji Miyaguchi, Fast Data Encryption Algorithm FEAL, EUROCRYPT'87, pp. 267--278, 1987.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....of sensitive information well into the 21 st century. In this paper we will describe DES and briefly present TDEA. Furthermore, we will describe an attack (differential cryptanalysis) that can be applied not only to DES but to many DESlike iterated cryptosystems (such as Lucifer, FEAL [12] and GDES [11] This is a chosen plaintext attack which uses only the resultant ciphertexts. The basic tool of the attack is the ciphertext pair: a pair of ciphertexts whose plaintexts have particular differences (thus the name differential) The two plaintexts can be chosen at random, as long as ....

....pairs. However, differential cryptanalysis is considered as major breakthrough in cryptanalysis. It is one of the most general cryptanalytic tools to date against modern iterated cryptosystems, including DES, Lucifer [6] GDES (Generalized DES Scheme) 11] and FEAL (Fast Encryption Algorithm) [12]. In Section 3.1 we formally define differential cryptanalysis and we give the main idea behind it. In Section 3.2 we introduce the important concept of the characteristic and in Section 3.3 we illustrate differential cryptanalysis by giving an example. 3.1 Differential Cryptanalysis The basic ....

A. Shimizu and S. Miyaguchi, "Fast Data Encryption Algorithm FEAL," Advances in Cryptology -- EUROCRYPT'87, VII 11--14, 1987.

....function, f , involves a key dependent involution followed by an involutionary permutation, f j = f(x i ; k j ) P (I(x i ; k j ) 63 the resulting function B : Sigma Theta K Sigma B = f r ffi f r Gamma1 ffi Delta Delta Delta ffi f 1 forms an involution cryptosystem. DES [58] FEAL [73] and LOKI [10] are all involution cryptosystems. Group and Involution Systems If the round function, f , involves a group function followed by an involutionary permutation, f j = f(x i ; k j ) I(G(x i ; k A j ) k B j ) the resulting function B : Sigma Theta K Sigma B = f r ffi f ....

A. Shimizu and S. Miyaguchi. Fast data encryption algorithm FEAL. In Advances in Cryptology - EUROCRYPT'87. Springer-Verlag, 1988.

....cryptography. In 1991 Merkle described the utility of software oriented cryptography and he proposed a suite of three software efficient algorithms [8] One of them, called Khufu, is a block cipher which is similar in spirit to SEAL. An earlier software oriented block cipher than Khufu is FEAL [18]. But this algorithm and its variants have not proven to be particularly secure (see [1] for history and attacks) Nor is it all that fast. RC4 is a popular, software efficient stream cipher designed by Rivest [13] It is fast, though less fast than SEAL. RC5 is a software efficient block cipher. ....

A. Shimizu and S. Miyaguchi, Fast data encryption algorithm FEAL, Advances in Cryptology --- Eurocrypt '87, Lecture Notes in Computer Science, Vol. 304, Springer-Verlag, 1987.

....The Weizmann Institute of Science Department of Applied Mathematics and Computer Science Rehovot 76100, Israel Abstract In [1,2] we introduced the notion of differential cryptanalysis based on chosen plaintext attacks. In [3,4] we described the application of differential cryptanalysis to Feal[12,11] and extended the method to known plaintext attacks. In this paper differential cryptanalysis methods are applied to the hash function Snefru[9] and to the cryptosystems Khafre[10] REDOC II[14,6] LOKI[5] and Lucifer[7] 1 Introduction The notion of differential cryptanalysis was introduced in ....

Akihiro Shimizu, Shoji Miyaguchi, Fast Data Encryption Algorithm FEAL, Lecture Notes in Computer Science, Advances in Cryptology, proceedings of EUROCRYPT'87, pp. 267--278, 1987.

....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. ....

Akihiro Shimizu, Shoji Miyaguchi, Fast Data Encryption Algorithm FEAL, Abstracts of EUROCRYPT'87, pp. VII-11--VII-14, April 1987.

....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 this paper. As a result, two new versions were added to the family: FealN [6] with any even number N of rounds, and ....

Akihiro Shimizu, Shoji Miyaguchi, Fast Data Encryption Algorithm FEAL, Lecture Notes in Computer Science, Advances in Cryptology, proceedings of EUROCRYPT'87, pp. 267--278, 1987.

....groups of five rounds of Rule A followed by five rounds of Rule B, followed by five Rule A and five Rule B rounds, etc, then it would have a 27 round impossible differential. We are aware of several impossible differentials of various blockciphers, such as a 9 round impossible differential of Feal [16, 13], 7 round impossible differential of DES [14] 20 round impossible differential of CAST 256 [1] 18 round impossible differential of Khufu [12] and 2.5 round impossible differential of IDEA [10] In a related paper [5] we use these impossible differentials to cryptanalyze IDEA with up to 4.5 ....

Akihiro Shimizu, Shoji Miyaguchi, Fast Data Encryption Algorithm FEAL, Lecture Notes in Computer Science, Advances in Cryptology, proceedings of EUROCRYPT '87, pp. 267--278, 1987.

....Feistel cipher using DES in the round function, and show that its security is smaller than expected. 1 Introduction Feistel ciphers are very common and well known. In particular, Feistel s construction is used in the Data Encryption Standard[8] Lucifer[12] and their many successors (such as Feal[11,7], GDES[10] and many others) This construction was studied from the theoretical point of view by Luby and Rackoff[4] who concluded that four rounds suffice to prove its security when the round function is random. Many suggested cryptosystems were designed with this construction, using another ....

Akihiro Shimizu, Shoji Miyaguchi, Fast Data Encryption Algorithm FEAL, Lecture Notes in Computer Science, Advances in Cryptology, proceedings of EUROCRYPT'87, pp. 267--278, 1987.

....cryptography. In 1991 Merkle described the utility of software oriented cryptography and he proposed a suite of three software efficient algorithms [8] One of them, called Khufu, is a block cipher which is similar in spirit to SEAL. An earlier software oriented block cipher than Khufu is FEAL [18]. But this algorithm and its variants have not proven to be particularly secure (see [2] for history and attacks) Nor is it all that fast. RC4 is a popular, software efficient stream cipher designed by Rivest [14] It is fast, though less fast than SEAL. RC5 is a software efficient block cipher. ....

A. Shimizu and S. Miyaguchi, Fast data encryption algorithm FEAL, Advances in Cryptology --- Eurocrypt '87, Lecture Notes in Computer Science, Vol. 304, Springer-Verlag, 1987.

....of Feal[20] called Feal 4, has four rounds. Feal 4 was broken by Den Boer[4] using a chosen plaintext attack with 100 10000 encryptions. The creators of Feal reacted by introducing a new version, called Feal 8, with eight rounds and additional XORs of the plaintext and the ciphertext with subkeys[19,14]. Both versions were described as cryptographically better than DES in several aspects. In this paper we describe a new kind of attack that can be applied to many DES like iterated cryptosystems. This is a chosen plaintext attack which uses only the resultant ciphertexts. The basic tool of the ....

Akihiro Shimizu, Shoji Miyaguchi, Fast Data Encryption Algorithm FEAL, Lecture Notes in Computer Science, Advances in Cryptology, proceedings of EUROCRYPT'87, pp. 267--278, 1987.

....by Matsui [34] was first tested on the DES. The experience with the analysis of the DES gave a valuable insight into design properties of cryptographic algorithms. Successors of the DES whose structure was based on Feistel permutation are amongst many Japanese Fast Encryption Algorithm (FEAL) [60] and the Australian LOKI algorithm [8] Cryptographic hashing became an important component of cryptographic primitives especially in the context of efficient generation of digital signatures. MD4 and its more secure version MD5 [50] are examples of the design which combines Feistel structure with ....

A. Shimizu and S. Miyaguchi. Fast data encryption algorithm feal. Abstracts of EUROCRYPT'87, Amsterdam, April 1987.

....dollars and which can find a DES key in about 3. 5 hours [20] In recent years, DES has also been subjected to two powerful attacks known as linear cryptanalysis [11] and differential cryptanalysis [4] Although these attacks have been very successful against many encryption algorithms such as FEAL [19] and Khafre [14] DES has been resistant, in a practical sense, to both attacks. Nonetheless, it seems inevitable that we need an alternative to DES which can be easily implemented in software, has a long enough key, a fast encryption decryption rate, and is resistant to known attacks. The CAST ....

A. Shimizu and S. Miyaguchi. Fast Data Encryption Algorithm FEAL. In Advances in Cryptology: Proceedings of EUROCRYPT '87, pages 267--278. Springer-Verlag, Berlin, 1988.

....groups of five rounds of Rule A followed by five rounds of Rule B, followed by five Rule A and five Rule B rounds, etc, then it would have a 27 round impossible differential. We are aware of several impossible differentials of various blockciphers, such as a 7 round impossible differential of Feal [15,13], 5 round impossible differential of DES [14] 20 round impossible differential of CAST 256 [1] 18 round impossible differential of Khufu [12] and 2.5 round impossible differential of IDEA [10] In a related paper [5] we use these impossible differentials to cryptanalyze IDEA with up to 4.5 ....

Akihiro Shimizu, Shoji Miyaguchi, Fast Data Encryption Algorithm FEAL, Lecture Notes in Computer Science, Advances in Cryptology, proceedings of EUROCRYPT'87, pp. 267--278, 1987.

....by triple DES (whose 168 bits of key were assumed to make it practically invulnerable) essentially the same attack can break it with essentially the same number of given ciphertexts. Differential Fault Analysis can break many additional secret key cryptosystems, including IDEA[9] RC5[19] and Feal[21,16,14,15]. Some ciphers, such as Khufu[13] Khafre[13] and Blowfish[20] compute their S boxes from the key material. In such ciphers, it may be even possible to extract the S boxes themselves, and the keys, using the techniques of Differential Fault Analysis. Differential Fault Analysis can also be applied ....

Akihiro Shimizu, Shoji Miyaguchi, Fast Data Encryption Algorithm FEAL, Lecture Notes in Computer Science, Advances in Cryptology, proceedings of EUROCRYPT'87, pp. 267--278, 1987. 14

No context found.

Akihiro Shimizu, Shoji Miyaguchi, Fast Data Encryption Algorithm FEAL, EUROCRYPT'87, pp. 267--278, 1987.

No context found.

Akihiro Shimizu, Shoji Miyaguchi, Fast Data Encryption Algorithm FEAL, Lecture Notes in Computer Science, Advances in Cryptology, proceedings of EUROCRYPT'87, pp. 267#278, 1987.

No context found.

Akihiro Shimizu, Shoji Miyaguchi, Fast Data Encryption Algorithm FEAL, Lecture Notes in Computer Science, Advances in Cryptology, proceedings of EUROCRYPT'87, pp. 267--278, 1987.

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