A family of skew Hadamard difference sets

  • Authors:
  • Cunsheng Ding;Jin Yuan

  • Affiliations:
  • Department of Computer Science, The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong, China;Department of Computer Science, The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong, China

  • Venue:
  • Journal of Combinatorial Theory Series A
  • Year:
  • 2006

Quantified Score

Hi-index 0.12

Visualization

Abstract

In 1933 a family of skew Hadamard difference sets was described by Paley using matrix language and was called the Paley-Hadamard difference sets in the literature. During the last 70 years, no new skew Hadamard difference sets were found. It was conjectured that there are no further examples of skew Hadamard difference sets. This conjecture was proved to be true for the cyclic case in 1954, and further progress in favor of this conjecture was made in the past 50 years. However, the conjecture remains open until today. In this paper, we present a family of new perfect nonlinear (also called planar) functions, and construct a family of skew Hadamard difference sets using these perfect nonlinear functions. We show that some of the skew Hadamard difference sets presented in this paper are inequivalent to the Paley-Hadamard difference sets. These new examples of skew Hadamard difference sets discovered 70 years after the Paley construction disprove the longstanding conjecture on skew Hadamard difference sets. The class of new perfect nonlinear functions has applications in cryptography, coding theory, and combinatorics.