The connection between exponential sums and algebraic varieties has been known for at
least six decades. Recently, Lisoněk exploited it to reformulate the Charpin–Gong …

We present an efficient deterministic algorithm which outputs exact expressions in terms of n
for the number of monic degree n irreducible polynomials over F q of characteristic p for …

On classical Kloosterman sums | SpringerLink Skip to main content Advertisement SpringerLink
Log in Menu Find a journal Publish with us Search Cart 1.Home 2.Cryptography and …

Kloosterman sums have recently become the focus of much research, most notably due to
their applications in cryptography and their relations to coding theory. Very recently …

Kloosterman sums have recently become the focus of much research, most notably due to
their applications in cryptography and their relations to coding theory. Very recently …

In this note, the polar decomposition of binary fields of even extension degree is used to
reduce the evaluation of the Walsh transform of binomial Boolean functions to that of Gauss …

We study the divisibility by eight of exponential sums of several classes of functions over
finite fields of characteristic two. For the binary classical Kloosterman sums K (a) over such …

The first part is devoted to the study of a combinatorial conjecture whose validity entails the
existence of infinite classes of Boolean functions with good cryptographic properties …

On Kloosterman sums over finite fields of characteristic 3 - ScienceDirect Skip to main contentSkip
to article Elsevier logo Journals & Books Search RegisterSign in View PDF Download full issue …

For cryptographic protocols whose security relies on the difficulty of the discrete log problem
of the underlying group, one often wants to find a group whose order is divisible by a large …