125 search results - page 12 / 25 » On the Performance of Hyperelliptic Cryptosystems |
FPL
2005
Springer
14 years 2 months ago
2005
Springer
The computational fundament of most public-key cryptosystems is the modular multiplication. Improving the efficiency of the modular multiplication is directly associated with the...
PKC
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Multi-computations in finite groups, such as multiexponentiations and multi-scalar multiplications, are very important in ElGamallike public key cryptosystems. Algorithm...
CTRSA
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. Exponentiation is a central process in many public-key cryptosystems such as RSA and DH. This paper introduces the concept of self-randomized exponentiation as an efficie...
AINA
2003
IEEE
14 years 1 months ago
2003
IEEE
The multiplications of common multiplicands and exponentiations of large integers with a large modulus are the primary computation operations in several well-known public key cryp...
RECONFIG
2008
IEEE
14 years 3 months ago
2008
IEEE
– We have implemented in FPGA recently published class of public key algorithms – MQQ, that are based on quasigroup string transformations. Our implementation achieves decrypti...