Sciweavers

79 search results - page 7 / 16
» Cryptosystems Based on Elliptic Curve Pairing
Sort
View
IJNSEC
2006
89views more  IJNSEC 2006»
13 years 7 months ago
Expansion of Sliding Window Method for Finding Shorter Addition/Subtraction-Chains
Finding a shorter addition/subtraction-chain for an integer is an important problem for many cryptographic systems based on number theory. Especially, execution time of multiplica...
Younho Lee, Heeyoul Kim, Seong-Min Hong, Hyunsoo Y...
CARDIS
2000
Springer
124views Hardware» more  CARDIS 2000»
13 years 12 months ago
Elliptic Curve Cryptography on Smart Cards without Coprocessors
Abstract This contribution describes how an elliptic curve cryptosystem can be implemented on very low cost microprocessors with reasonable performance. We focus in this paper on t...
Adam D. Woodbury, Daniel V. Bailey, Christof Paar
ALGORITHMICA
2006
149views more  ALGORITHMICA 2006»
13 years 7 months ago
Partial Lifting and the Elliptic Curve Discrete Logarithm Problem
It has been suggested that a major obstacle in finding an index calculus attack on the elliptic curve discrete logarithm problem lies in the difficulty of lifting points from ellip...
Qi Cheng, Ming-Deh A. Huang
PAIRING
2009
Springer
124views Cryptology» more  PAIRING 2009»
14 years 2 months ago
Fast Hashing to G2 on Pairing-Friendly Curves
When using pairing-friendly ordinary elliptic curves over prime fields to implement identity-based protocols, there is often a need to hash identities to points on one or both of ...
Michael Scott, Naomi Benger, Manuel Charlemagne, L...
ASIACRYPT
2001
Springer
13 years 11 months ago
Self-Blindable Credential Certificates from the Weil Pairing
Abstract. We describe two simple, efficient and effective credential pseudonymous certificate systems, which also support anonymity without the need for a trusted third party. The ...
Eric R. Verheul