Another Proof of Kasami‘s Theorem
Designs, Codes and Cryptography - Special issue on designs and codes—a memorial tribute to Ed Assmus
Cartesian authentication codes from functions with optimal nonlinearity
Theoretical Computer Science
Journal of Complexity - Special issue on coding and cryptography
The Simplest Method for Constructing APN Polynomials EA-Inequivalent to Power Functions
WAIFI '07 Proceedings of the 1st international workshop on Arithmetic of Finite Fields
On Designs and Multiplier Groups Constructed from Almost Perfect Nonlinear Functions
Cryptography and Coding '09 Proceedings of the 12th IMA International Conference on Cryptography and Coding
Good expander graphs and expander codes: parameters and decoding
AAECC'03 Proceedings of the 15th international conference on Applied algebra, algebraic algorithms and error-correcting codes
On the covering radius of certain cyclic codes
AAECC'03 Proceedings of the 15th international conference on Applied algebra, algebraic algorithms and error-correcting codes
The weight distributions of cyclic codes with two zeros and zeta functions
Journal of Symbolic Computation
Functions of degree 4e that are not APN infinitely often
Cryptography and Communications
On highly nonlinear s-boxes and their inability to thwart DPA attacks
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
On systems of linear and diagonal equation of degree p i+1 over finite fields of characteristic p
Finite Fields and Their Applications
APN monomials over GF(2n ) for infinitely many n
Finite Fields and Their Applications
Hi-index | 0.00 |