H. Feistel, W. Notz, and J. Smith, "Some Cryptographic Techniques for Machine to Machine Data Communications," Proceedings of the IEEE 63(11) pp. 1545-1554 (Nov. 1975).  Home/Search   Document Not in Database   Summary   Related Articles   Check

....property are effective in combining efficiency and good avalanche characteristics of the cipher. I. Introduction Private key block ciphers are typically implemented as a product cipher, using a number of rounds of substitutions and linear transformations. One such class of ciphers, introduced in [1] and referred to as DES like or Feistel ciphers, uses the general structure of the Data Encryption Standard (DES) 2] The concept of avalanche in block ciphers was informally introduced by Feistel [3] and Feistel, Notz, and Smith [1] as the property of a small number of bit changes in the ....

....transformations. One such class of ciphers, introduced in [1] and referred to as DES like or Feistel ciphers, uses the general structure of the Data Encryption Standard (DES) 2] The concept of avalanche in block ciphers was informally introduced by Feistel [3] and Feistel, Notz, and Smith [1], as the property of a small number of bit changes in the plaintext input leading to an avalanche of changes in subsequent rounds resulting in a large number of ciphertext bit changes. More precisely, in our analysis, we consider the following definition of the avalanche criterion [4] ....

H. Feistel and W.A. Notz and J.L. Smith, "Some cryptographic techniques for machine-tomachine data communications", Proceedings of the IEEE, vol. 63, no. 11, pp. 1545-1554, 1975.

....encryption methods take a block of data and the encryption key as inputs and create another block of the same size as ciphertext. The mapping is key dependent. The function that implements the mapping is generally called a cipher. Most of the symmetric encryption methods have a Fiestel structure [10]. The basic characteristic of this structure is that there is a repeated application of permutations and substitutions on the bits in the block. On each round of a Fiestel cipher, the block is divided into left and right parts. A key dependent round function is applied to the right part and the ....

FEISTEL, H., NOTZ, W., AND SMITH, L. Some cryptographic techniques for machineto -machine data communication. In Proceedings of the IEEE (1975), vol. 63(11), pp. 1545--1554.

....(where X and K are uniformly distributed and independent) That is, the probability over the key that a fixed input difference produces a fixed output difference is independent of the round input. It is easy to show that the SPN model we are using is a Markov cipher, as are certain Feistel ciphers [10], such as DES [8] Remark 1. The material in the remainder of Section 4 applies to any Markov cipher. Although we are dealing with LC, which ostensibly does not involve the Phi operation, the relevance of the Markov property given in (2) is via an interesting connection between linear ....

H. Feistel, W.A. Notz, and J.L. Smith, Some cryptographic techniques for machine to machine data communications, Proceedings of the IEEE, Vol. 63, No. 11, pp. 1545--1554, November 1975.

....property for every key. Kam and Davida proposed permutations for each round which produce a complete SPN after a minimum number of rounds (given complete s boxes) 3. 2 Avalanche and Strict Avalanche Feistel et al. defined a property of s boxes and SPNs known as the avalanche criterion (AVAL) [3, 4]. A function f : f0; 1g t f0; 1g t satisfies AVAL if whenever one input bit is changed, on average half the output bits change. In 1985, Webster and Tavares combined the completeness and avalanche properties into the strict avalanche criterion (SAC) 21] A function f : f0; 1g t f0; 1g ....

H. Feistel, W.A. Notz, and J.L. Smith, Some cryptographic techniques for machine to machine data communications, Proceedings of the IEEE, Vol. 63, No. 11, pp. 1545--1554, November 1975.

....key of 56 bits 5 . We give here only a simple presentation to make the paper self contained and the interested reader is referred to [1, 44] for more details. DES and many other similar symmetric cipher such as RC5 are built following a common architecture which is due to Feistel and his group [23]. After some initial preprocessing, the following operations are executed: 1. break the plaintext in two halves, 2. combine one half with the key using a clever function f , 3. XOR the combination with the other half 4. swap the two parts. The combination of these operations is called a ....

