388 search results - page 13 / 78 » Bipartite Modular Multiplication |
95
Voted
ASIACRYPT
1999
Springer
15 years 3 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...
KI
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Imitation learning is an intuitive and easy way of programming robots. Instead of specifying motor commands, you simply show the robot what to do. This paper presents a m...
AIPS
2008
15 years 1 months ago
2008
This paper reports our experience extending an on-line printer controller based on AI planning to handle two significant features of this commercially important domain: execution ...
104
Voted
IJNSEC
2010
14 years 5 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 ...
ECAL
2007
Springer
15 years 5 months ago
2007
Springer
Symbiosis, the collaboration of multiple organisms from different species, is common in nature. A related phenomenon, symbiogenesis, the creation of new species through the genetic...