Sciweavers

53 search results - page 4 / 11
» Lifting Elliptic Curves and Solving the Elliptic Curve Discr...
Sort
View
EUROCRYPT
2001
Springer
13 years 10 months ago
Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems
Abstract. We show that finding an efficiently computable injective homomorphism from the XTR subgroup into the group of points over GF(p2 ) of a particular type of supersingular e...
Eric R. Verheul
INDOCRYPT
2007
Springer
14 years 12 days ago
Solving Discrete Logarithms from Partial Knowledge of the Key
Abstract. For elliptic curve based cryptosystems, the discrete logarithm problem must be hard to solve. But even when this is true from a mathematical point of view, side-channel a...
K. Gopalakrishnan, Nicolas Thériault, Chui ...
ASIACRYPT
2000
Springer
13 years 10 months ago
Trapdooring Discrete Logarithms on Elliptic Curves over Rings
This paper introduces three new probabilistic encryption schemes using elliptic curves over rings. The cryptosystems are based on three specific trapdoor mechanisms allowing the r...
Pascal Paillier
IJNSEC
2011
78views more  IJNSEC 2011»
13 years 1 months ago
Multi-authority Electronic Voting Scheme Based on Elliptic Curves
In this paper, a new multi authority electronic voting scheme based on elliptic curves is proposed. According to the proposed scheme, each voter casts the vote as a point on the e...
Chinniah Porkodi, Ramalingam Arumuganathan, Krishn...
AMC
2005
124views more  AMC 2005»
13 years 6 months ago
An efficient undeniable group-oriented signature scheme
Three main methods with favorable security and efficiency can be considered in the design of cryptosystems. These methods are integer factorization systems (of which RSA is the be...
Tzer-Shyong Chen, Jen-Yan Huang, Tzer-Long Chen