Moreover, motivated by the recent work of Costello and Hisil (ASIACRYPT 2017), which shows that there is only a moderate degradation in performance when evaluating large odd degree isogenies, we search for more general supersingular isogeny friendly moduli. Using graphics processing units to accelerate this search we find many such moduli which allow for faster implementations on embedded devices. By combining these two approaches we manage to make the modular reduction 1.5 times as fast on a 32-bit ARM platform.
Category / Keywords: public-key cryptography / Date: received 28 Aug 2018 Contact author: joppe bos at nxp com Available format(s): PDF | BibTeX Citation Version: 20180901:121733 (All versions of this report) Short URL: ia.cr/2018/792