Skip to main content

Strengthening NLS Against Crossword Puzzle Attack

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 4586))

Abstract

NLS is a stream cipher proposal submitted to eSTREAM project. In SAC 2006 Cho and Pieprzyk presented a linear distinguishing attack called Crossword Puzzle attack on NLS where they have shown that the bias of the distinguisher is around O(2− 30). In this work we have proposed a new function modular Slash which is nonlinear in nature and strongly resistant against Linear Cryptanalysis. Replacing the modular addition in the nonlinear filter (NLF) of NLS we have shown that the Crossword puzzle attack presented by Cho and Pieprzyk can be prevented. In the modified NLS the bias of the linear distinguisher reduces to around O(2− 60). Also we have shown that the implementation cost of modular Slash, in terms of hardware and time delay, is less than modular addition. The proposed function could be an interesting alternative to modular addition, due to its better cryptographic properties and lesser implementation cost.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. eSTREAM project, http://www.ecrypt.eu.org/stream/

  2. Rose, G., Hawkes, P., Paddon, M., de Vries, M.W.: Primitive specification for nls. (April 2005), http://www.ecrypt.eu.org/stream/nls.html

  3. Cho, J.Y., Pieprzyk, J.: Crossword Puzzle Attack on NLS. In: SAC 2006 (2006)

    Google Scholar 

  4. Rothaus, O.S.: On “Bent” Functions. Journal of Combinatorial Theory 20(A), 300–305 (1976)

    MATH  Google Scholar 

  5. Macwilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North Holland (January 1983)

    Google Scholar 

  6. Matsui, M.: Linear Cryptanalysis method for DES cipher. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 386–397. Springer, Heidelberg (1994)

    Google Scholar 

  7. Golic, J.D.: Linear models for keystream generators. IEEE Transactions on Computers 45(1), 41–49 (1996)

    Article  MATH  Google Scholar 

  8. Uyemura, J.P.: Introduction to VLSI Circuits and Systems. John Wiley & Sons, New York (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Josef Pieprzyk Hossein Ghodosi Ed Dawson

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Bhattacharya, D., Mukhopadhyay, D., Saha, D., RoyChowdhury, D. (2007). Strengthening NLS Against Crossword Puzzle Attack. In: Pieprzyk, J., Ghodosi, H., Dawson, E. (eds) Information Security and Privacy. ACISP 2007. Lecture Notes in Computer Science, vol 4586. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73458-1_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-73458-1_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-73457-4

  • Online ISBN: 978-3-540-73458-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics