Sciweavers

47 search results - page 4 / 10
» Testing Low-Degree Polynomials over Prime Fields
Sort
View
MOC
2000
94views more  MOC 2000»
13 years 7 months ago
Irreducibility testing over local fields
The purpose of this paper is to describe a method to determine whether a bivariate polynomial with rational coefficients is irreducible when regarded as an element in Q((x))[y], th...
P. G. Walsh
MOC
1998
98views more  MOC 1998»
13 years 7 months ago
Distribution of irreducible polynomials of small degrees over finite fields
D. Wan very recently proved an asymptotic version of a conjecture of Hansen and Mullen concerning the distribution of irreducible polynomials over finite fields. In this note we ...
Kie H. Ham, Gary L. Mullen
ICISC
2004
108views Cryptology» more  ICISC 2004»
13 years 8 months ago
Generating Prime Order Elliptic Curves: Difficulties and Efficiency Considerations
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 ...
Elisavet Konstantinou, Aristides Kontogeorgis, Yan...
JSC
2010
155views more  JSC 2010»
13 years 5 months ago
Algorithms for solving linear systems over cyclotomic fields
We consider the problem of solving a linear system Ax = b over a cyclotomic field. What makes cyclotomic fields of special interest is that we can easily find a prime p that sp...
Liang Chen, Michael B. Monagan