604 search results - page 19 / 121 » Efficient Computation of Multiplicative Inverses for Cryptog... |
105
click to vote
CODES
2007
IEEE
14 years 11 months ago
2007
IEEE
In this paper, we propose an efficient technique for run-time application mapping onto Network-on-Chip (NoC) platforms with multiple voltage levels. Our technique consists of a re...
73
Voted
CVPR
2009
IEEE
15 years 1 months ago
2009
IEEE
Visual tracking is a key component in many computer vision applications. Linear subspace techniques (e.g. eigentracking) are one of the most popular approaches to align templates ...
109
click to vote
HASE
2008
IEEE
15 years 4 months ago
2008
IEEE
Due to the large number of attacks on open networks, information theft becomes a more and more severe problem. Secure computation can offer highly assured confidentiality protecti...
ACMSE
2006
ACM
15 years 1 months ago
2006
ACM
We introduce an efficient way of performing polynomial multiplication in a class of finite fields GF(pm ) in the frequency domain. The Fast Fourier Transform (FFT) based frequency...
ASIACRYPT
2010
Springer
14 years 7 months ago
2010
Springer
We introduce and formally define polynomial commitment schemes, and provide two efficient constructions. A polynomial commitment scheme allows a committer to commit to a polynomial...