Sciweavers

26 search results - page 4 / 6
» On Partial Lifting and the Elliptic Curve Discrete Logarithm...
Sort
View
PKC
2010
Springer
234views Cryptology» more  PKC 2010»
13 years 10 months ago
Solving a 676-Bit Discrete Logarithm Problem in GF(36n)
Abstract. Pairings on elliptic curves over finite fields are crucial for constructing various cryptographic schemes. The T pairing on supersingular curves over GF(3n ) is particula...
Takuya Hayashi, Naoyuki Shinohara, Lihua Wang, Shi...
IJNSEC
2011
78views more  IJNSEC 2011»
13 years 3 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...
EUROCRYPT
1999
Springer
14 years 25 days ago
On the Performance of Hyperelliptic Cryptosystems
In this paper we discuss various aspects of cryptosystems based on hyperelliptic curves. In particular we cover the implementation of the group law on such curves and how to genera...
Nigel P. Smart
CORR
2004
Springer
104views Education» more  CORR 2004»
13 years 8 months ago
Ramanujan Graphs and the Random Reducibility of Discrete Log on Isogenous Elliptic Curves
Cryptographic applications using an elliptic curve over a finite field filter curves for suitability using their order as the primary criterion: e.g. checking that their order has...
David Jao, Stephen D. Miller, Ramarathnam Venkates...
EUROCRYPT
2001
Springer
14 years 1 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