You are looking at a specific version 20081021:062022 of this paper.
See the latest version.
Paper 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.
Metadata
- Available format(s)
- PDF PS
- Category
- Implementation
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- Optimal Extension FieldBinary FieldsEmbedded Security
- Contact author(s)
- anton kargl @ siemens com
- History
- 2008-10-21: revised
- 2008-10-20: received
- See all versions
- Short URL
- https://ia.cr/2008/442
- License
-
CC BY