CryptoDB
Fast Arithmetic on ATmega128 for Elliptic Curve Cryptography
Authors: | |
---|---|
Download: | |
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. |
BibTeX
@misc{eprint-2008-18103, title={Fast Arithmetic on ATmega128 for Elliptic Curve Cryptography}, booktitle={IACR Eprint archive}, keywords={implementation / Optimal Extension Field, Binary Fields, Embedded Security}, url={http://eprint.iacr.org/2008/442}, note={ anton.kargl@siemens.com 14173 received 14 Oct 2008, last revised 21 Oct 2008}, author={Anton Kargl and Stefan Pyka and Hermann Seuschek}, year=2008 }