Horst Feistel, William Notz, and Lynn Smith. Some cryptographic techniques for machine-to-machine data communication. Proceedings of the IEEE, 63(11):1545--1554, 1975.

....To make the paper self contained, we sketch here the basic working of the Data Encryption Standard (DES) Further details can be found in [1, 24] DES is a block cipher, which encodes blocks of 64 bits using a key of 56 bits 2 . DES is built around a standard architecture called Feistel ciphers [14]: the basic intuition is to break the plaintext in two halves, combine one half with the key using a clever function and swap the two parts. These operations (which are called a round) are repeated a suitable number of times. A simple example of how DES works is presented in Fig. 1. 2 The key ....

H. Feistel, W. Notz, and L. Smith. Some cryptographic techniques for machineto -machine data communication. Proc. of the IEEE, 63(11):1545--1554, 1975.

....claimed that such an approach would not weaken the security of the SPN. This idea of using key dependent s boxes in an SPN forms the central theme of this thesis. 2.1. 2 Avalanche and Strict Avalanche Feistel et al. defined a property of s boxes and SPNs known as the avalanche criterion (AVAL) [6, 7]. A function f : f0; 1g t f0; 1g t satisfies AVAL if whenever one input bit is changed, on average half the output bits change. In 1985, Webster and Tavares combined the completeness and avalanche properties into the strict avalanche criterion (SAC) 28] A function f : f0; 1g t f0; 1g ....

H. Feistel, W.A. Notz, and J.L. Smith, Some cryptographic techniques for machine to machine data communications, Proceedings of the IEEE, Vol. 63, No. 11, pp. 1545--1554, November 1975.

....might now want to know how DES works, we start by saying that DES is a block cipher, which encipher blocks (sequences) of 64 bits into blocks of 64 bits using a key of 56 bits 1 . DES and almost all symmetric ciphers are built following an architecture which is due to Feistel and his group [Feistel et al. 1975] . After some initial preprocessing, the following operations are executed: 1. break the plaintext in two halves, 2. combine one half with the key using a clever function, 3. XOR the combination with the other half 4. swap the two parts. These 4 operations constitutes a round and are repeated ....

H. Feistel, W. Notz, and L. Smith. Some cryptographic techniques for machine-to-machine data communication. Proc. of the IEEE, 63(11):1545--1554, 1975.

....versions of the cipher. We feel we have met al..l of these goals in the design of Two sh. 3 Two sh Building Blocks 3.1 Feistel Networks A Feistel network is a general method of transforming any function (usually called the F function) into a permutation. It was invented by Horst Feistel [FNS75] in his design of Lucifer [Fei73] and popularized by DES [NBS77] It is the basis of most block ciphers published since then, including FEAL [SM88] GOST [GOST89] Khufu and Khafre [Mer91] LOKI [BPS90, BKPS93] CAST 128 [Ada97a] Blow sh [Sch94] and RC5 [Riv95] The fundamental building block ....

H. Feistel, W.A. Notz, and J.L. Smith, \Some Cryptographic Techniques for Machine-to-Machine Data Communications, Proceedings on the IEEE, v. 63, n. 11, 1975, pp. 1545-1554.

....versions of the cipher. We feel we have met al..l of these goals in the design of Twofish. 3 Twofish Building Blocks 3.1 Feistel Networks A Feistel network is a general method of transforming any function (usually called the F function) into a permutation. It was invented by Horst Feistel [FNS75] in his design of Lucifer [Fei73] and popularized by DES [NBS77] It is the basis of most block ciphers published since then, including FEAL [SM88] GOST [GOST89] Khufu and Khafre [Mer91] LOKI [BPS90, BKPS93] CAST 128 [Ada97a] Blowfish [Sch94] and RC5 [Riv95] The fundamental building block ....

H. Feistel, W.A. Notz, and J.L. Smith, "Some Cryptographic Techniques for Machine-to-Machine Data Communications, Proceedings on the IEEE, v. 63, n. 11, 1975, pp. 1545--1554.

