z-logo
open-access-imgOpen Access
Lightweight Post-quantum Key Encapsulation for 8-bit AVR Microcontrollers
Author(s) -
Hao Cheng,
Johann Großschädl,
Peter B. Rønne,
Peter Y. A. Ryan
Publication year - 2021
Publication title -
lecture notes in computer science
Language(s) - English
Resource type - Book series
SCImago Journal Rank - 0.249
H-Index - 400
eISSN - 1611-3349
pISSN - 0302-9743
DOI - 10.1007/978-3-030-68487-7_2
Subject(s) - computer science , key encapsulation , 8 bit , scalar multiplication , quantum computer , microcontroller , encapsulation (networking) , memory footprint , cryptosystem , arithmetic , embedded system , modular arithmetic , parallel computing , computer hardware , modular design , quantum , encryption , public key cryptography , operating system , symmetric key algorithm , computer network , scalar (mathematics) , mathematics , geometry , quantum mechanics , physics
Recent progress in quantum computing has increased interest in the question of how well the existing proposals for post-quantum cryptosystems are suited to replace RSA and ECC. While some aspects of this question have already been researched in detail (e.g. the relative computational cost of preand post-quantum algorithms), very little is known about the RAM footprint of the proposals and what execution time they can reach when low memory consumption rather than speed is the main optimization goal. This question is particularly important in the context of the Internet of Things (IoT) since many IoT devices are extremely constrained and possess only a few kB of RAM. We aim to contribute to answering this question by exploring the software design space of the lattice-based key-encapsulation scheme ThreeBears on an 8-bit AVR microcontroller. More concretely, we provide new techniques for the optimization of the ring arithmetic of ThreeBears (which is, in essence, a 3120-bit modular multiplication) to achieve either high speed or low RAM footprint, and we analyze in detail the trade-offs between these two metrics. A low-memory implementation of BabyBear that is secure against Chosen Plaintext Attacks (CPA) needs just about 1.7 kB RAM, which is significantly below the RAM footprint of other latticebased cryptosystems reported in the literature. Yet, the encapsulation time of this RAM-optimized BabyBear version is just about 12 million cycles, which is less than the execution time of a scalar multiplication on Curve25519. The decapsulation is more than four times faster and takes roughly 3.4 million cycles on an ATmega1284 microcontroller.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom