You are looking at a specific version 20200409:124323 of this paper.
See the latest version.
Paper 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).
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Preprint. MINOR revision.
- Keywords
- Montgomery ladderelliptic curvesgenus 1Kummer linesDiffie-Hellman key exchangepublic key cryptography.
- Contact author(s)
- huseyin hisil @ yasar edu tr
- History
- 2020-04-09: received
- Short URL
- https://ia.cr/2020/388
- License
-
CC BY