....Avalanche Criterion (SAC) as originally defined in [15, 16] is the requirement that if any single input bit i is inverted, the probability that output bit j is inverted is 50 for all i, j. This criterion extends the property of completeness [8] and refines (quantifies) the idea of avalanche [4, 5, 8]. One can generalize this criterion in two ways, which leads to two possible definitions for higher order SAC. 5 Firstly, one can require that this property holds when multiple input bits are inverted simultaneously (i.e. i i i m 1 2 , for m 1) this is a new definition which ....

H. Feistel, W. Notz, and 1. L. Smith, Some Cryptographic Techniques for Machine-toMachine Data Communications, Proceedings of the IEEE, 63 (1975), pp. 1545-1554.

....Practical S Box Design Serge Mister, Carlisle Adams Nortel, P.O. Box 3511, Station C, Ottawa, Ontario, Canada, K1Y 4H7 cf744 freenet.carleton.ca, cadams nortel.ca 1. Introduction Much of the security of a block cipher based on the Feistel network [8, 9] depends on the properties of the substitution boxes (s boxes) used in the round function. Although many desirable properties have been studied, relatively little work has been done to determine to what degree these properties are achievable in practice. This paper presents one effort to construct ....

H. Feistel, W. Notz, and J. L. Smith, Some Cryptographic Techniques for Machine-to-Machine Data Communications, Proceedings of the IEEE, 63 (1975), pp. 1545-1554.

....versions of the cipher. We feel we have met al..l of these goals in the design of Twofish. 3 Twofish Building Blocks 3.1 Feistel Networks A Feistel network is a general method of transforming any function (usually called the F function) into a permutation. It was invented by Horst Feistel [FNS75] in his design of Lucifer [Fei73] and popularized by DES [NBS77] It is the basis of most block ciphers published since then, including FEAL [SM88] GOST [GOST89] Khufu and Khafre [Mer91] LOKI [BPS90, BKPS93] CAST 128 [Ada97a] Blowfish [Sch94] and RC5 [Riv95] The fundamental building block ....

H. Feistel, W.A. Notz, and J.L. Smith, "Some Cryptographic Techniques for Machine-to-Machine Data Communications, Proceedings on the IEEE, v. 63, n. 11, 1975, pp. 1545--1554.

.... to be located in the F function of a Feistel structure or in some academic round transformation model such as so called substitution permutation (or transposition) networks [AdTa90,Oc93] These networks consist of the alternation of parallel Sboxes and bit permutations and were proposed in [Fe75,KaDa79]. The S boxes are considered to be the active elements in the cipher and must be designed to eliminate low weight trails. In practice this requirement is translated to criteria for S boxes, such as maximum input output correlation, maximum prop ratio and diffusion criteria. These criteria impose ....

H. Feistel, W.A. Notz, and J.L. Smith, Some cryptographic techniques for machine-tomachine data communications, Proc. IEEE, Vol. 63, No. 11, 1975, pp. 1545-1554.

.... all cryptography amounts to substitution . A substitution S is simply a mapping that replaces one character sequence P , called a plaintext, by another character sequence C, called a ciphertext. The class of algorithms for substitutions we will examine in this paper are known as product ciphers [8, 9, 22]. This term was originally introduced by Shannon [22] who envisaged secure ciphers based on the successive iteration of two or more noncommutative operations. The idea is that product mappings are good candidates for mixing transformations, which have the property that structured subsets of the ....

H. Feistel, W. A. Notz, and J. Lynn Smith. Some cryptographic techniques for machine-to-machine data communications. proceedings of the IEEE, 63(11):1545-- 1554, 1975.

....ciphers, it is possible to design ciphers that are resistant to linear cryptanalysis. 3 Applications to cipher design In this section we will indicate how the results of the previous section, expressed concisely in Table 1, can be applied to the design of product ciphers such as Feistel ciphers [4, 5]. The basic approach in linear cryptanalysis is to determine a global linearization of the form ff 1 Delta P ff 2 Delta C = ff 3 Delta K (12) where P; C and K are the plaintext, ciphertext and key respectively. As indicated, if p is the probability of the linearization in (12) being true, ....

