Sciweavers

32 search results - page 4 / 7
» Faster Addition and Doubling on Elliptic Curves
Sort
View
CSREASAM
2006
13 years 8 months ago
Finding Minimum Optimal Path Securely Using Homomorphic Encryption Schemes in Computer Networks
- In this paper we find a secure routing protocol for computer networks, which finds minimum optimum path using homomorphic encryption schemes. We briefly look into the existing ho...
Levent Ertaul, Vaidehi Kedlaya
JCP
2007
127views more  JCP 2007»
13 years 7 months ago
Comparison of Simple Power Analysis Attack Resistant Algorithms for an Elliptic Curve Cryptosystem
Abstract— Side channel attacks such as Simple Power Analysis(SPA) attacks provide a new challenge for securing algorithms from an attacker. Algorithms for elliptic curve point sc...
Andrew Byrne, Nicolas Meloni, Arnaud Tisserand, Em...
TIT
2010
160views Education» more  TIT 2010»
13 years 2 months ago
Parameterized splitting systems for the discrete logarithm
Hoffstein and Silverman suggested the use of low Hamming weight product (LHWP) exponents to accelerate group exponentiation while maintaining the security level. With LHWP exponent...
Sungwook Kim, Jung Hee Cheon
PKC
2010
Springer
210views Cryptology» more  PKC 2010»
13 years 9 months ago
Efficient Arithmetic on Hessian Curves
This paper considers a generalized form for Hessian curves. The family of generalized Hessian curves covers more isomorphism classes of elliptic curves. Over a finite filed Fq, it ...
Reza Rezaeian Farashahi, Marc Joye
CHES
2004
Springer
182views Cryptology» more  CHES 2004»
14 years 22 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