63 search results - page 3 / 13 » Efficient Computation of Roots in Finite Fields |
DCC
2008
IEEE
14 years 7 months ago
2008
IEEE
A system of algebraic equations over a finite field is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an unde...
ICISC
2004
13 years 8 months ago
2004
We consider the generation of prime order elliptic curves (ECs) over a prime field Fp using the Complex Multiplication (CM) method. A crucial step of this method is to compute the ...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
This paper analyzes the complexity of problems from class field theory. Class field theory can be used to show the existence of infinite families of number fields with constant ro...
ICCS
2007
Springer
13 years 11 months ago
2007
Springer
In this paper, we develop an efficient characteristic finite element method (FEM) for solving the magnetic induction equation in magnetohydrodynamics (MHD). We carry out numerical ...
MOC
2002
13 years 7 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...