Guillaume Fumaroli and David Vigilant Axalto 6 rue de la Verrerie, F-92190...  Home/Search
Context
Related
| iacr.org/2006/143.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: iacr.org/2006/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: As the core operation of many public key cryptosystems, group exponentiation is central to cryptography. Attacks on its implementation in embedded device setting is hence of great concern. Recently, implementations resisting both simple side-channel analysis and fault attacks were proposed. In this paper, we go further and present an algorithm that also inherently thwarts di#erential side-channel attacks in finite abelian groups with only limited time and storage overhead. (Update)
Active bibliography (related documents): More All
0.2: First Steps Toward a Cryptography-Aware Language and Compiler - Barbosa, Noad, Page, Smart (2005) (Correct)
0.2: A Note On Side-Channels Resulting From - Dynamic Compilation Page (2006) (Correct)
0.2: On the Automatic Construction of Indistinguishable Operations - Barbosa, Page (2005) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ and-blinded,
author = "Guillaume Fumaroli And",
title = "Blinded Fault Resistant Exponentiation",
url = "citeseer.ist.psu.edu/757738.html" }
Citations (may not include all citations):168 An improved algorithm for computing logarithms over GF (context) - Pohlig, Hellman - 1978
161 Timing Attacks on Implementations of Di#e-Hellman (context) - Kocher - 1996
135 the Importance of Checking Cryptographic Protocols for Fault.. - Boneh, DeMillo et al. - 1997
74 Resistance Against Di#erential Power Analysis for Elliptic C.. (context) - Coron - 1999
65 Speeding the Pollard and elliptic curve methods of factoriza.. (context) - Montgomery - 1987
14 Lecture Notes in Computer Science (context) - Kocher, Ja et al. - 1999
13 The Montgomery Powering Ladder - Joye, Yen - 2002
8 A refined power analysis attack on elliptic curve cryptosyst.. (context) - Goubin - 2003
4 Implementation of elliptic curve cryptography with built-in .. (context) - Trichina, Bellezza - 2002
1 Practical Fault Countermeasures for Chinese Remaindering Bas.. (context) - Ciet, Joye - 2005
1 Fault Resistant RSA Implementation (context) - Giraud - 2005
1 Resistance of Randomized Projective Coordinates Against Powe.. (context) - Dupuy, Kunz-Jacques - 2005
Documents on the same site (http://eprint.iacr.org/2006/): More
Simplified Pairing Computation and Security Implications - Galbraith, hEigeartaigh.. (2006) (Correct)
Cryptanalysis of an Image Scrambling Scheme without.. - Li, Li, Lo, Chen (2006) (Correct)
Non-Trivial Black-Box Combiners for Collision-Resistant.. - Pietrzak (2006) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC