63 search results - page 8 / 13 » Efficient Computation of Roots in Finite Fields |
TCC
2009
Springer
14 years 8 months ago
2009
Springer
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...
CIS
2006
Springer
13 years 11 months ago
2006
Springer
Pairing-based cryptosystems (PBC) have been attracted by researchers in cryptography. Some implementations show that PBC are relatively slower than the standard public key cryptosy...
PKC
1998
Springer
13 years 11 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...
HPCS
2009
IEEE
13 years 11 months ago
2009
IEEE
We report efficient implementation techniques for FFT-based dense multivariate polynomial arithmetic over finite fields, targeting multi-cores. We have extended a preliminary study...
FECS
2006
13 years 9 months ago
2006
- The use of computational methods for solving partial differential equations in the field of Heat Transfer is crucial. However, the actual user friendly commercial applications, f...