Please use this identifier to cite or link to this item:
Type: Artigo de periódico
Title: Field inversion and point halving revisited
Author: Fong, K
Hankerson, D
Lopez, J
Menezes, A
Abstract: We present a careful analysis of elliptic curve point multiplication methods that use the point halving technique of Knudsen and Schroeppel and compare these methods to traditional algorithms that use point doubling. The performance advantage of halving methods is clearest in the case of point multiplication kP, where P is not known in advance and smaller field inversion to multiplication ratios generally favor halving. Although halving essentially operates on affine coordinate representations, we adapt an algorithm of Knuth to allow efficient use of projective coordinates with halving-based windowing methods for point multiplication.
Subject: public key cryptosystems
computer arithmetic
Country: EUA
Editor: Ieee Computer Soc
Citation: Ieee Transactions On Computers. Ieee Computer Soc, v. 53, n. 8, n. 1047, n. 1059, 2004.
Rights: fechado
Identifier DOI: 10.1109/TC.2004.43
Date Issue: 2004
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File Description SizeFormat 
WOS000221906000009.pdf766.97 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.