[Resource Topic] 2016/366: \(\mu\)Kummer: efficient hyperelliptic signatures and key exchange on microcontrollers

Welcome to the resource topic for 2016/366

Title:
(\mu)Kummer: efficient hyperelliptic signatures and key exchange on microcontrollers

Authors: Joost Renes, Peter Schwabe, Benjamin Smith, Lejla Batina

Abstract:

We describe the design and implementation of efficient signature and key-exchange schemes for the AVR~ATmega and ARM Cortex~M0 microcontrollers, targeting the 128-bit security level. Our algorithms are based on an efficient Montgomery ladder scalar multiplication on the Kummer surface of Gaudry and Schost’s genus-2 hyperelliptic curve, combined with the Jacobian point recovery technique of Chung, Costello, and Smith. Our results are the first to show the feasibility of software-only hyperelliptic cryptography on constrained platforms, and represent a significant improvement on the elliptic-curve state-of-the-art for both key exchange and signatures on these architectures. Notably, our key-exchange scalar-multiplication software runs in under 9520k cycles on the ATmega and under 2640k cycles on the Cortex M0, improving on the current speed records by 32% and 75% respectively.

ePrint: https://eprint.iacr.org/2016/366

Talk: https://www.youtube.com/watch?v=P-aEqqv0Vw8

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 .