[Resource Topic] 2020/388: Fast 4 way vectorized ladder for the complete set of Montgomery curves

Welcome to the resource topic for 2020/388

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

Authors: Huseyin Hisil, Berkan Egrice, 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).

ePrint: https://eprint.iacr.org/2020/388

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 .