Author of the publication

More Detail for a Combined Timing and Power Attack against Implementations of RSA.

, and . IMACC, volume 2898 of Lecture Notes in Computer Science, page 245-263. Springer, (2003)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Security Constraints on the Oswald-Aigner Exponentiation Algorithm.. IACR Cryptology ePrint Archive, (2003)Hardware Aspects of Montgomery Modular Multiplication.. IACR Cryptology ePrint Archive, (2017)Unrestricted Faithful Rounding is Good Enough for Some LNS Applications., and . IEEE Symposium on Computer Arithmetic, page 237-246. IEEE Computer Society, (2001)Exponentiation using Division Chains.. IEEE Symposium on Computer Arithmetic, page 92-97. IEEE Computer Society, (1997)Distinguishing Exponent Digits by Observing Modular Subtractions., and . CT-RSA, volume 2020 of Lecture Notes in Computer Science, page 192-207. Springer, (2001)MIST: An Efficient, Randomized Exponentiation Algorithm for Resisting Power Analysis.. CT-RSA, volume 2271 of Lecture Notes in Computer Science, page 53-66. Springer, (2002)An NFC based consumer-level counterfeit detection framework., , and . PST, page 135-142. IEEE Computer Society, (2013)Sliding Windows Succumbs to Big Mac Attack.. CHES, volume 2162 of Lecture Notes in Computer Science, page 286-299. Springer, (2001)Data Integrity in Hardware for Modular Arithmetic.. CHES, volume 1965 of Lecture Notes in Computer Science, page 204-215. Springer, (2000)Seeing through MIST Given a Small Fraction of an RSA Private Key.. CT-RSA, volume 2612 of Lecture Notes in Computer Science, page 391-402. Springer, (2003)