Note: Generalized hyper-bent functions over GF(p)

Authors:
A. M. Youssef
Affiliations:
Concordia Institute for Information Systems Engineering, Concordia University, Montreal, QC, H3G 1M8, Canada
Venue:
Discrete Applied Mathematics
Year:
2007

Citing 7
Cited 1

A note on permutation polynomials and finite geometries

Discrete Mathematics
Nonlinearity criteria for cryptographic functions

EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Constructions of bent functions and difference sets

EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Finite fields

Finite fields
Constructing Symmetric Ciphers Using the CAST Design Procedure

Designs, Codes and Cryptography - Special issue: selected areas in cryptography I
Handbook of Applied Cryptography

Handbook of Applied Cryptography
Generating and counting binary bent sequences

IEEE Transactions on Information Theory

On quadratic approximations in block ciphers

Problems of Information Transmission

Quantified Score

Hi-index	0.04

Visualization

Abstract

In this paper, we extend the concept of binary hyper-bent functions introduced by Carlet to functions defined over GF(p). We show that such functions must be quadratic. We also provide the necessary and sufficient conditions on the symmetric coefficient matrix corresponding to the quadratic form of f:Z"p^n-Z"p that guarantee that f is a hyper-bent function.