The Montgomery Powering Ladder
Top Cited Papers
- 17 February 2003
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 291-302
- https://doi.org/10.1007/3-540-36400-5_22
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Observability Analysis - Detecting When Improved Cryptosystems Fail -Lecture Notes in Computer Science, 2002
- Weierstraß Elliptic Curves and Side-Channel AttacksLecture Notes in Computer Science, 2002
- A Fast Parallel Elliptic Curve Multiplication Resistant against Side Channel AttacksLecture Notes in Computer Science, 2002
- Prime NumbersPublished by Springer Science and Business Media LLC ,2001
- Differential Power AnalysisLecture Notes in Computer Science, 1999
- Fast Multiplication on Elliptic Curves Over GF(2m) without precomputationLecture Notes in Computer Science, 1999
- A Survey of Fast Exponentiation MethodsJournal of Algorithms, 1998
- Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other SystemsLecture Notes in Computer Science, 1996
- Efficient computation of full Lucas sequencesElectronics Letters, 1996
- An implementation of elliptic curve cryptosystems over F/sub 2/155IEEE Journal on Selected Areas in Communications, 1993