Sciweavers

202 search results - page 8 / 41
» Hardware Factorization Based on Elliptic Curve Method
Sort
View
MYCRYPT
2005
Springer
189views Cryptology» more  MYCRYPT 2005»
14 years 2 months ago
An Analysis of Double Base Number Systems and a Sublinear Scalar Multiplication Algorithm
In this paper we produce a practical and efficient algorithm to find a decomposition of type n = kˆ i=1 2si 3ti , si, ti ∈ N ∪ {0} with k ≤   c + o(1) ¡ log n log log n ....
Mathieu Ciet, Francesco Sica
PAIRING
2010
Springer
133views Cryptology» more  PAIRING 2010»
13 years 6 months ago
Pairing Computation on Elliptic Curves with Efficiently Computable Endomorphism and Small Embedding Degree
Scott uses an efficiently computable isomorphism in order to optimize pairing computation on a particular class of curves with embedding degree 2. He points out that pairing implem...
Sorina Ionica, Antoine Joux
ITCC
2005
IEEE
14 years 2 months ago
A Scalable and High Performance Elliptic Curve Processor with Resistance to Timing Attacks
This paper presents a high performance and scalable elliptic curve processor which is designed to be resistant against timing attacks. The point multiplication algorithm (double-a...
Alireza Hodjat, David Hwang, Ingrid Verbauwhede
ESAS
2006
Springer
13 years 10 months ago
Low-Cost Elliptic Curve Cryptography for Wireless Sensor Networks
This work describes a low-cost Public-Key Cryptography (PKC) based solution for security services such as key-distribution and authentication as required for wireless sensor networ...
Lejla Batina, Nele Mentens, Kazuo Sakiyama, Bart P...
CHES
2004
Springer
182views Cryptology» more  CHES 2004»
14 years 2 months 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