Skip to main content
SpringerLink
Log in

Deterministic Analysis of Balancedness in Symmetric Cryptography

  • Conference paper
Computer and Information Sciences – ISCIS 2006 (ISCIS 2006)

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

Included in the following conference series:

Abstract

An efficient algorithm to compute the degree of balancedness in LFSR-based sequence generators has been developed. The computation is realized by means of logic operations on bit-strings. Emphasis is on the computational features of this algorithm. The procedure checks deviation of balancedness from standard values for this type of generators with application in symmetric cryptography.

Research supported by Ministerio de Educación y Ciencia (Spain) under grants SEG2004-04352-C04-03 and SEG2004-02418.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. Coppersmith, D., Krawczyk, H., Mansour, Y.: The Shrinking Generator. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 22–39. Springer, Heidelberg (1994)

    Google Scholar 

  2. CRYPTREC project- cryptographic evaluation for Japanese Electronic Government, www.ipa.go.jp/security/enc/CRYPTREC/index-e.html

  3. Fúster-Sabater, A., García-Mochales, P.: Aspects of pseudorandomness in nonlinear generators of binary sequences. Information Processing Letters 85, 111–116 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  4. Golomb, S.W.: Shift Register-Sequences. Aegean Park Press, Laguna Hill (1982)

    Google Scholar 

  5. GSM, Global Systems for Mobile Communications, available at http://cryptome.org/gsm-a512.htm

  6. Lidl, R., Niederreiter, H.: Introduction to Finite Fields and Their Applications. Cambridge University Press, Cambridge (1986)

    MATH  Google Scholar 

  7. Mange, D.: Analysis and Synthesis of Logic Systems. Artech House, Inc., Norwood (1986)

    MATH  Google Scholar 

  8. Menezes, A.J., et al.: Handbook of Applied Cryptography. CRC Press, New York (1997)

    MATH  Google Scholar 

  9. Rivest, R.L.: The RC4 Encryption Algorithm. RSA Data Security, Inc., March 12 (1992)

    Google Scholar 

  10. Rueppel, R.A.: Analysis and Design of Stream Ciphers. Springer, Heidelberg (1986)

    MATH  Google Scholar 

  11. Wang, L., Almani, A.E.: Fast conversion algorithm for very large Boolean functions. Electron. Lett. 36, 1370–1371 (2000)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Statistics, Operations Research and Computation, University of La Laguna, 38271, La Laguna, Tenerife, Spain

    Candelaria Hernández-Goya

  2. Instituto de Física Aplicada, C.S.I.C., Serrano 144, 28006, Madrid, Spain

    Amparo Fúster-Sabater

Authors
  1. Candelaria Hernández-Goya
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Amparo Fúster-Sabater
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Sabanci University, 34956, Istanbul, Turkey

    Albert Levi

  2. Sabancı University, Istanbul, Turkey

    Erkay Savaş  & Selim Balcısoy  & 

  3. Faculty of Engineering and Natural Sciences, Sabancı University, 34956, Tuzla, Istanbul, Turkey

    Hüsnü Yenigün

  4. Faculty of Engineering & Natural Sciences, Sabanci University, Istanbul, Turkey

    Yücel Saygın

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hernández-Goya, C., Fúster-Sabater, A. (2006). Deterministic Analysis of Balancedness in Symmetric Cryptography. In: Levi, A., Savaş, E., Yenigün, H., Balcısoy, S., Saygın, Y. (eds) Computer and Information Sciences – ISCIS 2006. ISCIS 2006. Lecture Notes in Computer Science, vol 4263. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11902140_105

Download citation

  • DOI: https://doi.org/10.1007/11902140_105

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-47242-1

  • Online ISBN: 978-3-540-47243-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation