Universal Exponentiation Algorithm A First Step towards Provable SPA-Resistance
- 20 September 2001
- book chapter
- Published by Springer Nature
- p. 300-308
- https://doi.org/10.1007/3-540-44709-1_25
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Towards Sound Approaches to Counteract Power-Analysis AttacksPublished by Springer Nature ,1999
- Differential Power AnalysisPublished by Springer Nature ,1999
- Relations among notions of security for public-key encryption schemesPublished by Springer Nature ,1998
- On the foundations of modern cryptographyPublished by Springer Nature ,1997
- Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other SystemsPublished by Springer Nature ,1996
- Optimal asymmetric encryptionPublished by Springer Nature ,1995
- Random oracles are practicalPublished by Association for Computing Machinery (ACM) ,1993
- Exponentiating Faster with Addition ChainsPublished by Springer Nature ,1991
- Addition chains using continued fractionsJournal of Algorithms, 1989
- Probabilistic encryptionJournal of Computer and System Sciences, 1984