63 search results - page 9 / 13 » Efficient Computation of Roots in Finite Fields |
IJNSEC
2010
13 years 2 months ago
2010
Most public key crypto systems use finite field modulo arithmetic. This modulo arithmetic is applied on real numbers, binary values and polynomial functions. The computation cost ...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
- In this paper we study efficient triangular grid-based sensor deployment planning for coverage when sensor placements are perturbed by random errors around their corresponding gr...
CRYPTO
1998
Springer
13 years 11 months ago
1998
Springer
The exponentiation function in a finite field of order p (a prime number) is believed to be a one-way function. It is well known that O(log log p) bits are simultaneously hard for ...
ICCV
1999
IEEE
14 years 9 months ago
1999
IEEE
The eikonal equation and variants of it are of significant interest for problems in computer vision and image processing. It is the basis for continuous versions of mathematical m...
ICS
2010
Tsinghua U.
14 years 4 months ago
2010
Tsinghua U.
: The generic problem of estimation and inference given a sequence of i.i.d. samples has been extensively studied in the statistics, property testing, and learning communities. A n...