Paper 2011/373
An efficient characterization of a family of hyperbent functions with multiple trace terms
Jean-Pierre Flori and Sihem Mesnager
Abstract
Lisoněk recently reformulated the characterization of Charpin and Gong of a large class of hyperbent functions in terms of cardinalities of curves. In this note, we show that such a reformulation can be naturally extended to a distinct family of functions proposed by Mesnager. Doing so, a polynomial time and space test is obtained to test the hyperbentness of functions in this family. Finally we show how this reformulation can be transformed to obtain a more efficient test.
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- hyperbent functionshyperelliptic curveswalsh-hadamard transformcryptography
- Contact author(s)
- flori @ enst fr
- History
- 2012-01-09: last of 5 revisions
- 2011-07-11: received
- See all versions
- Short URL
- https://ia.cr/2011/373
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2011/373,
author = {Jean-Pierre Flori and Sihem Mesnager},
title = {An efficient characterization of a family of hyperbent functions with multiple trace terms},
howpublished = {Cryptology {ePrint} Archive, Paper 2011/373},
year = {2011},
url = {https://eprint.iacr.org/2011/373}
}
