Sciweavers

202 search results - page 4 / 41
» Hardware Factorization Based on Elliptic Curve Method
Sort
View
CTRSA
2003
Springer
130views Cryptology» more  CTRSA 2003»
14 years 1 months ago
Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation
We present an algorithm which speeds scalar multiplication on a general elliptic curve by an estimated 3.8% to 8.5% over the best known general methods when using affine coordinate...
Kirsten Eisenträger, Kristin Lauter, Peter L....
ICISC
2007
100views Cryptology» more  ICISC 2007»
13 years 10 months ago
Pairing-Friendly Elliptic Curves with Small Security Loss by Cheon's Algorithm
Pairing based cryptography is a new public key cryptographic scheme. An elliptic curve suitable for pairing based cryptography is called a “pairing-friendly” elliptic curve. Af...
Aya Comuta, Mitsuru Kawazoe, Tetsuya Takahashi
AMC
2007
184views more  AMC 2007»
13 years 8 months ago
Elliptic curve scalar multiplication algorithm using complementary recoding
Elliptic curve based cryptosystem is an efficient public key cryptosystem, which is more suitable for limited environments. The very expensive operation in elliptic curve based cr...
P. Balasubramaniam, E. Karthikeyan
TC
2010
13 years 3 months ago
Faster Interleaved Modular Multiplication Based on Barrett and Montgomery Reduction Methods
This paper proposes two improved interleaved modular multiplication algorithms based on Barrett and Montgomery modular reduction. The algorithms are simple and especially suitable ...
Miroslav Knezevic, Frederik Vercauteren, Ingrid Ve...
CRYPTO
1991
Springer
150views Cryptology» more  CRYPTO 1991»
14 years 2 days ago
CM-Curves with Good Cryptographic Properties
Our purpose is to describe elliptic curves with complex multiplication which in characteristic 2 have the following useful properties for constructing Diffie-HeUman type cryptosys...
Neal Koblitz