Skip to main content
SpringerLink
Log in

A Deterministic Approach to Balancedness and Run Quantification in Pseudorandom Pattern Generators

  • Conference paper
Advances in Informatics (PCI 2005)

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

Included in the following conference series:

  • 2020 Accesses

Abstract

An easy method of computing the number of 1’s and 0’s (balancedness) as well as the number of runs (run quantification) in the sequence obtained from a LFSR-based pseudorandom patter generator has been developed. The procedure is a deterministic alternative to the traditional application of statistical tests. The computation method allows one to check deviation of balancedness and run distribution goodness from standard values. As a straight consequence of the above procedure, simple rules to design pattern generators with adequate pseudorandomness properties are also derived.

Work supported by Ministerio de Educación y Ciencia (Spain) Projects 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. Fúster-Sabater, A., García-Mochales, P.: On the Balancedness of nonlinear generators of binary sequences. Information Processing Letters 85, 111–116 (2003)

    Article  MATH  MathSciNet  Google Scholar 

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

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

    Google Scholar 

  5. Grassman, W.K., Trembley, J.P.: Logic and Discrete Mathematics. Prentice-Hall, Englewood Cliffs (1996)

    MATH  Google Scholar 

  6. Klapper, A.: Large Families of Sequences with Near Optimal Correlations and Large Linear Span. IEEE Trans. on Information Theory 42, 1241–1248 (1996)

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  8. Meier, W., Staffelbach, O.: Nonlinearity criteria for cryptographic functions. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, pp. 549–562. Springer, Heidelberg (1990)

    Google Scholar 

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

    MATH  Google Scholar 

  10. Nelson, V.P., et al.: Digital Logic Circuit Analysis and Design. Prentice-Hall International, Englewood Cliffs (1995)

    Google Scholar 

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

    MATH  Google Scholar 

  12. Shparlinski, I.E.: On the Linear Complexity of the Power Generator, Design. Codes and Cryptography 23, 5–10 (2001)

    Article  MATH  MathSciNet  Google Scholar 

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

    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 Computer and Communication Engineering, University of Thessaly, Glavani 37, 382 21, Volos, Greece

    Panayiotis Bozanis

  2. Department of Computer and Communication Engineering, University of Thessaly, 382 21, Volos, Greece

    Elias N. Houstis

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 Deterministic Approach to Balancedness and Run Quantification in Pseudorandom Pattern Generators. In: Bozanis, P., Houstis, E.N. (eds) Advances in Informatics. PCI 2005. Lecture Notes in Computer Science, vol 3746. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11573036_66

Download citation

  • DOI: https://doi.org/10.1007/11573036_66

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29673-7

  • Online ISBN: 978-3-540-32091-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation