Authors: Moraga, Claudio
Stanković, Milena
Stanković, Radomir 
Stojković, Suzana
Title: Hyper-bent multiple-valued functions
Journal: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume: 8112 LNCS
Issue: PART 2
First page: 250
Last page: 257
Conference: 14th International Conference on Computer Aided Systems Theory, EUROCAST 2013; Las Palmas de Gran Canaria; Spain; 10 February 2013 through 15 February 2013
Issue Date: 1-Dec-2013
Rank: M33
ISBN: 978-3-642-53861-2
ISSN: 0302-9743
DOI: 10.1007/978-3-642-53862-9_32
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.
Keywords: bent-functions | hyper-bent functions | Multiple-valued functions | Vilenkin-Chrestenson transform
Publisher: Springer Link
CICYT Spain, Project TIN 2011-29827-C02-01

Show full item record


checked on May 20, 2024

Page view(s)

checked on May 9, 2024

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.