Sciweavers

105 search results - page 10 / 21
» Efficient elliptic curve exponentiation
Sort
View
WAIFI
2007
Springer
141views Mathematics» more  WAIFI 2007»
15 years 5 months ago
New Point Addition Formulae for ECC Applications
Abstract. In this paper we propose a new approach to point scalar multiplication on elliptic curves defined over fields of characteristic greater than 3. It is based on new point...
Nicolas Meloni
ASIACRYPT
2001
Springer
15 years 4 months ago
Speeding Up XTR
This paper describes several speedups and simplifications for XTR. The most important results are new XTR double and single exponentiation methods where the latter requires a chea...
Martijn Stam, Arjen K. Lenstra
EWSN
2008
Springer
15 years 11 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 ...
MASCOTS
2001
15 years 1 months ago
Performance of Finite Field Arithmetic in an Elliptic Curve Cryptosystem
As the Internet commerce becomes a more important part of the economy, network security is receiving more emphasis. Time spent in data encryption can be a significant performance ...
Zhi Li, John Higgins, Mark J. Clement
CMA
2010
183views more  CMA 2010»
14 years 8 months ago
Ramanujan's class invariants and their use in elliptic curve cryptography
Complex Multiplication (CM) method is a frequently used method for the generation of elliptic curves (ECs) over a prime field Fp. The most demanding and complex step of this metho...
Elisavet Konstantinou, Aristides Kontogeorgis