Sciweavers

79 search results - page 6 / 16
» Cryptosystems Based on Elliptic Curve Pairing
Sort
View
IACR
2011
120views more  IACR 2011»
12 years 7 months ago
Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
We present new candidates for quantum-resistant public-key cryptosystems based on the conjectured difficulty of finding isogenies between supersingular elliptic curves. The main t...
David Jao, Luca De Feo
CHES
2004
Springer
182views Cryptology» more  CHES 2004»
14 years 26 days ago
Pipelined Computation of Scalar Multiplication in Elliptic Curve Cryptosystems
In the current work we propose a pipelining scheme for implementing Elliptic Curve Cryptosystems (ECC). The scalar multiplication is the dominant operation in ECC. It is computed b...
Pradeep Kumar Mishra
TC
2011
13 years 1 months ago
Hybrid Binary-Ternary Number System for Elliptic Curve Cryptosystems
—Single and double scalar multiplications are the most computational intensive operations in elliptic curve based cryptosystems. Improving the performance of these operations is ...
Jithra Adikari, Vassil S. Dimitrov, Laurent Imbert
CORR
2010
Springer
192views Education» more  CORR 2010»
13 years 4 months ago
Constructing elliptic curve isogenies in quantum subexponential time
Given two elliptic curves over a finite field having the same cardinality and endomorphism ring, it is known that the curves admit an isogeny between them, but finding such an isog...
Andrew M. Childs, David Jao, Vladimir Soukharev
IJNSEC
2011
78views more  IJNSEC 2011»
13 years 2 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...