Cryptology ePrint Archive: Report 2004/347
Addendum to ``On the Generalized Linear Equivalence of Functions over Finite Fields''
Abstract: In this paper we discuss the example of APN permutation introduced in the paper ``On the Generalized Linear Equivalence of Functions over Finite Fields'', presented at Asiacrypt 2004. We show that the permutation given there is indeed classically linearly equivalent to a power monomial. More in general, we show that no new class of APN functions can be discovered starting from permutation polynomials of the type used in the paper, and applied on the APN monomial $x^3$.
Category / Keywords: foundations / boolean functions, APN functions
Publication Info: Not published elsewhere
Date: received 6 Dec 2004, last revised 10 May 2005
Contact author: macchett at elet polimi it
Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation
Note: In this revised addendum we withdraw one claim of the original paper.
Version: 20050510:081449 (All versions of this report)
Short URL: ia.cr/2004/347
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]