Skip to main content
SpringerLink
Log in

Construction of pseudorandom binary sequences using additive characters over GF(2k) II

  • Published:
Periodica Mathematica Hungarica Aims and scope Submit manuscript

Abstract

In a series of papers Mauduit and Sárközy introduced measures of pseudorandomness and they constructed large families of sequences with strong pseudorandom properties. In later papers the structure of families of binary sequences was also studied. In these constructions fields with prime order were used. Throughout this paper the structure of a family of binary sequences based on GF(2k) will be studied.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R. Ahlswede, L. Khachatrian, C. Mauduit and A. Sárközy, A complexity measure for families of binary sequences, Period. Math. Hungar., 46 (2003), 107–118.

    Article  MATH  MathSciNet  Google Scholar 

  2. Á. Andics, On the linear complexity of binary sequences, Ann. Univ. Sci. Budapest. Eötvös Sect. Math., 48 (2005), 173–180.

    MATH  MathSciNet  Google Scholar 

  3. N. Brandstätter and A. Winterhof, Linear complexity profile of binary sequences with small correlation measure, Period. Math. Hungar., 52 (2006), 1–8.

    Article  MATH  Google Scholar 

  4. J. Folláth, Construction of pseudorandom binary sequences using additive characters over GF(2k), Period. Math. Hungar., 57 (2008), 73–81.

    Article  MATH  MathSciNet  Google Scholar 

  5. L. Goubin, C. Mauduit and A. Sárközy, Construction of large families of pseudorandom binary sequences, J. Number Theory, 106 (2004), 56–69.

    Article  MATH  MathSciNet  Google Scholar 

  6. K. Gyarmati, Concatenation of pseudorandom binary sequences, Period. Math. Hungar., 58 (2009), 99–120.

    Article  MATH  MathSciNet  Google Scholar 

  7. J. Hoffstein and D. Lieman, The Distribution of the Quadratic Symbol in Function Fields and a Faster Mathematical Stream Cipher, Cryptography and Computational Number Theory, Progress in Computer Science and Applied Logic 20, Birkhäuser Verlag, 2001, 59–68.

  8. R. Lidl and H. Niederreiter, Finite Fields, Encyclopedia of Mathematics 20, Cambridge University Press, 1997.

  9. F. J. C. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, North-Holland Mathematical Library 16, North-Holland Publishing Company, 1977.

  10. C. Mauduit and A. Sárközy, On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol, Acta Arith., 82 (1997), 365–377.

    MATH  MathSciNet  Google Scholar 

  11. V. Tóth, Collision and avalanche effect in families of pseudorandom binary sequences, Period. Math. Hungar., 55 (2007), 185–196.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Informatics, University of Debrecen, Egyetem tér 1, H-4032, Debrecen, Hungary

    János Folláth

Authors
  1. János Folláth
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to János Folláth.

Additional information

Communicated by András Sárközy

The research was partially supported by the TARIPAR3 project (grant Nr. TECH 08-A2/2-2008-0086), the Hungarian-Slovakian project SK-8/2008 and the Hungarian-Croatian project HR-6/2008.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Folláth, J. Construction of pseudorandom binary sequences using additive characters over GF(2k) II. Period Math Hung 60, 127–135 (2010). https://doi.org/10.1007/s10998-010-2127-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10998-010-2127-y

Mathematics subject classification numbers

Key words and phrases

Search

Navigation