88 search results - page 17 / 18 » Subquadratic-time factoring of polynomials over finite field... |
ICC
2007
IEEE
13 years 11 months ago
2007
IEEE
— The list decoding algorithm can outperform the conventional unique decoding algorithm by producing a list of candidate decoded messages. An efficient list decoding algorithm fo...
PKC
1998
Springer
13 years 8 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...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Matrices of integers modulo a small prime can be compressed by storing several entries into a single machine word. Modular addition is performed by addition and possibly subtracti...
TCC
2009
Springer
14 years 5 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...
JUCS
2008
13 years 5 months ago
2008
We present an algorithm that by using the and -1 Frobenius operators concurrently allows us to obtain a parallelized version of the classical -and-add scalar multiplication algor...