Skip to main content
×
×
Home

On the nonlinearity of the sequence of signs of Kloosterman sums

  • Igor E. Shparlinski (a1)
Extract

It is known that Kloosterman sums with prime denominator p take real values, so one can define a sequence of signs of such sums. Several pseudorandom properties of this sequence have recently been studied by Fouvry, Michel, Rivat and Sárközy. Here we use one of their results to estimate a certain important characteristic of this sequence which is also of cryptographic interest.

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      On the nonlinearity of the sequence of signs of Kloosterman sums
      Available formats
      ×
      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your Dropbox account. Find out more about sending content to Dropbox.

      On the nonlinearity of the sequence of signs of Kloosterman sums
      Available formats
      ×
      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your Google Drive account. Find out more about sending content to Google Drive.

      On the nonlinearity of the sequence of signs of Kloosterman sums
      Available formats
      ×
Copyright
References
Hide All
[1]Bernasconi A., ‘On the complexity of balanced Boolean functions’, Inform. Process Lett. 70 (1999), 157163.
[2]Boppana R.B., ‘The average sensitivity of bounded-depth circuits’, Inform. Process Lett. 63 (1997), 257261.
[3]Carlet C., ‘On cryptographic complexity of Boolean functions’, in Finite Fields with Applications to Coding Theory, Cryptography and Related Areas (Springer-Verlag, Berlin, 2002), pp. 5369.
[4]Carlet C., ‘On the degree, nonlinearity, algebraic thickness, and nonnormality of Boolean functions, with developments on symmetric functions’, IEEE Trans. Inform. Theory 50 (2004), 21782185.
[5]Carlet C. and Ding C., ‘Highly nonlinear mappings’, J. Complexity 20 (2004), 205244.
[6]Carlet C. and Sarkar P., ‘Spectral domain analysis of correlation immune and resilient Boolean functions’, Finite Fields Appl. 8 (2002), 120130.
[7]Carlet C. and Tarannikov Y., ‘Covering sequences of Boolean functions and their cryptographic significance’, Des. Codes Cryptogr. 25 (2002), 263279.
[8]Fouvry É., Michel P., Rivat J. and Sárközy A., ‘On the pseudorandomness of the signs of Kloosterman sums’, J. Austral. Math. Soc. 77 (2004), 425436.
[9]Goldmann M., ‘Communication complexity and lower bounds for simulating threshold circuits’, in Theoretical Advances in Neural Computing and Learning (Kluwer Acad. Publ., Dordrecht, 1994), pp. 85125.
[10]Linial N., Mansour Y. and Nisan N., ‘Constant depth circuits, Fourier transform, and learnability’, J. Assoc. Comput. Mach. 40 (1993), 607620.
[11]Mansour Y., ‘Learning Boolean functions via the Fourier transform’, in Theoretical Advances in Neural Computing and Learning (Kluwer Academic Publ., Dordrecht, 1994), pp. 391424.
[12]Roychowdhry V., Siu K.-Y. and Orlitsky A., ‘Neural models and spectral methods’, in Theoretical Advances in Neural Computing and Learning (Kluwer Academic Publ., Dordrecht, 1994), pp. 336.
[13]Shparlinski I.E., Cryptographic applications of analytic number theory (Birkhäuser, Basel, 2003).
[14]Štanikǎ P., ‘Nonlinearity, local and global avalanche characteristics of balanced Boolean functions’, Discrete Math. 248 (2002), 181193.
[15]Zheng Y., and Zhang X.M., ‘Connections among nonlinearity, avalanche and correlation immunity’, Theoret. Comput. Sci. 292 (2003), 697710.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Bulletin of the Australian Mathematical Society
  • ISSN: 0004-9727
  • EISSN: 1755-1633
  • URL: /core/journals/bulletin-of-the-australian-mathematical-society
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×
MathJax

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 11 *
Loading metrics...

Abstract views

Total abstract views: 18 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 19th January 2018. This data will be updated every 24 hours.