Cryptology ePrint Archive: Report 2020/388

Fast 4 way vectorized ladder for the complete set of Montgomery curves

Huseyin Hisil and Berkan Egrice and Mert Yassi

Abstract: This paper introduces 4 way vectorization of Montgomery ladder on any Montgomery form elliptic curve. Our algorithm takes 2M^4+1S^4 (M^4: A vector of four field multiplications, S^4: A vector of four field squarings) per ladder step for variable-scalar variable-point multiplication. This paper also introduces new formulas for doing arithmetic over GF(2^255-19).

Category / Keywords: public-key cryptography / Montgomery ladder, elliptic curves, genus 1, Kummer lines, Diffie-Hellman key exchange, public key cryptography.

Date: received 5 Apr 2020, last revised 6 Apr 2020

Contact author: huseyin hisil at yasar edu tr

Available format(s): PDF | BibTeX Citation

Version: 20200409:124323 (All versions of this report)

Short URL: ia.cr/2020/388


[ Cryptology ePrint archive ]