Cryptology ePrint Archive: Report 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.

Category / Keywords: foundations / hyperbent functions, hyperelliptic curves, walsh-hadamard transform, cryptography

Date: received 10 Jul 2011, last revised 9 Jan 2012

Contact author: flori at enst fr

Available format(s): PDF | BibTeX Citation

Version: 20120109:103742 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]