436 search results - page 53 / 88 » Ant algorithms and stigmergy |
158
click to vote
ANTS
2004
Springer
15 years 11 months ago
2004
Springer
In this paper we investigate the efficiency of the function field sieve to compute discrete logarithms in the finite fields F3n . Motivated by attacks on identity based encrypti...
144
click to vote
ANTS
1998
Springer
15 years 10 months ago
1998
Springer
We prove that to find a nontrivial integer linear relation between vectors of a lattice L IRn , whose euclidean length is at most M, one needs O n5+ (ln Mn/)1+ binary operations f...
131
click to vote
ANTS
1994
Springer
15 years 10 months ago
1994
Springer
In this paper we give some computational results on the multiplicative orders of optimal normal basis generators in F2n over F2 for n 1200 whenever the complete factorization of 2...
148
click to vote
ANTS
1994
Springer
15 years 10 months ago
1994
Springer
We study the complexity of expressing the greatest common divisor of n positive numbers as a linear combination of the numbers. We prove the NP-completeness of finding an optimal s...
403
click to vote
ANTS
2010
Springer
15 years 10 months ago
2010
Springer
: We establish a conjecture of Brizolis that for every prime p > 3 there is a primitive root r and an integer t in the interval [1, p − 1] with logr t = t. Here, logr is the d...