Skip to main content

On the Strength of Simply-Iterated Feistel Ciphers with Whitening Keys

  • Conference paper
  • First Online:
Book cover Topics in Cryptology — CT-RSA 2001 (CT-RSA 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2020))

Included in the following conference series:

Abstract

Recent work by Biryukov andWagner on developing the slide attack technique has revealed it to be a powerful tool in the analysis of block cipher designs. In this paper the technique is used to analyze a particular construction of balanced Feistel block cipher that features identically keyed round functions but with independent pre- and post- whitening keys. It is shown that for an n-bit block size this class of cipher can be broken using n2n=2+1 chosen plaintexts in O(n2 n/2) time and space, and that this is irrespective of both the size of the key and the number of rounds of the algorithm. Comparisons are then drawn against the DESX and Even-Mansour constructions.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Biryukov, D. Wagner. Slide attacks. Proceedings of FSE’99, LNCS 1636, Springer-Verlag 1999.

    Google Scholar 

  2. A. Biryukov, D. Wagner. Advanced slide attacks. Proceedings of EUROCRYPT’2000, LNCS 1807, Springer-Verlag 2000.

    Google Scholar 

  3. J. Kilian, P. Rogaway. How to protect against exhaustive key search. Proceedings of CRYPTO’96, Springer-Verlag 1996.

    Google Scholar 

  4. P. Rogaway. The security of DESX. CryptoBytes, RSA Laboratories, summer 1996.

    Google Scholar 

  5. B. Schneier. Description of a new variable-length key 64-bit block cipher (Blow sh). Proceedings of FSE’94, LNCS 809, Springer-Verlag 1994.

    Google Scholar 

  6. S. Even, Y. Mansour. A construction of a cipher from a single pseudorandom permutation. Journal of Cryptology, Volume 10 Number 3, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Onions, P. (2001). On the Strength of Simply-Iterated Feistel Ciphers with Whitening Keys. In: Naccache, D. (eds) Topics in Cryptology — CT-RSA 2001. CT-RSA 2001. Lecture Notes in Computer Science, vol 2020. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45353-9_6

Download citation

  • DOI: https://doi.org/10.1007/3-540-45353-9_6

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41898-6

  • Online ISBN: 978-3-540-45353-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics