36 search results - page 3 / 8 » Montgomery Scalar Multiplication for Genus 2 Curves |
81
Voted
TC
2008
14 years 9 months ago
2008
A high performance architecture of elliptic curve scalar multiplication over finite field GF(2m ) is proposed. A pseudo-pipelined word serial finite field multiplier with word siz...
90
Voted
AAECC
2005
Springer
14 years 9 months ago
2005
Springer
The ideal class group of hyperelliptic curves can be used in cryptosystems based on the discrete logarithm problem. In this article we present explicit formulae to perform the gro...
AMC
2006
14 years 9 months ago
2006
The fast implementation of elliptic curve cryptosystems relies on the efficient computation of scalar multiplication. Based on the double-base chain representation of scalar using...
86
Voted
PKC
2004
Springer
15 years 2 months ago
2004
Springer
Let E be an elliptic curve defined over F2n . The inverse operation of point doubling, called point halving, can be done up to three times as fast as doubling. Some authors have t...
INDOCRYPT
2007
Springer
15 years 3 months ago
2007
Springer
This paper analyzes the best speeds that can be obtained for single-scalar multiplication with variable base point by combining a huge range of options: – many choices of coordin...