AAECC
2006
Springer
13 years 4 months ago
2006
Springer
Abstract. After some excitement generated by recently suggested public key exchange protocols due to Anshel-Anshel-Goldfeld and Ko-Lee et al., it is a prevalent opinion now that th...
AAECC
2006
Springer
13 years 4 months ago
2006
Springer
The conjugacy search problem in a group G is the problem of recovering an x G from given g G and h = x-1 gx. This problem is in the core of several recently suggested public key ...
AAECC
2006
Springer
13 years 4 months ago
2006
Springer
Several suggestions are presented for developing cryptosystems, both classical and public key, using a combination of combinatorial group theory and linear groups. In particular, t...
AAECC
2006
Springer
13 years 4 months ago
2006
Springer
The contribution of this paper is an effective proof of the well-foundedness of MPO, as a term of the Calculus of Inductive Constructions. This proof is direct, short and simple. ...
AAECC
2006
Springer
13 years 4 months ago
2006
Springer
AAECC
2006
Springer
13 years 4 months ago
2006
Springer
Abstract Besides equidistribution properties and statistical independence the lattice profile, a generalized version of Marsaglia's lattice test, provides another quality meas...
AAECC
2006
Springer
13 years 4 months ago
2006
Springer
So-called nonadjacent representations are commonly used in elliptic curve cryptography to facilitate computing a scalar multiple of a point on an elliptic curve. A nonadjacent rep...
AAECC
2006
Springer
13 years 4 months ago
2006
Springer
Cyclicity of a convolutional code (CC) is relying on a nontrivial automorphism of the algebra F[x]/(xn - 1), where F is a finite field. A particular choice of the data leads to th...
AAECC
2006
Springer
13 years 4 months ago
2006
Springer
A new framework for protection against key exposure was recently suggested by Dodis et. al. [16]. We take its realization further towards practice by presenting simple new schemes...
AAECC
2006
Springer
13 years 4 months ago
2006
Springer
We propose a slight modification of the Berlekamp-Massey Algorithm for obtaining the minimal polynomial of a given linearly recurrent sequence. Such a modification enables to expl...