A fuzzy commitment scheme with McEliece's cipher.
A large family of Boolean functions
In a series of papers many Boolean functions with good cryptographic properties were constructed using number-theoretic methods. We construct a large family of Boolean functions by using polynomials over finite fields, and study their cryptographic properties: maximum Fourier coefficient, nonlinearity, average sensitivity, sparsity, collision and avalanche effect.
A new approach to the ElGamal encryption scheme
The ElGamal encryption scheme can be used for both digital signatures and encryption, and its security results from the difficulty of calculating discrete logarithms in a finite field. This algorithm usually works in a multiplicative group of GF(p) and in this case the progress in the discrete logarithm problem forces the users of such a basic ElGamal public key cryptosystem to permanently increase a prime modulus p in order to ensure the desired security. But the task of finding a multiplicative...
A Polynomial Representation for Exponents in Zp
A recursive definition of -ary addition without carry
Let be a prime number. In this paper we prove that the addition in -ary without carry admits a recursive definition like in the already known cases and .
Almost primality of group orders of elliptic curves defined over small finite fields.
Approximation of the discrete logarithm in finite fields of even characteristic by real polynomials
We obtain lower bounds on degree and additive complexity of real polynomials approximating the discrete logarithm in finite fields of even characteristic. These bounds complement earlier results for finite fields of odd characteristic.