Distinguishing Exponent Digits by Observing Modular Subtractions
Authors:
- 2 April 2001
- book chapter
- Published by Springer Nature
- p. 192-207
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A Timing Attack against RSA with the Chinese Remainder Theorem2000
- Montgomery exponentiation needs no final subtractionsElectronics Letters, 1999
- Montgomery’s Multiplication Technique: How to Make It Smaller and Faster1999
- Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems1996
- High-radix and bit recoding techniques for modular exponentiationInternational Journal of Computer Mathematics, 1991
- Modular Multiplication Without Trial DivisionMathematics of Computation, 1985
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978