Hyper-bent multiple-valued functions

6Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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. © 2013 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Moraga, C., Stanković, M., Stanković, R. S., & Stojković, S. (2013). Hyper-bent multiple-valued functions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8112 LNCS, pp. 250–257). Springer Verlag. https://doi.org/10.1007/978-3-642-53862-9_32

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free