Sciweavers

57 search results - page 3 / 12
» Efficient Techniques for High-Speed Elliptic Curve Cryptogra...
Sort
View
ICISC
2004
99views Cryptology» more  ICISC 2004»
13 years 7 months ago
Fractional Windows Revisited: Improved Signed-Digit Representations for Efficient Exponentiation
Abstract. This paper extends results concerning efficient exponentiation in groups where inversion is easy (e.g. in elliptic curve cryptography). It examines the right-to-left and ...
Bodo Möller
IEICET
2008
147views more  IEICET 2008»
13 years 5 months ago
Computing the Ate Pairing on Elliptic Curves with Embedding Degree k = 9
For AES 128 security level there are several natural choices for pairing-friendly elliptic curves. In particular, as we will explain, one might choose curves with k = 9 or curves w...
Xibin Lin, Changan Zhao, Fangguo Zhang, Yanming Wa...
DCC
2006
IEEE
14 years 5 months ago
Trading Inversions for Multiplications in Elliptic Curve Cryptography
Recently, Eisentr?ager et al. proposed a very elegant method for speeding up scalar multiplication on elliptic curves. Their method relies on improved formulas for evaluating S = (...
Mathieu Ciet, Marc Joye, Kristin Lauter, Peter L. ...
EWSN
2008
Springer
14 years 5 months ago
NanoECC: Testing the Limits of Elliptic Curve Cryptography in Sensor Networks
Abstract. By using Elliptic Curve Cryptography (ECC), it has been recently shown that Public-Key Cryptography (PKC) is indeed feasible on resource-constrained nodes. This feasibili...
Piotr Szczechowiak, Leonardo B. Oliveira, Michael ...
IJNSEC
2008
135views more  IJNSEC 2008»
13 years 5 months ago
Software Implementations of Elliptic Curve Cryptography
Elliptic Curve Cryptography (ECC) is a promising alternative for public-key algorithms in resource-constrained systems because it provides a similar level of security with much sh...
Zhijie Jerry Shi, Hai Yun