### A fuzzy commitment scheme with McEliece's cipher.

Skip to main content (access key 's'),
Skip to navigation (access key 'n'),
Accessibility information (access key '0')

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.

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...

Let $p$ be a prime number. In this paper we prove that the addition in $p$-ary without carry admits a recursive definition like in the already known cases $p=2$ and $p=3$.

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.

Dedicated to the memory of S.M. Dodunekov (1945–2012)Abstract. Geometric puncturing is a method to construct new codes. ACM Computing Classification System (1998): E.4.∗This research was partially supported by Grant-in-Aid for Scientific Research of Japan Society for the Promotion of Science under Contract Number 24540138.

The purpose of the present article is the study of duals of functional codes on algebraic surfaces. We give a direct geometrical description of them, using differentials. Even if this description is less trivial, it can be regarded as a natural extension to surfaces of the result asserting that the dual of a functional code ${C}_{L}(D,G)$ on a curve is the differential code ${C}_{\Omega}(D,G)$ . We study the parameters of such codes and state a lower bound for their minimum distance. Using this bound, one can study some examples...

In 1994, the well-known Diffie-Hellman key exchange protocol was for the first time implemented in a non-group based setting. Here, the underlying key space was the set of reduced principal ideals of a real quadratic number field. This set does not possess a group structure, but instead exhibits a so-called infrastructure. More recently, the scheme was extended to real quadratic congruence function fields, whose set of reduced principal ideals has a similar infrastructure. As always, the security...

For $a$ generator of the multiplicative group of the field $GF(p,k)$, the discrete logarithm of an element $b$ of the field to the base $a$, $b\ne 0$ is that integer $z:1\le z\le {p}^{k}-1$, $b={a}^{z}$. The $p$-ary digits which represent $z$ can be described with extremely simple polynomial forms.

A fractional differential controller for incommensurate fractional unified chaotic system is described and proved by using the Gershgorin circle theorem in this paper. Also, based on the idea of a nonlinear observer, a new method for generalized synchronization (GS) of this system is proposed. Furthermore, the GS technique is applied in secure communication (SC), and a chaotic masking system is designed. Finally, the proposed fractional differential controller, GS and chaotic masking scheme are...