Paper 2008/442

Fast Arithmetic on ATmega128 for Elliptic Curve Cryptography

Anton Kargl, 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
Creative Commons Attribution
CC BY

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},
      note = {\url{https://eprint.iacr.org/2008/442}},
      url = {https://eprint.iacr.org/2008/442}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.