## FOX: a New Family of Block Ciphers (2004)

Venue: | Selected Areas in Cryptography-SAC 2004,LNCS 2595 |

Citations: | 17 - 3 self |

### BibTeX

@INPROCEEDINGS{Junod04fox:a,

author = {Pascal Junod},

title = {FOX: a New Family of Block Ciphers},

booktitle = {Selected Areas in Cryptography-SAC 2004,LNCS 2595},

year = {2004},

pages = {131--146},

publisher = {Springer-Verlag}

}

### Years of Citing Articles

### OpenURL

### Abstract

In this paper, we describe the design of a new family of block cipher, named FOX and designed upon the request of MediaCrypt AG [23]. The main features ofthis design, besides a very high security level, are a large flexibility in terms of use

### Citations

193 | Cryptanalysis of block ciphers with over defined systems of equations
- Courtois, Pieprzyk
- 2002
(Show Context)
Citation Context ...g “simple” key-schedule algorithms (a nice illustration is certainly Muller’s attack [24] against Khazad), and, on the other hand, algebraic S-boxes are helpful to Courtois-Pieprzyk algebraic attacks =-=[8]-=-, and lead to puzzling properties as shown by [2, 10, 25]. In this paper, we describe the design of a new family of block cipher, named FOX and designed upon the request of MediaCrypt AG [23]. The mai... |

135 | Slide attacks
- Biryukov, Wagner
- 1999
(Show Context)
Citation Context ...of, like Knudsen’s truncated and higher-order differentials [16], impossible differentials [3], and Harpes’ partitioning cryptanalysis [11], for instance. Slide and Related-Key Attacks. Slide attacks =-=[6,7]-=- exploit periodic key-schedule algorithms, which is not a property of FOX’s key-schedule algorithms. Furthermore, due to very good diffusion and the high non-linearity of the key-schedule, related-key... |

107 | A.: Cryptanalysis of Skipjack Reduced to 31 Rounds Using Impossible Differentials
- Biham, Biryukov, et al.
- 1999
(Show Context)
Citation Context ...ial-linear cryptanalysis [4, 20], boomerang [32] and rectangle attacks [5]), as well as generalizations thereof, like Knudsen’s truncated and higher-order differentials [16], impossible differentials =-=[3]-=-, and Harpes’ partitioning cryptanalysis [11], for instance. Slide and Related-Key Attacks. Slide attacks [6,7] exploit periodic key-schedule algorithms, which is not a property of FOX’s key-schedule ... |

49 | The Rectangle Attack – Rectangling the Serpent
- Biham, Dunkelman, et al.
- 2001
(Show Context)
Citation Context ...rounds, we are strongly convinced that FOX will resist to known variants of linear and differential cryptanalysis (like differential-linear cryptanalysis [4, 20], boomerang [32] and rectangle attacks =-=[5]-=-), as well as generalizations thereof, like Knudsen’s truncated and higher-order differentials [16], impossible differentials [3], and Harpes’ partitioning cryptanalysis [11], for instance. Slide and ... |

48 | Advanced Slide Attacks
- Biryukov, Wagner
- 2000
(Show Context)
Citation Context ...of, like Knudsen’s truncated and higher-order differentials [16], impossible differentials [3], and Harpes’ partitioning cryptanalysis [11], for instance. Slide and Related-Key Attacks. Slide attacks =-=[6,7]-=- exploit periodic key-schedule algorithms, which is not a property of FOX’s key-schedule algorithms. Furthermore, due to very good diffusion and the high non-linearity of the key-schedule, related-key... |

26 | A simple algebraic representation of Rijndael
- Ferguson, Schroeppel, et al.
(Show Context)
Citation Context ...ration is certainly Muller’s attack [24] against Khazad), and, on the other hand, algebraic S-boxes are helpful to Courtois-Pieprzyk algebraic attacks [8], and lead to puzzling properties as shown by =-=[2, 10, 25]-=-. In this paper, we describe the design of a new family of block cipher, named FOX and designed upon the request of MediaCrypt AG [23]. The main features of this design, besides a very high security l... |

19 | Partitioning cryptanalysis
- Harpes, Massey
- 1997
(Show Context)
Citation Context ...[32] and rectangle attacks [5]), as well as generalizations thereof, like Knudsen’s truncated and higher-order differentials [16], impossible differentials [3], and Harpes’ partitioning cryptanalysis =-=[11]-=-, for instance. Slide and Related-Key Attacks. Slide attacks [6,7] exploit periodic key-schedule algorithms, which is not a property of FOX’s key-schedule algorithms. Furthermore, due to very good dif... |

15 | Enhancing differential-linear cryptanalysis
- Biham, Dunkelman, et al.
- 2001
(Show Context)
Citation Context ...e of the sbox mapping, and the high number of rounds, we are strongly convinced that FOX will resist to known variants of linear and differential cryptanalysis (like differential-linear cryptanalysis =-=[4, 20]-=-, boomerang [32] and rectangle attacks [5]), as well as generalizations thereof, like Knudsen’s truncated and higher-order differentials [16], impossible differentials [3], and Harpes’ partitioning cr... |

11 | E.: In how many ways can you write Rijndael
- Barken, Biham
- 2002
(Show Context)
Citation Context ...ration is certainly Muller’s attack [24] against Khazad), and, on the other hand, algebraic S-boxes are helpful to Courtois-Pieprzyk algebraic attacks [8], and lead to puzzling properties as shown by =-=[2, 10, 25]-=-. In this paper, we describe the design of a new family of block cipher, named FOX and designed upon the request of MediaCrypt AG [23]. The main features of this design, besides a very high security l... |

7 |
Cryptography and Data Security
- Feistel
- 1973
(Show Context)
Citation Context ... 2 (3ɛ + d(d − 1)(2g−1 + g−2 r )) ⌊ 3⌋ . Basically, the first result proves that the Lai-Massey scheme provides pseudorandomness on three rounds unless the fi’s are weak , like for the Feistel scheme =-=[9]-=-. Super-pseudorandomness corresponds to cases where a distinguisher can query chosen ciphertexts as well; in this scenario, the previous result holds when we consider Λ o (f ∗ 1 , . . . , f∗ 4 ) with ... |