3890 search results - page 134 / 778 » Computation of unirational fields |
191
click to vote
ASIACRYPT
1999
Springer
15 years 11 months ago
1999
Springer
In the underlying finite field arithmetic of an elliptic curve cryptosystem, field multiplication is the next computational costly operation other than field inversion. We pres...
181
click to vote
SEAL
1998
Springer
15 years 11 months ago
1998
Springer
Most of the obstacle avoidance techniques do not consider the robot orientation or its nal angle at the target position. These techniques deal with the robot position only and are ...
163
click to vote
COMPGEOM
1997
ACM
15 years 11 months ago
1997
ACM
We consider the family of area bisectors of a polygon possibly with holes in the plane. We say that two bisectors of a polygon P are combinatorially distinct if they induce di e...
203
click to vote
ANTS
2010
Springer
15 years 11 months ago
2010
Springer
Lattices over number elds arise from a variety of sources in algorithmic algebra and more recently cryptography. Similar to the classical case of Z-lattices, the choice of a nice,...
184
click to vote
CANS
2006
Springer
15 years 10 months ago
2006
Springer
Pairings on elliptic curves have been used as cryptographic primitives for the development of new applications such as identity based schemes. For the practical applications, it is...