Skip to main content
Log in

r-th order nonlinearity, correlation measure and least significant bit of the discrete logarithm

  • Published:
Cryptography and Communications Aims and scope Submit manuscript

Abstract

Each finite binary sequence (sh) is associated with a Boolean function B. The correlation measure of order k and the r-th order nonlinearity are figures of merit for the unpredictability of (sh) and B, respectively. We estimate the r-th order nonlinearity of B in terms of the correlation measure of order 2r of (sh). We apply our result to Boolean functions associated with the Legendre sequence, that is, the binary sequence describing the least significant bit of the discrete logarithms in the finite field \(\mathbb {F}_{p}\) of p elements, where p > 2 is a prime.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Brandstätter, N., Winterhof, A.: Nonlinearity of binary sequences with small autocorrelation. In: Proceedings of the Second International Workshop on Sequence Design and its Applications in Communications (IWSDA 05), pp 44–47 (2005)

  2. Carlet, C: Recursive lower bounds on the nonlinearity profile of Boolean functions and their applications. IEEE Trans. Inform. Theory 54, 1262–1272 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  3. Carlet, C.: On the higher order nonlinearities of Boolean functions and S-boxes, and their generalizations (invited paper). In: Sequences and their Applications—SETA 2008, 345–367, Lecture Notes in Comput. Sci. 5203. Springer, Berlin (2008)

  4. Carlet, C: Boolean functions. In: Handbook of Finite Fields. Discrete Mathematics and its Applications, pp 241–252. CRC Press, Boca Raton (2013)

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  7. Schmidt, K.-U.: Nonlinearity measures of random Boolean functions. Cryptogr. Commun. 8, 637–645 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  8. Shparlinski, I.: Cryptographic applications of analytic number theory. In: Complexity Lower Bounds and Pseudorandomness. Progress in Computer Science and Applied Logic, vol. 22. Birkhäuser, Basel (2003)

Download references

Acknowledgements

The authors are partially supported by the Austrian Science Fund FWF Projects F 5511-N26 which is part of the Special Research Program “Quasi-Monte Carlo Methods: Theory and Applications” and P 30405-N32. They also like to thank the anonymous referees for their very helpful comments.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Arne Winterhof.

Additional information

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Hofer, R., Winterhof, A. r-th order nonlinearity, correlation measure and least significant bit of the discrete logarithm. Cryptogr. Commun. 11, 993–997 (2019). https://doi.org/10.1007/s12095-018-0344-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12095-018-0344-z

Keywords

Mathematics Subject Classification (2010)

Navigation