International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Colin D. Walter

Publications

Year
Venue
Title
2008
CHES
2004
CHES
2003
EPRINT
Security Constraints on the Oswald-Aigner Exponentiation Algorithm
Colin D. Walter
In smartcard encryption and signature applications, randomized algorithms can be used to increase tamper resistance against attacks based on averaging data-dependent power or EMR variations. Recently, Oswald and Aigner described such an algorithm suitable for point multiplication in elliptic curve cryptography (ECC). With the assumption that an attacker can identify additions and doublings and distinguish them from each other during a single point multiplication, it is shown that the algorithm is insecure for repeated use of the same secret key without blinding of that key. This scotches hopes that the expense of such blinding might be avoided by using the algorithm unless the differences between point additions and doublings can be obscured successfully.
2002
CHES
2001
CHES
2000
CHES
1999
CHES
1991
CRYPTO

Program Committees

CHES 2013
CHES 2012
CHES 2011
CHES 2010
CHES 2009
CHES 2008
CHES 2007
CHES 2006
CHES 2005
CHES 2004
CHES 2003 (Program chair)
CHES 2002
CHES 2001
CHES 2000