Welcome to the resource topic for 2016/1046
Title:
Efficient Finite field multiplication for isogeny based post quantum cryptography
Authors: Angshuman karmakar, Sujoy Sinha Roy, Frederik Vercauteren, 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.
ePrint: https://eprint.iacr.org/2016/1046
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 .