97 search results - page 15 / 20 » Finding roots of polynomials over finite fields |
ALGORITHMICA
2006
14 years 11 months ago
2006
It has been suggested that a major obstacle in finding an index calculus attack on the elliptic curve discrete logarithm problem lies in the difficulty of lifting points from ellip...
HPCS
2009
IEEE
15 years 3 months ago
2009
IEEE
We report efficient implementation techniques for FFT-based dense multivariate polynomial arithmetic over finite fields, targeting multi-cores. We have extended a preliminary study...
102
click to vote
AUTOMATICA
2002
14 years 11 months ago
2002
This paper presents a series expansion for the evolution of a class of nonlinear systems characterized by constant input vector fields. We present a series expansion that can be c...
ASIACRYPT
2006
Springer
15 years 3 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...
105
Voted
MOC
2002
14 years 11 months ago
2002
Let Cl(OK [G]) denote the locally free class group, that is the group of stable isomorphism classes of locally free OK [G]-modules, where OK is the ring of algebraic integers in th...