Welcome to the resource topic for 2008/442
Title:
Fast Arithmetic on ATmega128 for Elliptic Curve Cryptography
Authors: Anton Kargl, Stefan Pyka, 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.
ePrint: https://eprint.iacr.org/2008/442
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .