Another Proof of Kasami‘s Theorem

  • Authors:
  • Hans Dobbertin

  • Affiliations:
  • German Information Security Agency, P. O. Box 20 03 63, D-53133 Bonn, Germany

  • Venue:
  • Designs, Codes and Cryptography - Special issue on designs and codes—a memorial tribute to Ed Assmus
  • Year:
  • 1999

Quantified Score

Hi-index 0.14

Visualization

Abstract

We give a short direct prooffor a famous theorem published by Kasami in 1971. In terms ofWalsh analysis it states that for d = 2^{2k}-2^k+1the Walsh spectrum of the Boolean function \T(x^d)on \G{2^n} consists precisely of the three values 0,\pm 2^{(n+s)/2} if s = \gcd(k,n) = \gcd(2k,n).