Cryptology ePrint Archive: Report 2016/986

Fast Arithmetic Modulo $2^xp^y\pm 1$

Joppe W. Bos and Simon Friedberger

Abstract: We give a systematic overview of techniques to compute efficient arithmetic modulo $2^xp^y\pm 1$. This is useful for computations in the supersingular isogeny Diffie-Hellman (SIDH) key-exchange protocol which is one of the more recent contenders in the post-quantum public-key arena. One of the main computational bottlenecks in this key-exchange protocol is computing modular arithmetic in a finite field defined by a prime of this special shape.

Recent implementations already use this special prime shape to speed up the cryptographic implementations but it remains unclear if the choices made are optimal or if one can do better. Our overview shows that in the SIDH setting, where arithmetic over a quadratic extension field is required, the approaches based on Montgomery multiplication are to be preferred. Furthermore, the outcome of our search reveals that there exist moduli which result in even faster implementations.

Category / Keywords:

Date: received 12 Oct 2016, last revised 3 Nov 2016

Contact author: joppe bos at nxp com

Available format(s): PDF | BibTeX Citation

Version: 20161103:151327 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]