561 search results - page 35 / 113 » Using number fields to compute logarithms in finite fields |
133
click to vote
STOC
2005
ACM
16 years 2 months ago
2005
ACM
We investigate constructions of pseudorandom generators that fool polynomial tests of degree d in m variables over finite fields F. Our main construction gives a generator with se...
151
click to vote
ARC
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. Financial applications are one of many fields where a multivariate Gaussian random number generator plays a key role in performing computationally extensive simulations. ...
114
click to vote
CHES
2000
Springer
15 years 6 months ago
2000
Springer
This work proposes a processor architecture for elliptic curves cryptosystems over fields GF(2m ). This is a scalable architecture in terms of area and speed that exploits the abil...
125
click to vote
MOC
2002
15 years 1 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...
129
click to vote
PKC
1998
Springer
15 years 5 months ago
1998
Springer
In this paper, we present two efficient algorithms computing scalar multiplications of a point in an elliptic curve defined over a small finite field, the Frobenius map of which ha...