Parallel FPGA Implementation of RSA with Residue Number Systems—Can side-channel threats be avoided?
- 5 January 2006
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- ElectroMagnetic Analysis (EMA): Measures and Counter-measures for Smart CardsLecture Notes in Computer Science, 2001
- A Timing Attack against RSA with the Chinese Remainder TheoremLecture Notes in Computer Science, 2000
- Montgomery Exponentiation with no Final Subtractions: Improved ResultsLecture Notes in Computer Science, 2000
- Montgomery exponentiation needs no final subtractionsElectronics Letters, 1999
- An RNS Montgomery modular multiplication algorithmIEEE Transactions on Computers, 1998
- Differential fault analysis of secret key cryptosystemsLecture Notes in Computer Science, 1997
- Modulo reduction in residue number systemsIEEE Transactions on Parallel and Distributed Systems, 1995
- Integer division in residue number systemsIEEE Transactions on Computers, 1995
- Modular Multiplication Without Trial DivisionMathematics of Computation, 1985
- Fast decipherment algorithm for RSA public-key cryptosystemElectronics Letters, 1982