561 search results - page 8 / 113 » Using number fields to compute logarithms in finite fields |
CORR
2008
Springer
13 years 8 months ago
2008
Springer
We present algorithms to perform modular polynomial multiplication or modular dot product efficiently in a single machine word. We pack polynomials into integers and perform sever...
STOC
2007
ACM
14 years 8 months ago
2007
ACM
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
DCC
2008
IEEE
14 years 8 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...
JSC
2006
13 years 8 months ago
2006
We describe our online database of finite extensions of Qp, and how it can be used to facilitate local analysis of number fields.
DCC
2008
IEEE
14 years 8 months ago
2008
IEEE
Some improved bounds on the number of directions not determined by a point set in the affine space AG(k, q) are presented. More precisely, if there are more than pe (q -1) directio...