Skip to main content
SpringerLink
Log in

A Simple Acceptance/Rejection Criterium for Sequence Generators in Symmetric Cryptography

  • Conference paper
Computational Science and Its Applications – ICCSA 2005 (ICCSA 2005)

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

Included in the following conference series:

  • 1295 Accesses

Abstract

A simple method of checking the degree of balancedness in key-stream generators of cryptographic application has been developed. The procedure is based exclusively on the handling of bit-strings by means of logic operations and can be applied to standard generators proposed and published in the open literature (combinational generators, multiple clocking generators, irregularly clocked generators). The requirements of time and memory complexity are negligible. The method here developed is believed to be a first selective criterium for acceptance/rejection of this type of generators with application in symmetric cryptography.

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

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Bluetooth. Specifications of the Bluetooth system, Version 1.1 (February 2001), available at, http://www.bluetooth.com/

  2. 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 

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

  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)

    Google Scholar 

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

    MATH  Google Scholar 

  9. Rueppel, R.A.: Analysis and Design of Stream Ciphers. Springer, New York (1986)

    MATH  Google Scholar 

  10. Simmons, G.J. (ed.): Contemporary Cryptology: The Science of Information Integrity. IEEE Press, New York (1991)

    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. Instituto de Física Aplicada, C.S.I.C., Serrano 144, 28006, Madrid, Spain

    Amparo Fúster-Sabater

  2. DEIOC, University of La Laguna, 38271, La Laguna, Tenerife, Spain

    Pino Caballero-Gil

Authors
  1. Amparo Fúster-Sabater
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pino Caballero-Gil
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and Computer Science, University of Perugia, via Vanvitelli, 1, I-06123, Perugia, Italy

    Osvaldo Gervasi

  2. Department of Computer Science, University of Calgary, 2500 University Drive N.W., T2N 1N4, Calgary, AB, Canada

    Marina L. Gavrilova

  3. William Norris Professor, Head of the Computer Science and Engineering, Department University of Minnesota, USA

    Vipin Kumar

  4. Department of Chemistry, University of Perugia, Via Elce di Sotto, 8, I-06123, Perugia, Italy

    Antonio Laganà

  5. Institute of High Performance Computing, IHCP, 1 Science Park Road, 01-01 The Capricorn, Singapore Science Park II, 117528, Singapore

    Heow Pueh Lee

  6. School of Computing, Soongsil University, Seoul, Korea

    Youngsong Mun

  7. Clayton School of IT, Monash University, 3800, Clayton, Australia

    David Taniar

  8. OptimaNumerics Ltd, Belfast, United Kingdom

    Chih Jeng Kenneth Tan

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fúster-Sabater, A., Caballero-Gil, P. (2005). A Simple Acceptance/Rejection Criterium for Sequence Generators in Symmetric Cryptography. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2005. ICCSA 2005. Lecture Notes in Computer Science, vol 3482. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11424857_79

Download citation

  • DOI: https://doi.org/10.1007/11424857_79

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25862-9

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation