125 search results - page 6 / 25 » On the Performance of Hyperelliptic Cryptosystems |
CTRSA
2006
Springer
14 years 9 days ago
2006
Springer
The most important and expensive operation in a hyperelliptic curve cryptosystem (HECC) is scalar multiplication by an integer k, i.e., computing an integer k times a divisor D on ...
IJBC
2006
13 years 8 months ago
2006
In recent years, a large amount of work on chaos-based cryptosystems have been published. However many of the proposed schemes fail to explain or do not possess a number of featur...
ASIACRYPT
1999
Springer
14 years 27 days 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...
DATE
2008
IEEE
14 years 3 months ago
2008
IEEE
Algebraic torus-based cryptosystems are an alternative for Public-Key Cryptography (PKC). It maintains the security of a larger group while the actual computations are performed i...
CARDIS
1998
Springer
14 years 26 days ago
1998
Springer
This paper intends to provide information about up-to-date performances of smart-card arithmetic coprocessors regarding major public-key cryptosystems and analyze the main tendence...