Paper 2016/1046

Efficient Finite field multiplication for isogeny based post quantum cryptography

Angshuman karmakar, Sujoy Sinha Roy, Frederik Vercauteren, and Ingrid Verbauwhede

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
Published elsewhere. Minor revision.International Workshop on the Arithmetic of Finite Fields-2016
Contact author(s)
angshuman karmakar @ esat kuleuven be
History
2016-11-07: received
Short URL
https://ia.cr/2016/1046
License
Creative Commons Attribution
CC BY

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},
      note = {\url{https://eprint.iacr.org/2016/1046}},
      url = {https://eprint.iacr.org/2016/1046}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.