Abstract
Although there are strong links between finite geometry and coding theory (it has been proved since the 1960’s that all these connections between the two areas are important from a theoretical point of view and for applications), the connections between finite geometry and cryptography remain little studied. In 2011, Carlet and Mesnager have showed that projective finite geometry can also be useful in constructing significant cryptographic primitives such as plateaued Boolean functions. Two important classes of plateaued Boolean functions are those of bent functions and of semi-bent functions, due to their algebraic and combinatorial properties. In this paper, we show that oval polynomials (which are closely related to the hyperovals of the projective plane) give rise to several new constructions of infinite classes of semi-bent Boolean functions in even dimension.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
Carlet, C.: On the secondary constructions of resilient and bent functions. In: Proceedings of the Workshop on Coding, Cryptography and Combinatorics 2003, pp. 3–28. Birkhäuser Verlag (2004)
Carlet, C., Mesnager, S.: On Dillon’s class H of bent functions, niho bent functions and O-polynomials. Journal of Combinatorial Theory, Series A 118(8), 2392–2410 (2011)
Carlet, C., Mesnager, S.: On Semi-bent Boolean Functions. IEEE Transactions on Information Theory-IT 58(5), 3287–3292 (2012)
Charpin, P., Pasalic, E., Tavernier, C.: On bent and semi-bent quadratic Boolean functions. IEEE Transactions on Information Theory 51(12), 4286–4298 (2005)
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)
Dillon, J.: Elementary Hadamard difference sets. In PhD dissertation, University of Maryland
Matsui, M.: Linear cryptanalysis method for DES cipher. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 386–397. Springer, Heidelberg (1994)
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)
Mesnager, S.: Semi-bent functions from Dillon and Niho exponents, Kloosterman sums and Dickson polynomials. IEEE Transactions on Information Theory-IT 57(11), 7443–7458 (2011)
Rothaus, O.S.: On “bent” functions. J. Combin. Theory Ser. A 20, 300–305 (1976)
Klein, A., Storme, L.: Applications of finite geometry in coding theory and cryptography. In: Information Security, Coding Theory and Related Combinatorics, pp. 38–58 (2011)
Dobbertin, H.: Almost Perfect Nonlinear power functions on GF (2n): The Welch case. IEEE Transactions on Information Theory 45(4), 1271–1275 (1999)
Mesnager, S.: Bent vectorial functions and linear codes from o-polynomials (preprint, 2013)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mesnager, S. (2013). Semi-bent Functions from Oval Polynomials. In: Stam, M. (eds) Cryptography and Coding. IMACC 2013. Lecture Notes in Computer Science, vol 8308. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45239-0_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-45239-0_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-45238-3
Online ISBN: 978-3-642-45239-0
eBook Packages: Computer ScienceComputer Science (R0)