Paper 2008/442 Original: eprint.iacr.org/2008/442 ↗
Fast Arithmetic on ATmega128 for Elliptic Curve Cryptography
Abstract
Authentication protocols are indispensable in wireless sensor networks. Commonly they are based on asymmetric cryptographic algorithms. In this paper we investigate all categories of finite fields suitable for elliptic curve cryptography on the ATmega128 microcontroller: $\F{p}$, $\F{2^d}$, and $\F{p^d}$. It turns out that binary fields enable the most efficient implementations.
Metadata
- Available format(s)
PDF- Category
- Implementation
- Publication info
- Preprint.
- History
- 2008-10-21: last updated
- 2008-10-20: published
- Short URL
- https://ia.cr/2008/442
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2008/442,
author = {Anton Kargl and Stefan Pyka and Hermann Seuschek},
title = {Fast Arithmetic on ATmega128 for Elliptic Curve Cryptography},
howpublished = {Cryptology {ePrint} Archive, Paper 2008/442},
year = {2008},
url = {https://eprint.iacr.org/2008/442}
}