Paper 2021/019
Kummer versus Montgomery Face-off over Prime Order Fields
Kaushik Nath and Palash Sarkar
Abstract
This paper makes a comprehensive comparison of the efficiencies of vectorized implementations of Kummer lines and Montgomery curves at various security levels. For the comparison, nine Kummer lines are considered, out of which eight are new, and new assembly implementations of all nine Kummer lines have been made. Seven previously proposed Montgomery curves are considered and new vectorized assembly implementations have been made for five of them. Our comparisons show that for all security levels, Kummer lines are consistently faster than Montgomery curves, though the speed-up gap is not much.
Note: Updated Table 6.
Metadata
- Available format(s)
-
PDF
- Category
- Implementation
- Publication info
- Preprint. MINOR revision.
- Keywords
- Kummer lineMontgomery curveDiffie-Hellman4-way vectorizationSIMD
- Contact author(s)
-
kaushikn_r @ isical ac in
palash @ isical ac in - History
- 2021-03-25: last of 3 revisions
- 2021-01-06: received
- See all versions
- Short URL
- https://ia.cr/2021/019
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2021/019,
author = {Kaushik Nath and Palash Sarkar},
title = {Kummer versus Montgomery Face-off over Prime Order Fields},
howpublished = {Cryptology ePrint Archive, Paper 2021/019},
year = {2021},
note = {\url{https://eprint.iacr.org/2021/019}},
url = {https://eprint.iacr.org/2021/019}
}
