Skip to main content

Attacking BEAR and LION Schemes in a Realistic Scenario

  • Conference paper
  • First Online:
Algebraic Informatics (CAI 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9270))

Included in the following conference series:

  • 562 Accesses

Abstract

BEAR and LION are block ciphers introduced by Biham and Anderson in 1996. Their special feature is that they use very efficiently a hash function and a stream cipher, so that the hardware implementation of BEAR and LION becomes straightforward, assuming that the two other primitives are already present. In this paper we discuss their security starting from the strength of their building blocks.

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. Anderson, R., Biham, E.: Two practical and provably secure block ciphers. In: Gollmann, D. (ed.) FSE 1996. LNCS, vol. 1039, pp. 113–120. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  2. Luby, M., Rackoff, C.: How to construct pseudorandom permutations from pseudorandom functions. SIAM J. Comput., 373–386 (1988)

    Google Scholar 

  3. Lucks, S.: Faster luby-rackoff ciphers. In: Gollmann, D. (ed.) FSE 1996. LNCS, vol. 1039, pp. 189–203. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  4. Lucks, S.: BEAST: A fast block cipher for arbitrary blocksizes. In: Proc. of IFIP, pp. 144–153 (1996)

    Google Scholar 

  5. Morin, P.: Provably secure and efficient block ciphers. In: Proc. of Selected Areas in Cryptography, pp. 30–37 (1996)

    Google Scholar 

  6. Maines, L., Piva, M., Rimoldi, A., Sala, M.: On the provable security of BEAR and LION schemes. Applicable Algebra in Engineering, Communication and Computing 22(5–6), 413–423 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  7. Preneel, B.: The state of cryptographic hash functions. In: Damgård, I.B. (ed.) LDS. LNCS, vol. 1561, pp. 158–182. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  8. Preneel, B., Rijmen, V., Knudsen, L.R.: Evaluation of ZUC. ABT Crypto. Tech. Report 7 (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Marco Pizzato .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Piva, M., Pizzato, M., Sala, M. (2015). Attacking BEAR and LION Schemes in a Realistic Scenario. In: Maletti, A. (eds) Algebraic Informatics. CAI 2015. Lecture Notes in Computer Science(), vol 9270. Springer, Cham. https://doi.org/10.1007/978-3-319-23021-4_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-23021-4_17

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-23020-7

  • Online ISBN: 978-3-319-23021-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics