A Note on the Kasami Power Function

نویسنده

  • Doreen Hertel
چکیده

This work is motivated by the observation that the function F2m to F2m defined by x + (x + 1) + a for some a ∈ F2m can be used to construct difference sets. A desired condition is, that the functionφd(x) := x+(x+1) is a 2-to-1 mapping. If s = 1, then the function x has to be APN. If s > 1, then there is up to equivalence only one function known: The function φd is a 2-to-1 mapping if d is the Gold parameter d = 2 + 1 with gcd(k,m) = s. We show in this paper, that φd is also a 2-to-1 mapping if d is the Kasami parameter d = 2 −2 +1 with gcd(k,m) = s and m/s odd. We hope, that this observation can be used to construct more difference sets. key words: difference set, finite field, 2-to-1 mapping, APN, Kasami power function, Gold power function

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A class of quadratic APN binomials inequivalent to power functions

We exhibit an infinite class of almost perfect nonlinear quadratic binomials from F2n to F2n (n ≥ 12, n divisible by 3 but not by 9). We prove that these functions are EA-inequivalent to any power function and that they are CCZ-inequivalent to any Gold function and to any Kasami function. It means that for n even they are CCZ-inequivalent to any known APN function, and in particular for n = 12,...

متن کامل

Application of ANN Technique for Interconnected Power System Load Frequency Control (RESEARCH NOTE)

This paper describes an application of Artificial Neural Networks (ANN) to Load Frequency Control (LFC) of nonlinear power systems. Power systems, such as other industrial processes, have parametric uncertainties that for controller design had to take the uncertainties in to account. For this reason, in the design of LFC controller the idea of robust control theories are being used. To improve ...

متن کامل

Kasami Bent Functions are Not Equivalent to Their Duals

A difficult task in the theory of bent functions is to determine whether a bent function is equivalent to its dual bent function. In this paper we use certain results on the divisibility of Gauss Sums, mainly Stickelberger’s Theorem, to study monomial bent functions. We find the degree of the dual bent function of the Kasami function, which in general is different from the degree of the Kasami ...

متن کامل

On the (Fast) Algebraic Immunity of Boolean Power Functions

The (fast) algebraic immunity, including (standard) algebraic immunity and the resistance against fast algebraic attacks, has been considered as an important cryptographic property for Boolean functions used in stream ciphers. This paper is on the determination of the (fast) algebraic immunity of a special class of Boolean functions, called Boolean power functions. An n-variable Boolean power f...

متن کامل

Upper Bounds on Algebraic Immunity of Boolean Power Functions

Algebraic attacks have received a lot of attention in studying security of symmetric ciphers. The function used in a symmetric cipher should have high algebraic immunity (AI) to resist algebraic attacks. In this paper we are interested in finding AI of Boolean power functions. We give an upper bound on the AI of any Boolean power function and a formula to find its corresponding low degree multi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2005  شماره 

صفحات  -

تاریخ انتشار 2005