Paper 2018/723 Original: eprint.iacr.org/2018/723 ↗
Shorter Messages and Faster Post-Quantum Encryption with Round5 on Cortex M
Abstract
Round5 is a Public Key Encryption and Key Encapsulation Mechanism (KEM) based on General Learning with Rounding (GLWR), a lattice problem. We argue that the ring variant of GLWR is better suited for embedded targets than the more common RLWE (Ring Learning With Errors) due to significantly shorter keys and messages. Round5 incorporates GLWR with error correction, building on design features from NIST Post-Quantum Standardization candidates Round2 and Hila5. The proposal avoids Number Theoretic Transforms (NTT), allowing more flexibility in parameter selection and making it simpler to implement. We discuss implementation techniques of Round5 ring variants and compare them to other NIST PQC candidates on lightweight Cortex M4 platform. We show that the current development version of Round5 offers not only the shortest key and ciphertext sizes among Lattice-based candidates, but also has leading performance and implementation size characteristics.
Metadata
- Available format(s)
PDF- Category
- Implementation
- Publication info
- Preprint.
- History
- 2018-10-31: last updated
- 2018-08-03: published
- Short URL
- https://ia.cr/2018/723
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2018/723,
author = {Markku-Juhani O. Saarinen and Sauvik Bhattacharya and Oscar Garcia-Morchon and Ronald Rietman and Ludo Tolhuizen and Zhenfei Zhang},
title = {Shorter Messages and Faster Post-Quantum Encryption with Round5 on Cortex M},
howpublished = {Cryptology {ePrint} Archive, Paper 2018/723},
year = {2018},
url = {https://eprint.iacr.org/2018/723}
}