## Aspects of Hyperelliptic Curves over Large Prime Fields in Software Implementations (2004)

### Cached

### Download Links

- [www.certification.tn]
- [eprint.iacr.org]
- [caccioppoli.mac.rub.de]
- DBLP

### Other Repositories/Bibliography

Citations: | 36 - 5 self |

### BibTeX

@INPROCEEDINGS{Avanzi04aspectsof,

author = {Roberto Maria Avanzi},

title = {Aspects of Hyperelliptic Curves over Large Prime Fields in Software Implementations},

booktitle = {},

year = {2004},

pages = {148--162},

publisher = {Springer-Verlag}

}

### OpenURL

### Abstract

Abstract. We present an implementation of elliptic curves and of hyperelliptic curves of genus 2 and 3 over prime fields. To achieve a fair comparison between the different types of groups, we developed an ad-hoc arithmetic library, designed to remove most of the overheads that penalize implementations of curve-based cryptography over prime fields. These overheads get worse for smaller fields, and thus for larger genera for a fixed group size. We also use techniques for delaying modular reductions to reduce the amount of modular reductions in the formulae for the group operations. 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 14 % and 15 % respectively.