Skip to main content

Semi-bent Functions with Multiple Trace Terms and Hyperelliptic Curves

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 7533))

Abstract

Semi-bent functions with even number of variables are a class of important Boolean functions whose Hadamard transform takes three values. Semi-bent functions have been extensively studied due to their applications in cryptography and coding theory. In this paper we are interested in the property of semi-bentness of Boolean functions defined on the Galois field \({\mathbb F}_2^n\) (n even) with multiple trace terms obtained via Niho functions and two Dillon-like functions (the first one has been studied by the author and the second one has been studied very recently by Wang et al. using an approach introduced by the author). We subsequently give a connection between the property of semi-bentness and the number of rational points on some associated hyperelliptic curves. We use the hyperelliptic curve formalism to reduce the computational complexity in order to provide an efficient test of semi-bentness leading to substantial practical gain thanks to the current implementation of point counting over hyperelliptic curves.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Canteaut, A., Carlet, C., Charpin, P., Fontaine, C.: On cryptographic properties of the cosets of R (1,m). IEEE Transactions on Information Theory 47, 1494–1513 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  2. Carlet, C., Mesnager, S.: On Semi-bent Boolean functions. IEEE Transactions on Information Theory 58(5), 3287–3292 (2012)

    Google Scholar 

  3. Charpin, P., Pasalic, E., Tavernier, C.: On bent and semi-bent quadratic Boolean functions. IEEE Transactions on Information Theory 51(12), 4286–4298 (2005)

    Google Scholar 

  4. Chee, S., Lee, S., Kim, K.: Semi-bent Functions. In: Safavi-Naini, R., Pieprzyk, J.P. (eds.) ASIACRYPT 1994. LNCS, vol. 917, pp. 107–118. Springer, Heidelberg (1995)

    Google Scholar 

  5. Cheon, J.H., Chee, S.: Elliptic Curves and Resilient Functions. In: Won, D. (ed.) ICISC 2000. LNCS, vol. 2015, pp. 64–397. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  6. Dobbertin, H., Leander, G., Canteaut, A., Carlet, C., Felke, P., Gaborit, P.: Construction of bent functions via Niho Power Functions. Journal of Combinatorial therory, Serie A 113, 779–798 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  7. Enge, A.: How to distinguish hyperelliptic curves in even characteristic. In: Public-Key Cryptography and Computational Number Theory. de Gruyter Proceedings in Mathematics. DE GRUYTER (2011)

    Google Scholar 

  8. Flori, J., Mesnager, S.: An efficient characterization of a family of hyperbent functions with multiple trace terms (in preprint)

    Google Scholar 

  9. Hubrechts, H.: Point counting in families of hyperelliptic curves in characteristic 2. LMS J. Comput. Math. 10, 207–234 (2007)

    MathSciNet  MATH  Google Scholar 

  10. Lisoněk, P.: An efficient characterization of a family of hyperbent functions. IEEE Transactions on Information Theory 57, 6010–6014 (2011)

    Article  Google Scholar 

  11. Matsui, M.: Linear Cryptanalysis Method for DES Cipher. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 386–397. Springer, Heidelberg (1994)

    Google Scholar 

  12. Meier, W., Staffelbach, O.: Fast Correlation Attacks on Stream Ciphers. In: Günther, C.G. (ed.) EUROCRYPT 1988. LNCS, vol. 330, pp. 301–314. Springer, Heidelberg (1988)

    Google Scholar 

  13. Mesnager, S.: Semi-bent functions from Dillon and Niho exponents, Kloosterman sums and Dickson polynomials. IEEE Transactions on Information Theory 57(11), 7443–7458 (2011)

    Article  MathSciNet  Google Scholar 

  14. Mesnager, S.: A new class of bent and hyper-bent Boolean functions in polynomial forms. Des. Codes Cryptography 59, 265–279 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  15. Mesnager, S.: Hyper-bent Boolean Functions with Multiple Trace Terms. In: Hasan, M.A., Helleseth, T. (eds.) WAIFI 2010. LNCS, vol. 6087, pp. 97–113. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  16. Rothaus, O.S.: On ”bent” functions. J. Combin.Theory Ser. A 20, 300–305 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  17. Sun, G., Wu, C.: Construction of Semi-Bent Boolean Functions in Even Number of Variables. Chinese Journal of Electronics 18(2) (2009)

    Google Scholar 

  18. Vercauteren, F.: Computing zeta functions of curves over finite fields. PhD thesis, Katholieke Universiteit Leuven (2003)

    Google Scholar 

  19. Wang, B., Tang, C., Qi, Y., Yang, Y., Xu, M.: A New Class of Hyper-bent Boolean Functions with Multiple Trace Terms. In: Cryptology ePrint Archive, Report 2011/600 (2011), http://eprint.iacr.org/

  20. Zheng, Y., Zhang, X.-M.: Plateaued Functions. In: Varadharajan, V., Mu, Y. (eds.) ICICS 1999. LNCS, vol. 1726, pp. 284–300. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mesnager, S. (2012). Semi-bent Functions with Multiple Trace Terms and Hyperelliptic Curves. In: Hevia, A., Neven, G. (eds) Progress in Cryptology – LATINCRYPT 2012. LATINCRYPT 2012. Lecture Notes in Computer Science, vol 7533. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33481-8_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33481-8_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33480-1

  • Online ISBN: 978-3-642-33481-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics