Paper 2016/1046 Original: eprint.iacr.org/2016/1046 ↗
Efficient Finite field multiplication for isogeny based post quantum cryptography
Abstract
Isogeny based post-quantum cryptography is one of the most recent addition to the family of quantum resistant cryptosystems. In this paper, we propose an efficient modular multiplication algorithm for primes of the form $p = 2 \cdot 2^a \cdot 3^b - 1$ with b even, typically used in such cryptosystem. Our modular multiplication algorithm exploits the special structure present in such primes. We compare the efficiency of our technique with Barrett reduction and Montgomery multiplication. Our C implementation shows that our algorithm is approximately 3 times faster than the normal Barrett reduction.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2016-11-07: last updated
- 2016-11-07: published
- Short URL
- https://ia.cr/2016/1046
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2016/1046,
author = {Angshuman karmakar and Sujoy Sinha Roy and Frederik Vercauteren and Ingrid Verbauwhede},
title = {Efficient Finite field multiplication for isogeny based post quantum cryptography},
howpublished = {Cryptology {ePrint} Archive, Paper 2016/1046},
year = {2016},
url = {https://eprint.iacr.org/2016/1046}
}