2014 · 35 citations · 21 references
ComputingComputer EngineeringComputer ScienceCryptographyFault-tolerant ComputingFault-tolerant SystemsCryptographic ArchitectureCryptographic ImplementationCryptographic VulnerabilitiesAbstractionAttack DiscoveryCryptographic Fault AnalysisExponentiation AlgorithmsFault Attack MitigationFault-based AttacksMicroarchitectural Fault AttacksModular Exponentiation
Fault attacks are attacks in which an adversary with physical access to a cryptographic device, say a smartcard, tampers with the execution of an algorithm to retrieve secret material. Since the seminal Bellcore attack on modular exponentiation, there has been extensive work to discover new fault attacks against cryptographic schemes and develop countermeasures against such attacks. Originally focused on high-level algorithmic descriptions, these efforts increasingly focus on concrete implementations. While lowering the abstraction level leads to new fault attacks, it also makes their discovery significantly more challenging. In order to face this trend, it is therefore desirable to develop principled, tool-supported approaches that allow a systematic analysis of the security of cryptographic implementations against fault attacks.
21
Factoring polynomials with rational coefficients
A. K. Lenstra, H. W. Lenstra, László Lovász · Mathematische Annalen · 1982 · 4K citations · Full text
Modular multiplication without trial division
Peter L. Montgomery · Mathematics of Computation · 1985 · 2.4K citations
Rajeev Alur, Rastislav Bodík, Garvit Juniwal et al. · 2013 · 523 citations