Formal verification of a CRT-RSA implementation against fault attacks
- 15 February 2013
- journal article
- special section-on-proofs-workshop
- Published by Springer Science and Business Media LLC in Journal of Cryptographic Engineering
- Vol. 3 (3), 157-167
- https://doi.org/10.1007/s13389-013-0049-3
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Verifying Cryptographic Code in C: Some Experience and the Csec ChallengeLecture Notes in Computer Science, 2012
- Formal Proof of SCHUR Conjugate FunctionLecture Notes in Computer Science, 2010
- Fault Attacks Against emv SignaturesLecture Notes in Computer Science, 2010
- Attack model for verification of interval security properties for smart card C codesPublished by Association for Computing Machinery (ACM) ,2010
- RSA with CRT: A New Cost-Effective Solution to Thwart Fault AttacksLecture Notes in Computer Science, 2008
- CRT RSA Algorithm Protected Against Fault AttacksLecture Notes in Computer Science, 2007
- An RSA Implementation Resistant to Fault Attacks and to Simple Power AnalysisIEEE Transactions on Computers, 2006
- Fault Attacks on RSA with CRT: Concrete Results and Practical CountermeasuresLecture Notes in Computer Science, 2003
- On the Importance of Eliminating Errors in Cryptographic ComputationsJournal of Cryptology, 2000
- An axiomatic basis for computer programmingCommunications of the ACM, 1983