Name
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. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/978-3-642-53862-9_32 | COMPUTER AIDED SYSTEMS THEORY, PT II |
Keywords | Field | DocType |
Multiple-valued functions, bent-functions, hyper-bent functions, Vilenkin-Chrestenson transform | Finite field,Algebra,Computer science,Cryptography,Bent molecular geometry,Theoretical computer science,Lemma (mathematics),Mathematical problem | Conference |
Volume | ISSN | Citations |
8112 | 0302-9743 | 1 |
PageRank | References | Authors |
0.43 | 7 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Claudio Moraga | 1 | 612 | 100.27 |
| Milena Stankovic | 2 | 29 | 9.22 |
| Radomir S. Stankovic | 3 | 188 | 47.07 |
| Suzana Stojković | 4 | 8 | 5.62 |