17 search results - page 1 / 4 » Euclid's algorithm and the Lanczos method over finite fields |
MOC
1998
13 years 11 months ago
1998
Abstract. This paper shows that there is a close relationship between the Euclidean algorithm for polynomials and the Lanczos method for solving sparse linear systems, especially w...
ASIACRYPT
2000
Springer
14 years 3 months ago
2000
Springer
The paper shows that some of elliptic curves over finite fields of characteristic three of composite degree are attacked by a more effective algorithm than Pollard’s ρ method...
ICCS
2004
Springer
14 years 4 months ago
2004
Springer
Air pollution models usually start from the computation of the velocity field of a fluid. In this paper, we present a model for computing that field based on the contribution of...
MOC
2000
13 years 11 months ago
2000
The first part of this paper classifies all purely cubic function fields over a finite field of characteristic not equal to 3. In the remainder, we describe a method for computing ...
ASIACRYPT
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. The complex multiplication (CM) method for genus 2 is currently the most efficient way of generating genus 2 hyperelliptic curves defined over large prime fields and suit...