New block cipher DONUT using pairwise perfect decorrelation (Q2707615)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1583951
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New block cipher DONUT using pairwise perfect decorrelation |
scientific article; zbMATH DE number 1583951 |
Statements
5 July 2001
0 references
decorrelation
0 references
differential cryptanalysis
0 references
linear cryptanalysis
0 references
block cipher
0 references
DONUT
0 references
boomerang attack
0 references
0.938812255859375
0 references
0.8321279883384705
0 references
0.7934712171554565
0 references
0.7898555397987366
0 references
0.7698610424995422
0 references
New block cipher DONUT using pairwise perfect decorrelation (English)
0 references
\textit{S. Vaudenay} [STACS'98, Lect. Notes Comput. Sci. 1373, 249-275 (1998; Zbl 0921.94012)] proposed a new way of protecting block ciphers against classes of attacks, which was based on the notion of decorrelation. He also suggested two block cipher families COCONUT and PEANUT. \textit{D. Wagner} [Lect. Notes Comput. Sci. 1636, 156-170 (1999; Zbl 0942.94022)] suggested a new differential-style attack called boomerang attack and cryptoanalysed COCONUT'98. In this paper we suggest a new block cipher called DONUT which is made by two pairwise perfect decorrelation modules. DONUT is secure against boomerang attack. For the entire collection see [Zbl 0952.00063].
0 references
