237 search results - page 11 / 48 » Algorithms for Exponentiation in Finite Fields |
111
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Recently, the problem of obtaining a short regular expression equivalent to a given finite automaton has been intensively investigated. Algorithms for converting finite automata to...
112
Voted
DAGSTUHL
2006
15 years 3 months ago
2006
In this paper we study a class of dynamical systems defined by Pfaffian maps. It is a sub-class of o-minimal dynamical systems which capture rich continuous dynamics and yet can be...
117
Voted
CORR
2008
Springer
15 years 1 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...
112
click to vote
FOCS
1998
IEEE
15 years 6 months ago
1998
IEEE
The properties of any system of k simultaneous equations in n variables over GF(q), are studied, with a particular emphasis on unsatisfiable systems. A general formula for the num...
149
click to vote
ASAP
2004
IEEE
15 years 5 months ago
2004
IEEE
Binary finite fields GF(2n ) are very commonly used in cryptography, particularly in publickey algorithms such as Elliptic Curve Cryptography (ECC). On word-oriented programmable ...