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

Huseyin Hisil; Berkan Egrice; Mert Yassi

Paper 2020/388 Original: eprint.iacr.org/2020/388 ↗

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

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).

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Preprint.
History: 2020-04-09: last updated; 2020-04-09: published
Short URL: https://ia.cr/2020/388
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2020/388,
      author = {Huseyin Hisil and Berkan Egrice and Mert Yassi},
      title = {Fast 4 way vectorized ladder for the complete set of Montgomery curves},
      howpublished = {Cryptology {ePrint} Archive, Paper 2020/388},
      year = {2020},
      url = {https://eprint.iacr.org/2020/388}
}