Faster Montgomery and double-add ladders for short Weierstrass curves
The Montgomery ladder and Joye ladder are well-known algorithms for elliptic curve scalar multiplication with a regular structure. The Montgomery ladder is best known for its implementation on Montgomery curves, which requires 5M+4S+1m+8A per scalar bit, and 6 field registers. Here (M, S,m,A) repre...
Main Author: | Mike Hamburg |
---|---|
Format: | Article |
Language: | English |
Published: |
Ruhr-Universität Bochum
2020-08-01
|
Series: | Transactions on Cryptographic Hardware and Embedded Systems |
Subjects: | |
Online Access: | https://tches.iacr.org/index.php/TCHES/article/view/8681 |
Similar Items
-
Speed-Oriented Architecture for Binary Field Point Multiplication on Elliptic Curves
by: Jiakun Li, et al.
Published: (2019-01-01) -
An Analog of the Lindemann-Weierstrass Theorem for the Weierstrass p-Function
by: Rivard-Cooke, Martin
Published: (2014) -
Innovative Dual-Binary-Field Architecture for Point Multiplication of Elliptic Curve Cryptography
by: Jiakun Li, et al.
Published: (2021-01-01) -
Low-Cost, Low-Power FPGA Implementation of ED25519 and CURVE25519 Point Multiplication
by: Mohamad Ali Mehrabi, et al.
Published: (2019-09-01) -
Refined Computations for Points of the Form 2kP Based on Montgomery Trick
by: HIRATA, Tomio, et al.
Published: (2006)