Refined Computations for Points of the Form 2kP Based on Montgomery Trick
Main Authors: | HIRATA, Tomio, ADACHI, Daisuke |
---|---|
Language: | en |
Published: |
Institute of Electronics, Information and Communication Engineers
2006
|
Subjects: | |
Online Access: | http://hdl.handle.net/2237/15065 http://www.ieice.org/jpn/trans_online/index.html |
Similar Items
-
Faster Montgomery and double-add ladders for short Weierstrass curves
by: Mike Hamburg
Published: (2020-08-01) -
Efficient Algorithm for Multi-Bit Montgomery Inverse Using Refined Multiplicative Inverse Modular <inline-formula> <tex-math notation="LaTeX">$2^K$ </tex-math></inline-formula>
by: Young-Sik Kim
Published: (2019-01-01) -
Montgomery Reduction for Gaussian Integers
by: Malek Safieh, et al.
Published: (2021-02-01) -
A Compact Coprocessor for the Elliptic Curve Point Multiplication over Gaussian Integers
by: Malek Safieh, et al.
Published: (2020-12-01) -
Versatile Montgomery Multiplier Architectures
by: Gaubatz, Gunnar
Published: (2002)