Search the dblp DataBase
Colin D. Walter :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Nadia Nedjah , Colin D. Walter , Stephen E. Eldridge Optimal Left-to-Right Pattern-Matching Automata. [Citation Graph (0, 0)][DBLP ] ALP/HOA, 1997, pp:273-286 [Conf ] Mark G. Arnold , Colin D. Walter Unrestricted Faithful Rounding is Good Enough for Some LNS Applications. [Citation Graph (0, 0)][DBLP ] IEEE Symposium on Computer Arithmetic, 2001, pp:237-246 [Conf ] Colin D. Walter Exponentiation using Division Chains. [Citation Graph (0, 0)][DBLP ] IEEE Symposium on Computer Arithmetic, 1997, pp:92-97 [Conf ] Colin D. Walter Moduli for Testing Implementations of the RSA Cryptosystem. [Citation Graph (0, 0)][DBLP ] IEEE Symposium on Computer Arithmetic, 1999, pp:78-85 [Conf ] Colin D. Walter , David Samyde Data Dependent Power Use in Multipliers. [Citation Graph (0, 0)][DBLP ] IEEE Symposium on Computer Arithmetic, 2005, pp:4-12 [Conf ] Colin D. Walter Breaking the Liardet-Smart Randomized Exponentiation Algorithm. [Citation Graph (0, 0)][DBLP ] CARDIS, 2002, pp:59-68 [Conf ] Colin D. Walter Data Integrity in Hardware for Modular Arithmetic. [Citation Graph (0, 0)][DBLP ] CHES, 2000, pp:204-215 [Conf ] Colin D. Walter Sliding Windows Succumbs to Big Mac Attack. [Citation Graph (0, 0)][DBLP ] CHES, 2001, pp:286-299 [Conf ] Colin D. Walter Some Security Aspects of the M IST Randomized Exponentiation Algorithm. [Citation Graph (0, 0)][DBLP ] CHES, 2002, pp:276-290 [Conf ] Colin D. Walter Simple Power Analysis of Unified Code for ECC Double and Add. [Citation Graph (0, 0)][DBLP ] CHES, 2004, pp:191-204 [Conf ] Colin D. Walter Montgomery's Multiplication Technique: How to Make It Smaller and Faster. [Citation Graph (0, 0)][DBLP ] CHES, 1999, pp:80-93 [Conf ] Colin D. Walter Faster Modular Multiplication by Operand Scaling. [Citation Graph (0, 0)][DBLP ] CRYPTO, 1991, pp:313-323 [Conf ] Colin D. Walter Precise Bounds for Montgomery Modular Multiplication and Some Potentially Insecure RSA Moduli. [Citation Graph (0, 0)][DBLP ] CT-RSA, 2002, pp:30-39 [Conf ] Colin D. Walter MIST: An Efficient, Randomized Exponentiation Algorithm for Resisting Power Analysis. [Citation Graph (0, 0)][DBLP ] CT-RSA, 2002, pp:53-66 [Conf ] Colin D. Walter Seeing through MIST Given a Small Fraction of an RSA Private Key. [Citation Graph (0, 0)][DBLP ] CT-RSA, 2003, pp:391-402 [Conf ] Colin D. Walter Issues of Security with the Oswald-Aigner Exponentiation Algorithm. [Citation Graph (0, 0)][DBLP ] CT-RSA, 2004, pp:208-221 [Conf ] Colin D. Walter , Susan Thompson Distinguishing Exponent Digits by Observing Modular Subtractions. [Citation Graph (0, 0)][DBLP ] CT-RSA, 2001, pp:192-207 [Conf ] Werner Schindler , Colin D. Walter More Detail for a Combined Timing and Power Attack against Implementations of RSA. [Citation Graph (0, 0)][DBLP ] IMA Int. Conf., 2003, pp:245-263 [Conf ] Colin D. Walter Longer Keys May Facilitate Side Channel Attacks. [Citation Graph (0, 0)][DBLP ] Selected Areas in Cryptography, 2003, pp:42-57 [Conf ] Colin D. Walter Intersection numbers for coherent configurations and the spectrum of a graph. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1983, v:35, n:2, pp:201-204 [Journal ] Nadia Nedjah , Colin D. Walter , Stephen E. Eldridge Efficient Automata-Driven Pattern-Matching for Equational Programs. [Citation Graph (0, 0)][DBLP ] Softw., Pract. Exper., 1999, v:29, n:9, pp:793-813 [Journal ] Stephen E. Eldridge , Colin D. Walter Hardware Implementation of Montgomery's Modular Multiplication Algorithm. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Computers, 1993, v:42, n:6, pp:693-699 [Journal ] Colin D. Walter Systolic Modular Multiplication. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Computers, 1993, v:42, n:3, pp:376-378 [Journal ] Colin D. Walter Space/Time Trade-Offs for Higher Radix Modular Multiplication Using Repeated Addition. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Computers, 1997, v:46, n:2, pp:139-141 [Journal ] Colin D. Walter Exponentiation Using Division Chains. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Computers, 1998, v:47, n:7, pp:757-765 [Journal ] Recovering Secret Keys from Weak Side Channel Traces of Differing Lengths. [Citation Graph (, )][DBLP ] Optimal Recovery of Secret Keys from Weak Side Channel Traces. [Citation Graph (, )][DBLP ] Longer Randomly Blinded RSA Keys May Be Weaker Than Shorter Ones. [Citation Graph (, )][DBLP ] Search in 0.026secs, Finished in 0.028secs