Field Inversion and Point Halving Revisited

Field Inversion and Point Halving Revisited (2003)

by Kenny Fong , Darrel Hankerson , Julio Lopez , Alfred Menezes

Venue:	IEEE Transactions on Computers
Citations:	47 - 7 self

BibTeX

@ARTICLE{Fong03fieldinversion,
    author = {Kenny Fong and Darrel Hankerson and Julio Lopez and Alfred Menezes},
    title = {Field Inversion and Point Halving Revisited},
    journal = {IEEE Transactions on Computers},
    year = {2003},
    volume = {53},
    pages = {1047--1059}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

The focus of this technical report is implementation issues for three separate but related topics of interest in elliptic curve point arithmetic. The first concerns use of single-instruction multipledata (SIMD) capabilities to speed field multiplication and inversion.

Citations

124	Software implementation of elliptic curve cryptography over binary fields - Hankerson, Hernandez, et al. - 2000
47	Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms - Gallant, Lambert, et al. - 2001
44	A fast software implementation for arithmetic operation - Win, Bosselaers, et al.
36	On the performance of signature schemes based on elliptic curves - Win, Mister, et al. - 1998
28	Fast implementation of AES candidates - Aoki, Lipmaa
12	An energy efficient reconfigurable public-key cryptography processor architecture - Goodman, Chandrakasan - 2000
6	The Software Optimization Cookbook - Gerber - 2002
2	A software implementation of NIST P-224. The 5th Workshop on Elliptic Curve Cryptography (ECC - Bernstein - 2001
2	ECC Challenge, http://www.certicom.com/research/ecc challenge. html - Corporation - 2000