Abstract
Vaudenay [1] 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. Wagner[2] suggested a new diffierential-style attack called boomerang attack and cryptanalysed COCONUT’98. In this paper we will suggest a new block cipher called DONUT which is made by two pairwise perfect decorrelation modules. DONUT is secure against boomerang attack.
This work is supported by Korea Information Security Agency(KISA) grant 2000-S-078.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. Vaudenay, Provably Security for Block Ciphers by Decorrelation, STACS’98, LNCS 1373, Springer-Verlag, 1998. 250, 250, 251, 252
D. Wagner, The boomerang attack, Fast Software Encryption, Springer-Verlag, 1999. 250, 250, 252, 253
E. Biham, A. Shamir, Differential cryptanalysis of DES-like cryptosystems, Advances in Cryptology-CRYPTO’90, LNCS 537, Springer-Verlag, 2–21, 1991. 250
E. Biham, A. Shamir, Differential cryptanalysis of DES-like cryptosystems, Journal of Cryptology, Vol. 4, 3–72, 1991. 250
M. Matsui, Linear cryptanalysis method for DES cipher, Advances in Cryptology-EUROCRYPT’93, LNCS 765, Springer-Verlag, 386–397, 1994. 250
L. Carter, M. Wegman, Universal classes of hash functions, Journal of Computer and System Science, Vol. 18, 143–154, 1979. 250
M. N. Wegman, J. L. Carter, New hash functions and their use in authentication and set equality, Journal of Computer and System Science, Vol. 22, 265–279, 1981. 250
S. Vaudenay, Feistel Ciphers with L 2 -Decorrelation, SAC’98, Springer-Verlag, 1998. 251
M. Luby, C. Rackoff, How to construct pseudorandom permutations from pseudorandom functions, SIAM Journal of Computing, Vol. 17, 373–386, 1988. 252
M. Naor, S. Reingold, On the Construction of Pseudo-Random Permutations: Luby-Racko. Revised, Journal of Cryptology, Vol. 12, 29–66, 1999. 252
K. Aoki and K. Ohta, Stict evaluation for the maximum average of differential probability and the maximem average of linear probability, IEICE Transcations fundamentals of Elections, Communications and Computer Sciences, No.1, 2–8, 1997.252
L. R. Knudsen, V. Rijmen, On the Decorrelated Fast Cipher (DFC) and Its Theory, Fast Software Encryption Workshop 99, 137–151, 1999. 252
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hyeon Cheon, D., Jin Lee, S., In Lim, J., Jae Lee, S. (2000). New Block Cipher DONUT Using Pairwise Perfect Decorrelation. In: Roy, B., Okamoto, E. (eds) Progress in Cryptology —INDOCRYPT 2000. INDOCRYPT 2000. Lecture Notes in Computer Science, vol 1977. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44495-5_23
Download citation
DOI: https://doi.org/10.1007/3-540-44495-5_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41452-0
Online ISBN: 978-3-540-44495-4
eBook Packages: Springer Book Archive