Colin D. Walter

48 papers A* 1A 7B 7C 8Misc 2Journal 14Unranked 3

Year	Rank	Type	Title / Venue / Authors
2017	J	`jnl`	Hardware Aspects of Montgomery Modular Multiplication. IACR Cryptol. ePrint Arch. Colin D. Walter
2017	J	`jnl`	The Montgomery and Joye Powering Ladders are Dual. IACR Cryptol. ePrint Arch. Colin D. Walter
2014	—	`ch.`	An Overview of PIC Microcontrollers and Their Suitability for Cryptographic Algorithms. Secure Smart Embedded Devices, Platforms and Applications Mehari G. Msgna, Colin D. Walter
2013	C	`conf`	An NFC based consumer-level counterfeit detection framework. PST Muhammad Qasim Saeed, Zeeshan Bilal, Colin D. Walter
2012	B	`conf`	A Duality in Space Usage between Left-to-Right and Right-to-Left Exponentiation. CT-RSA Colin D. Walter
2012	—	`conf`	Off-line NFC Tag Authentication. ICITST Muhammad Qasim Saeed, Colin D. Walter
2011	—	`conf`	A Record Composition/Decomposition attack on the NDEF Signature Record Type Definition. ICITST Muhammad Qasim Saeed, Colin D. Walter
2011	—	`ch.`	Modular Arithmetic. Encyclopedia of Cryptography and Security (2nd Ed.) Scott Contini, Çetin Kaya Koç, Colin D. Walter
2010	Misc	`conf`	Fast Scalar Multiplication for ECC over GF( WISA Colin D. Walter
2009	—	`ch.`	Leakage from Montgomery Multiplication. Cryptographic Engineering Colin D. Walter
2009	C	`conf`	Optimal Recovery of Secret Keys from Weak Side Channel Traces. IMACC Werner Schindler, Colin D. Walter
2009	—	`ch.`	Randomized Exponentiation Algorithms. Cryptographic Engineering Colin D. Walter
2008	A	`conf`	Recovering Secret Keys from Weak Side Channel Traces of Differing Lengths. CHES Colin D. Walter
2007	Misc	`conf`	Longer Randomly Blinded RSA Keys May Be Weaker Than Shorter Ones. WISA Colin D. Walter
2005	C	`conf`	Data Dependent Power Use in Multipliers. IEEE Symposium on Computer Arithmetic Colin D. Walter, David Samyde
2005	—	`ch.`	Modular Arithmetic. Encyclopedia of Cryptography and Security Scott Contini, Çetin Kaya Koç, Colin D. Walter
2005	—	`ch.`	Montgomery Arithmetic. Encyclopedia of Cryptography and Security Çetin Kaya Koç, Colin D. Walter
2004	B	`conf`	Issues of Security with the Oswald-Aigner Exponentiation Algorithm. CT-RSA Colin D. Walter
2004	A	`conf`	Simple Power Analysis of Unified Code for ECC Double and Add. CHES Colin D. Walter
2003	A	`ed.`	Cryptographic Hardware and Embedded Systems - CHES 2003, 5th International Workshop, Cologne, Germany, September 8-10, 2003, Proceedings CHES Colin D. Walter, Çetin Kaya Koç, Christof Paar
2003	J	`jnl`	Fast Fourier Transforms Using the Complex Logarithmic Number System. J. VLSI Signal Process. Mark G. Arnold, Thomas A. Bailey, John R. Cowles, Colin D. Walter
2003	B	`conf`	Longer Keys May Facilitate Side Channel Attacks. Selected Areas in Cryptography Colin D. Walter
2003	C	`conf`	More Detail for a Combined Timing and Power Attack against Implementations of RSA. IMACC Werner Schindler, Colin D. Walter
2003	J	`jnl`	Security Constraints on the Oswald-Aigner Exponentiation Algorithm. IACR Cryptol. ePrint Arch. Colin D. Walter
2003	B	`conf`	Seeing through MIST Given a Small Fraction of an RSA Private Key. CT-RSA Colin D. Walter
2002	C	`conf`	Breaking the Liardet-Smart Randomized Exponentiation Algorithm. CARDIS Colin D. Walter
2002	B	`conf`	MIST: An Efficient, Randomized Exponentiation Algorithm for Resisting Power Analysis. CT-RSA Colin D. Walter
2002	B	`conf`	Precise Bounds for Montgomery Modular Multiplication and Some Potentially Insecure RSA Moduli. CT-RSA Colin D. Walter
2002	A	`conf`	Some Security Aspects of the M IST Randomized Exponentiation Algorithm. CHES Colin D. Walter
2001	B	`conf`	Distinguishing Exponent Digits by Observing Modular Subtractions. CT-RSA Colin D. Walter, Susan Thompson
2001	A	`conf`	Sliding Windows Succumbs to Big Mac Attack. CHES Colin D. Walter
2001	C	`conf`	Unrestricted Faithful Rounding is Good Enough for Some LNS Applications. IEEE Symposium on Computer Arithmetic Mark G. Arnold, Colin D. Walter
2000	A	`conf`	Data Integrity in Hardware for Modular Arithmetic. CHES Colin D. Walter
1999	J	`jnl`	Efficient Automata-Driven Pattern-Matching for Equational Programs. Softw. Pract. Exp. Nadia Nedjah, Colin D. Walter, Stephen E. Eldridge
1999	C	`conf`	Moduli for Testing Implementations of the RSA Cryptosystem. IEEE Symposium on Computer Arithmetic Colin D. Walter
1999	A	`conf`	Montgomery's Multiplication Technique: How to Make It Smaller and Faster. CHES Colin D. Walter
1998	J	`jnl`	Exponentiation Using Division Chains. IEEE Trans. Computers Colin D. Walter
1997	C	`conf`	Exponentiation using Division Chains. IEEE Symposium on Computer Arithmetic Colin D. Walter
1997	—	`conf`	Optimal Left-to-Right Pattern-Matching Automata. ALP/HOA Nadia Nedjah, Colin D. Walter, Stephen E. Eldridge
1997	J	`jnl`	Space/Time Trade-Offs for Higher Radix Modular Multiplication Using Repeated Addition. IEEE Trans. Computers Colin D. Walter
1995	J	`jnl`	Optimal parameters for on-line arithmetic. Int. J. Comput. Math. Colin D. Walter
1995	J	`jnl`	Verification of hardware combining multiplication, division and square root. Microprocess. Microsystems Colin D. Walter
1993	J	`jnl`	Hardware Implementation of Montgomery's Modular Multiplication Algorithm. IEEE Trans. Computers Stephen E. Eldridge, Colin D. Walter
1993	J	`jnl`	Systolic Modular Multiplication. IEEE Trans. Computers Colin D. Walter
1991	J	`jnl`	Fast modular multiplication using 2-power radix. Int. J. Comput. Math. Colin D. Walter
1991	A*	`conf`	Faster Modular Multiplication by Operand Scaling. CRYPTO Colin D. Walter
1986	J	`jnl`	Microprocessor interfacing and communication using the Intel SDK-85: Borivoje Furht and Himanshu Parikh Prentice-Hall Reston, Englewood Cliffs, NJ, USA (April 1986) £31.00 pp 499. Microprocess. Microsystems Colin D. Walter, Jonathan P. Bowen
1983	J	`jnl`	Intersection numbers for coherent configurations and the spectrum of a graph. J. Comb. Theory B Colin D. Walter