12 search results - page 3 / 3 » Special prime numbers and discrete logs in finite prime fiel... |
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...