Skip to main content
SpringerLink
Log in

Efficient Computation of Balancedness in Binary Sequence Generators

  • Conference paper
String Processing and Information Retrieval (SPIRE 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3246))

Included in the following conference series:

  • 705 Accesses

Abstract

An algorithm to compute the exact degree of balancedness in the output sequence of a LFSR-based generator (either nonlinear filters or combination generators) has been developed.

Work supported by Ministerio de Ciencia y Tecnología (Spain) under grant TIC 2001-0586.

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

References

  1. Menezes, A.J., et al.: Handbook of Applied Cryptography. CRC Press, NY (1997)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Instituto de Ciencia de Materiales de Madrid, C.S.I.C., Cantoblanco., 28049, Madrid, Spain

    Pedro García-Mochales

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

    Amparo Fúster-Sabater

Authors
  1. Pedro García-Mochales
    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. Georgia Institute of Technology and Università di Padova,  

    Alberto Apostolico

  2. Department of Information Engineering, University of Padova,  

    Massimo Melucci

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

García-Mochales, P., Fúster-Sabater, A. (2004). Efficient Computation of Balancedness in Binary Sequence Generators. In: Apostolico, A., Melucci, M. (eds) String Processing and Information Retrieval. SPIRE 2004. Lecture Notes in Computer Science, vol 3246. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30213-1_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30213-1_38

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23210-0

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation