72 search results - page 4 / 15 » A Modular Method for Computing the Splitting Field of a Poly... |
IBPRIA
2007
Springer
13 years 10 months ago
2007
Springer
Three methods for the efficient downdating, composition and splitting of low rank singular value decompositions are proposed. They are formulated in a closed form, considering the ...
CMA
2010
13 years 3 months ago
2010
Complex Multiplication (CM) method is a frequently used method for the generation of elliptic curves (ECs) over a prime field Fp. The most demanding and complex step of this metho...
DCC
1999
IEEE
13 years 6 months ago
1999
IEEE
An important component of the index calculus methods for finding discrete logarithms is the acquisition of smooth polynomial relations. Gordon and McCurley (1992) developed a sieve...
ACMSE
2006
ACM
13 years 10 months ago
2006
ACM
We introduce an efficient way of performing polynomial multiplication in a class of finite fields GF(pm ) in the frequency domain. The Fast Fourier Transform (FFT) based frequency...
ISSAC
2009
Springer
14 years 25 days ago
2009
Springer
The computation of triangular decompositions involves two fundamental operations: polynomial GCDs modulo regular chains and regularity test modulo saturated ideals. We propose new...