Cryptology ePrint Archive: Report 2008/442

Fast Arithmetic on ATmega128 for Elliptic Curve Cryptography

Anton Kargl and Stefan Pyka and Hermann Seuschek

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.

Category / Keywords: implementation / Optimal Extension Field, Binary Fields, Embedded Security

Date: received 14 Oct 2008, last revised 21 Oct 2008

Contact author: anton kargl at siemens com

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20081021:062022 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]