H. Feistel, W. A. Notz, and J. Lynn Smith. Some cryptographic techniques for machine-to-machine data communications. proceedings of the IEEE, 63(11):1545-- 1554, 1975.

....of excellent papers. 1. Motivations and Summary of Results Data Encryption Standard (DES) designed by IBM about fifteen years ago is the first modern (secrete key) block cipher whose algorithm is publicly available [NBS] It is a kind of product ciphers with Lucifer as its direct predecessor [FNS] [K] A little more specifically, both DES and Lucifer consist of 16 rounds of Feistel type transformations (FTT s) which are invented by and named (by us) after Feistel. From the beginning of DES, however, there had a lot of controversy about its security, and especially, about its design ....

H. Feistel, W.A. Notz and J.L. Smith: "Some cryptographic techniques for machine-to-machine data communications," Proceedings of IEEE, Vol. 63, No. 11, (1975), pp.1545-1554.

....[BS91] and linear cryptanalysis by Matsui [Mat93] the cryptographic strength of DES is being questioned by an increasing number of researchers as well as practitioners. Structurally DES can be viewed as being obtained by the iteration of a basic transform which was first proposed by Feistel [F73, FNS75] and will be also called a DES like transform in this paper. Toward the design of provably secure block ciphers: The security of a block cipher against differential cryptanalysis is characterized by the differential characteristic. If we design a block cipher secure against differential attack, ....

H. Feistel, W.A. Notz and J.L. Smith. Some cryptographic techniques for machine-to-machine data communications. in Proceedings of IEEE, Vol.63, No. 11, pp.1545-1554 (1975).

.... Key words: Feistel Network, diffusion, swapping scheme, complete F function INTRODUCTION A Feistel Network (FN) is a method for mixing the sub blocks of an input block in a cipher through repeated application of keyed, non linear F functions in order to generate a permutation of the input block [4, 8, 9]. In a standard FN the plaintext block is divided evenly into two sub blocks. The right subblock is fed into a key dependent F function. The left sub block is combined, via bitwise exclusive or (XOR) with the output of the F function. Afterwards, the two sub blocks are swapped (fig. 1(a) A ....

H. Feistel, W. A. Notz, J. L. Smith - "Some cryptographic techniques for machine-to-machine data communications" - Proceedings of the IEEE, 63 - 1975 - p. 1545-1554

.... Key words: Feistel Network, diffusion, swapping scheme, complete F function INTRODUCTION A Feistel Network (FN) is a method for mixing the sub blocks of an input block in a cipher through repeated application of keyed, non linear F functions in order to generate a permutation of the input block [4, 9, 10]. A round in a block cipher is a transformation which combines sub blocks of its input block through non linear, key dependent functions, called F functions (fig. 1(b) followed by a permutation of the sub blocks. In a standard FN the plaintext block is divided evenly into two sub blocks. The ....

H. Feistel, W. A. Notz, J. L. Smith - "Some cryptographic techniques for machine-to-machine data communications" - Proceedings of the IEEE, 63 - 1975 - p. 1545-1554

No context found.

H. Feistel, W. Notz, and J. Smith, "Some Cryptographic Techniques for Machine to Machine Data Communications," Proceedings of the IEEE 63(11) pp. 1545-1554 (Nov. 1975).

No context found.

Feistel, H.; Notz, W.; and Smith, L. 1975. Some cryptographic techniques for machine-to-machine data communication. Proc. of the IEEE 63(11):15451554.

No context found.

H. Feistel, W. A. Notz and J. L. Smith: "Some cryptographic techniques for machine-to-machine data communications," Proceedings of IEEE , Vol. 63, No. 11, (1975), pp.1545-1554.

No context found.

H. Feistel, W.A. Notz and J.L. Smith: "Some cryptographic techniques for machine-to-machine data communications," Proceedings of IEEE, Vol. 63, No. 11, (1975), pp.1545-1554.

No context found.

H. Feistel, W. A. Notz and J. L.Smith, `Some cryptographic techniques for machine to machine data communications', Proc. IEEE, 63, (11), 1545--1554 (1975).

First 50 documents

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