The result is that the performance of hyperelliptic curves of genus 2 over prime fields is much closer to the performance of elliptic curves than previously thought. For groups of 192 and 256 bits the difference is about 18% and 15% respectively.
Category / Keywords: implementation / hyperelliptic curve cryptosystems, fast modular arithmetic Date: received 8 Dec 2003, last revised 17 Dec 2003 Contact author: mocenigo at exp-math uni-essen de Available format(s): PDF | BibTeX Citation Note: Newer version. Lazy and incomplete reduction applied to EC, too. This improves the average EC performance, but not the best. TIny changes in software library altered some performance data. Version: 20031217:140941 (All versions of this report) Short URL: ia.cr/2003/253 Discussion forum: Show discussion | Start new discussion