2008 |
31 | EE | Colin D. Walter:
Recovering Secret Keys from Weak Side Channel Traces of Differing Lengths.
CHES 2008: 214-227 |
2007 |
30 | EE | Colin D. Walter:
Longer Randomly Blinded RSA Keys May Be Weaker Than Shorter Ones.
WISA 2007: 303-316 |
2005 |
29 | EE | Colin D. Walter,
David Samyde:
Data Dependent Power Use in Multipliers.
IEEE Symposium on Computer Arithmetic 2005: 4-12 |
28 | EE | Scott Contini,
Çetin Kaya Koç,
Colin D. Walter:
Modular Arithmetic.
Encyclopedia of Cryptography and Security 2005 |
27 | EE | Çetin Kaya Koç,
Colin D. Walter:
Montgomery Arithmetic.
Encyclopedia of Cryptography and Security 2005 |
2004 |
26 | EE | Colin D. Walter:
Simple Power Analysis of Unified Code for ECC Double and Add.
CHES 2004: 191-204 |
25 | EE | Colin D. Walter:
Issues of Security with the Oswald-Aigner Exponentiation Algorithm.
CT-RSA 2004: 208-221 |
2003 |
24 | | Colin D. Walter,
Çetin Kaya Koç,
Christof Paar:
Cryptographic Hardware and Embedded Systems - CHES 2003, 5th International Workshop, Cologne, Germany, September 8-10, 2003, Proceedings
Springer 2003 |
23 | EE | Colin D. Walter:
Seeing through MIST Given a Small Fraction of an RSA Private Key.
CT-RSA 2003: 391-402 |
22 | EE | Werner Schindler,
Colin D. Walter:
More Detail for a Combined Timing and Power Attack against Implementations of RSA.
IMA Int. Conf. 2003: 245-263 |
21 | EE | Colin D. Walter:
Longer Keys May Facilitate Side Channel Attacks.
Selected Areas in Cryptography 2003: 42-57 |
20 | EE | Mark G. Arnold,
Thomas A. Bailey,
John R. Cowles,
Colin D. Walter:
Fast Fourier Transforms Using the Complex Logarithmic Number System.
VLSI Signal Processing 33(3): 325-335 (2003) |
2002 |
19 | EE | Colin D. Walter:
Breaking the Liardet-Smart Randomized Exponentiation Algorithm.
CARDIS 2002: 59-68 |
18 | EE | Colin D. Walter:
Some Security Aspects of the M IST Randomized Exponentiation Algorithm.
CHES 2002: 276-290 |
17 | EE | Colin D. Walter:
Precise Bounds for Montgomery Modular Multiplication and Some Potentially Insecure RSA Moduli.
CT-RSA 2002: 30-39 |
16 | EE | Colin D. Walter:
MIST: An Efficient, Randomized Exponentiation Algorithm for Resisting Power Analysis.
CT-RSA 2002: 53-66 |
2001 |
15 | EE | Colin D. Walter:
Sliding Windows Succumbs to Big Mac Attack.
CHES 2001: 286-299 |
14 | EE | Colin D. Walter,
Susan Thompson:
Distinguishing Exponent Digits by Observing Modular Subtractions.
CT-RSA 2001: 192-207 |
13 | EE | Mark G. Arnold,
Colin D. Walter:
Unrestricted Faithful Rounding is Good Enough for Some LNS Applications.
IEEE Symposium on Computer Arithmetic 2001: 237-246 |
2000 |
12 | EE | Colin D. Walter:
Data Integrity in Hardware for Modular Arithmetic.
CHES 2000: 204-215 |
1999 |
11 | EE | Colin D. Walter:
Montgomery's Multiplication Technique: How to Make It Smaller and Faster.
CHES 1999: 80-93 |
10 | EE | Colin D. Walter:
Moduli for Testing Implementations of the RSA Cryptosystem.
IEEE Symposium on Computer Arithmetic 1999: 78-85 |
9 | | Nadia Nedjah,
Colin D. Walter,
Stephen E. Eldridge:
Efficient Automata-Driven Pattern-Matching for Equational Programs.
Softw., Pract. Exper. 29(9): 793-813 (1999) |
1998 |
8 | | Colin D. Walter:
Exponentiation Using Division Chains.
IEEE Trans. Computers 47(7): 757-765 (1998) |
1997 |
7 | | Nadia Nedjah,
Colin D. Walter,
Stephen E. Eldridge:
Optimal Left-to-Right Pattern-Matching Automata.
ALP/HOA 1997: 273-286 |
6 | EE | Colin D. Walter:
Exponentiation using Division Chains.
IEEE Symposium on Computer Arithmetic 1997: 92-97 |
5 | | Colin D. Walter:
Space/Time Trade-Offs for Higher Radix Modular Multiplication Using Repeated Addition.
IEEE Trans. Computers 46(2): 139-141 (1997) |
1993 |
4 | | Colin D. Walter:
Systolic Modular Multiplication.
IEEE Trans. Computers 42(3): 376-378 (1993) |
3 | | Stephen E. Eldridge,
Colin D. Walter:
Hardware Implementation of Montgomery's Modular Multiplication Algorithm.
IEEE Trans. Computers 42(6): 693-699 (1993) |
1991 |
2 | EE | Colin D. Walter:
Faster Modular Multiplication by Operand Scaling.
CRYPTO 1991: 313-323 |
1983 |
1 | EE | Colin D. Walter:
Intersection numbers for coherent configurations and the spectrum of a graph.
J. Comb. Theory, Ser. B 35(2): 201-204 (1983) |