Abstract
Hyper-bent functions constitute a subset of bent functions and are harder to approximate than bent functions, making them particularly attractive for cryptographic applications. In the multiple-valued world, up to now, characterization and generation of hyper-bent functions represent an interesting challenging mathematical problem. We show that multiple-valued hyper-bent functions constitute a reduced subset of the multiple-valued bent functions and give a simple characterization lemma. Finally we introduce a new concept, that of strict hyper-bent functions, and study some of the properties of these functions. The only mathematical requirements of the paper are college algebra and a basic knowledge of Galois fields.
Work leading to this paper was partially supported by the Foundation for the Advancement of Soft Computing, Mieres, Asturias, Spain, and by the CICYT Spain, under project TIN 2011-29827-C02-01.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Cao, X.W., Hu, L.: A construction of hyperbent functions with polynomial trace form. Science China Mathematics 54(10), 2229–2234 (2011)
Carlet, C.: Boolean Functions for Cryptography and Error Correcting Codes, http://www.math.univ-paris13.fr/~carlet/chap/fcts-Bool-corr.pdf
Horn, R.A., Johnson, C.R.: Topics in Matrix Analysis. Cambridge University Press (1991)
Kumar, P.V., Scholz, R.A., Welch, L.R.: Generalized bent functions and their properties. Jr. Comb. Theory Series A 40(1), 90–107 (1985)
Luis, M., Moraga, C.: On functions with flat Chrestenson spectra. In: Proc. 19th Int. IEEE Symposium on Multiple-valued Logic, Guangzhou, China, May 29-31, pp. 406–413. IEEE-CS-Press (1989)
Moraga, C.: Spectral Techniques. The first decade of the XXI century. In: Proc. 40th Int. IEEE Symposium on Multiple-valued Logic, pp. 3–8. IEEE-CS-Press (2010)
Moraga, C.: Stanković, M., Stanković, R.S., Stojković, S.: On bent, strict bent, and hyper-bent multiple-valued functions. Research Report FSC-2012-03, European Centre for Soft Computing (2012)
Moraga, C., Stanković, M., Stanković, R.S., Stojković, S.: Contribution to the study of multiple-valued bent functions. In: Proc. 43rd Int. IEEE Symposium on Multiple-valued Logic, pp. 340–345. IEEE-CS-Press (2013)
Rothaus, O.S.: On “Bent” Functions. Jr. of Comb. Theory (A) 20, 300–305 (1976)
Stanković, S., Stanković, M., Astola, J.T.: Representation of multiple-valued bent functions using Vilenkin-Chrestenson decision diagrams. In: Proc. 41st Int. IEEE Symposium on Multiple-valued Logic, Tuusula, Finland, May 23-25, pp. 62–68. IEEE-CS-Press (2011)
Stanković, S., Stanković, R.S., Astola, J.T.: Remarks on shapes of decision diagrams and classes of multiple-valued functions. In: Proc. 42nd Int. IEEE Symp. on Multiple-valued Logic, Victoria, British Columbia, Canada, May 14-16, pp. 134–141. IEEE-CS-Press (2012)
Tokareva, N.: Generalizations of bent functions: A survey. Journal of Applied and Industrial Mathematics 5(1), 110–129 (2011)
Wang, B.: Tang Ch., Qi Y., Yang Y., Xu M.: A new class of Hyper-bent Boolean functions with multiple trace terms. Cryptology ePrint Archive, Report 2011/600 (2011), http://eprint.iacr.org/
Xiao, G.-Z., Moraga, C.: On the characterization of the Fourier Spectra of functions defined on an Abelian group. In: Proc. 19th Int. IEEE Symp. on Multiple-valued Logic, Guangzhou, China, May 29-31, pp. 400–405. IEEE-CS-Press (1989)
Youssef, A.M., Gong, G.: Hyper-bent Functions. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 406–419. Springer, Heidelberg (2001)
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
Moraga, C., Stanković, M., Stanković, R.S., Stojković, S. (2013). Hyper-bent Multiple-Valued Functions. In: Moreno-Díaz, R., Pichler, F., Quesada-Arencibia, A. (eds) Computer Aided Systems Theory - EUROCAST 2013. EUROCAST 2013. Lecture Notes in Computer Science, vol 8112. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-53862-9_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-53862-9_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-53861-2
Online ISBN: 978-3-642-53862-9
eBook Packages: Computer ScienceComputer Science (R0)