36 search results - page 5 / 8 » A Binary Redundant Scalar Point Multiplication in Secure Ell... |
CTRSA
2006
Springer
13 years 11 months 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 ...
TC
2008
13 years 7 months ago
2008
RFID (Radio Frequency IDentification) tags need to include security functions, yet at the same time their resources are extremely limited. Moreover, to provide privacy, authenticat...
ACISP
2007
Springer
13 years 11 months ago
2007
Springer
This paper presents a new approach to precompute all odd points [3]P, [5]P, . . . , [2k - 1]P, k 2 on an elliptic curve over Fp. Those points are required for the efficient evalua...
JUCS
2008
13 years 7 months ago
2008
We present an algorithm that by using the and -1 Frobenius operators concurrently allows us to obtain a parallelized version of the classical -and-add scalar multiplication algor...
CTRSA
2004
Springer
14 years 1 months ago
2004
Springer
This paper presents a scalable hardware implementation of both commonly used public key cryptosystems, RSA and Elliptic Curve Cryptosystem (ECC) on the same platform. The introduce...