New block cipher DONUT using pairwise perfect decorrelation

DOI10.1007/3-540-44495-5_23MaRDI QIDQ2707615zbMATH OpenFDO

Authors Donghyeon Cheon, Jong-In Lim, Sangjin Lee, Sung Jae Lee

Publication date 5 July 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44495-5_23

zbMATH Keywords

block cipherboomerang attackdecorrelationdifferential cryptanalysisDONUTlinear cryptanalysis

Mathematics Subject Classification ID

Cryptography (94A60)

Review text

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

Recommendations

• Difference distribution attack on DONUT and improved DONUT
• Provable security for block ciphers by decorrelation
• Decorrelation: a theory for block cipher security
• The boomerang attack
• Feistel ciphers with L₂-decorrelation

Cited in

(4)

• Difference distribution attack on DONUT and improved DONUT
• Provable security for block ciphers by decorrelation
• Revisiting iterated attacks in the context of decorrelation theory
• \textsf{MSX}: lightweight block ciphers for microcontrollers with high-assurance against differential and linear attacks

This page was built for publication: New block cipher DONUT using pairwise perfect decorrelation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2707615)