80 search results - page 9 / 16 » Efficient Multivariate Factorization over Finite Fields |
EUROCRYPT
2006
Springer
13 years 11 months ago
2006
Springer
In this paper, we study the application of the function field sieve algorithm for computing discrete logarithms over finite fields of the form Fqn when q is a medium-sized prime po...
CHES
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. This paper presents a design-space exploration of an applicationspecific instruction-set processor (ASIP) for the computation of various cryptographic pairings over Barre...
EUROCRYPT
2000
Springer
13 years 11 months ago
2000
Springer
We present an index-calculus algorithm for the computation of discrete logarithms in the Jacobian of hyperelliptic curves defined over finite fields. The complexity predicts that i...
ISBRA
2007
Springer
14 years 1 months ago
2007
Springer
Characterized by simultaneous measurement of the effects of experimental factors and their interactions, the economic and efficient factorial design is well accepted in microarray ...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We consider matrix groups, specified by a list of generators, over finite fields. The two most basic questions about such groups are membership in and the order of the group. Even...