Johannes Blömer, Martin Otto, Jean-Pierre Seifert  Home/Search
Context
Related
| iacr.org/2004/227.ps.gz 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/2004/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present a new type of fault attacks on elliptic curve scalar multiplications: Sign Change Attacks. These attacks exploit di#erent number representations as they are often employed in modern cryptographic applications. Previously, fault attacks on elliptic curves aimed to force a device to output points which are on a cryptographically weak curve. Such attacks can easily be defended against. Our attack produces points which do not leave the curve and are not easily detected. The paper... (Update)
Active bibliography (related documents): More All
0.7: Fault and Side-Channel Attacks on Pairing Based Cryptography - Page, Vercauteren (2004) (Correct)
0.7: Cryptanalysis of a Provably Secure CRT-RSA Algorithm - David Wagner University (Correct)
0.5: Efficient Implementation of Elliptic Curve.. - Guajardo, Blumel.. (2001) (Correct)
Similar documents based on text: More All
0.1: An Improved and Efficient Countermeasure against Power .. - Kim, Ha, Moon, Yen.. (2005) (Correct)
0.1: Fault attacks on RSA with CRT: Concrete Results.. - Aumüller, Bier.. (2002) (Correct)
0.1: Elliptic Curve Cryptosystems in the Presence of Permanent and.. - Ciet, Joye (2003) (Correct)
BibTeX entry: (Update)
@misc{ mer-sign,
author = "Johannes Blömer and Martin Otto and Jean-Pierre Seifert",
title = "Sign Change Fault Attacks on Elliptic Curve Cryptosystems",
url = "citeseer.ist.psu.edu/714377.html" }
Citations (may not include all citations):237 The arithmetic of elliptic curves (context) - Silverman - 2000
185 Tamper resistance --- a cautionary note - Anderson, Kuhn - 1996
135 Modular multiplication without trial division (context) - Montgomery - 1985
134 Factoring integers with elliptic curves (context) - Lenstra - 1987
122 Computer arithmetic algorithms (context) - Koren - 1993
115 Low cost attacks on tamper resistant devices - Anderson, Kuhn
82 A signed binary multiplication technique (context) - Booth - 1951
81 Standard specifications for public key cryptography (context) - Draft - 1998
74 Resistance against di#erential power analysis for elliptic c.. (context) - Coron - 1999
73 Speeding up the computations on an elliptic curve using addi.. - Morain, Olivos - 1990
68 Modern computer algebra (context) - Gathen, Gerhard - 1999
65 Speeding the Pollard and elliptic curve methods of factoriza.. (context) - Montgomery - 1987
59 Design principles for tamper-resistant smartcard processors - Kommerling, Kuhn - 1999
45 Binary arithmetic (context) - Reitwiesner - 1960
40 Implementing the Rivest Shamir and Adleman public key encryp.. (context) - Barrett - 1996
38 Almost all primes can be quickly certified (context) - Goldwasser, Kilian - 1986
34 cient elliptic curve exponentiation using mixed coordinates (context) - Cohen, Miyaji et al. - 1998
26 Protections against di#erential analysis for elliptic curve .. - Joye, Tymen
25 London Mathematical Society Lecture Note Series (context) - Blake, Seroussi et al. - 1999
24 Optimal left-to-right binary signed-digit recoding - Joye, Yen - 2000
22 the importance of eliminating errors in cryptographic comput.. - Boneh, DeMillo et al. - 2001
20 High-speed arithmetic in binary computers (context) - MacSorley - 1961
20 Counting points on elliptic curves over finite fields - Schoof - 1995
18 Smart card crypto-coprocessors for public-key cryptography - Handschuh, Pailler - 1998
17 Optical fault induction attacks - Skorobogatov, Anderson
16 Die Typen der Multiplikatorenringe elliptischer Funktionenko.. (context) - Deuring - 1941
13 The montgomery powering ladder - Joye, Yen
11 a smart card for public-key cryptosystems (context) - de Wale, Quisquater - 1990
10 Constructing elliptic curve cryptosystems in characteristic - Koblitz - 1991
10 Method and apparatus for protecting public key schemes from .. (context) - Shamir
7 Eddy current for magnetic analysis with active sensor (context) - Quisquater, Samyde
6 erential fault attacks on elliptic curve cryptosystems (context) - Biehl, Meyer et al.
5 The sorcerer 's apprentice guide to fault attacks (context) - Bar-El, Choukri et al.
4 The RSA cryptography processor (context) - Sedlak - 1987
4 Hardware architectures for public key cryptography (context) - Batina, Ors et al. - 2003
3 Fault attacks on RSA with CRT: Concrete results and practica.. (context) - Aumuller, Bier et al.
3 Exceptional procedure attack on elliptic curve cryptosystems (context) - Izu, Takagi
2 Elliptic curve cryptosystems in the presence of permanent an.. (context) - Ciet, Joye
2 Compact encoding of non-adjacent forms with applications to .. - Joye, Tymen
2 A new CRT-RSA algorithm secure against bellcore attacks (context) - Blomer, Otto et al.
2 SEC 2: Recommended elliptic curve domain parameters (context) - for, cient et al. - 2000
1 SCA-resistant and fast elliptic scalar multiplication based .. (context) - Okeya, Takagi - 2004
Documents on the same site (http://eprint.iacr.org/2004/): More
The Security and Efficiency of Micciancio's Cryptosystem - Ludwig (2004) (Correct)
Entropic Security and the Encryption of High Entropy Messages - Dodis, Smith (2004) (Correct)
On Cheating Immune Secret Sharing - Braeken, Nikova, al. (2004) (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