# Colin D. Walter

According to our database

Collaborative distances:

^{1}, Colin D. Walter authored at least 46 papers between 1983 and 2017.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2017

Hardware Aspects of Montgomery Modular Multiplication.

IACR Cryptology ePrint Archive, 2017

The Montgomery and Joye Powering Ladders are Dual.

IACR Cryptology ePrint Archive, 2017

2014

An Overview of PIC Microcontrollers and Their Suitability for Cryptographic Algorithms.

Proceedings of the Secure Smart Embedded Devices, Platforms and Applications, 2014

2013

An NFC based consumer-level counterfeit detection framework.

Proceedings of the Eleventh Annual International Conference on Privacy, Security and Trust, 2013

2012

Off-line NFC Tag Authentication.

Proceedings of the 7th International Conference for Internet Technology and Secured Transactions, 2012

A Duality in Space Usage between Left-to-Right and Right-to-Left Exponentiation.

Proceedings of the Topics in Cryptology - CT-RSA 2012 - The Cryptographers' Track at the RSA Conference 2012, San Francisco, CA, USA, February 27, 2012

2011

A Record Composition/Decomposition attack on the NDEF Signature Record Type Definition.

Proceedings of the 6th International Conference for Internet Technology and Secured Transactions, 2011

2010

Fast Scalar Multiplication for ECC over GF(

*p*) Using Division Chains.
Proceedings of the Information Security Applications - 11th International Workshop, 2010

2009

Optimal Recovery of Secret Keys from Weak Side Channel Traces.

Proceedings of the Cryptography and Coding, 2009

Randomized Exponentiation Algorithms.

Proceedings of the Cryptographic Engineering, 2009

Leakage from Montgomery Multiplication.

Proceedings of the Cryptographic Engineering, 2009

2008

Recovering Secret Keys from Weak Side Channel Traces of Differing Lengths.

Proceedings of the Cryptographic Hardware and Embedded Systems, 2008

2007

Longer Randomly Blinded RSA Keys May Be Weaker Than Shorter Ones.

Proceedings of the Information Security Applications, 8th International Workshop, 2007

2005

Montgomery Arithmetic.

Proceedings of the Encyclopedia of Cryptography and Security, 2005

Modular Arithmetic.

Proceedings of the Encyclopedia of Cryptography and Security, 2005

Data Dependent Power Use in Multipliers.

Proceedings of the 17th IEEE Symposium on Computer Arithmetic (ARITH-17 2005), 2005

2004

Issues of Security with the Oswald-Aigner Exponentiation Algorithm.

Proceedings of the Topics in Cryptology, 2004

Simple Power Analysis of Unified Code for ECC Double and Add.

Proceedings of the Cryptographic Hardware and Embedded Systems, 2004

2003

Fast Fourier Transforms Using the Complex Logarithmic Number System.

VLSI Signal Processing, 2003

Security Constraints on the Oswald-Aigner Exponentiation Algorithm.

IACR Cryptology ePrint Archive, 2003

Longer Keys May Facilitate Side Channel Attacks.

Proceedings of the Selected Areas in Cryptography, 10th Annual International Workshop, 2003

More Detail for a Combined Timing and Power Attack against Implementations of RSA.

Proceedings of the Cryptography and Coding, 2003

Seeing through MIST Given a Small Fraction of an RSA Private Key.

Proceedings of the Topics in Cryptology, 2003

2002

MIST: An Efficient, Randomized Exponentiation Algorithm for Resisting Power Analysis.

Proceedings of the Topics in Cryptology, 2002

Precise Bounds for Montgomery Modular Multiplication and Some Potentially Insecure RSA Moduli.

Proceedings of the Topics in Cryptology, 2002

Some Security Aspects of the M IST Randomized Exponentiation Algorithm.

Proceedings of the Cryptographic Hardware and Embedded Systems, 2002

Breaking the Liardet-Smart Randomized Exponentiation Algorithm.

Proceedings of the Fifth Smart Card Research and Advanced Application Conference, 2002

2001

Distinguishing Exponent Digits by Observing Modular Subtractions.

Proceedings of the Topics in Cryptology, 2001

Sliding Windows Succumbs to Big Mac Attack.

Proceedings of the Cryptographic Hardware and Embedded Systems, 2001

Unrestricted Faithful Rounding is Good Enough for Some LNS Applications.

Proceedings of the 15th IEEE Symposium on Computer Arithmetic (Arith-15 2001), 2001

2000

Data Integrity in Hardware for Modular Arithmetic.

Proceedings of the Cryptographic Hardware and Embedded Systems, 2000

1999

Efficient Automata-Driven Pattern-Matching for Equational Programs.

Softw., Pract. Exper., 1999

Montgomery's Multiplication Technique: How to Make It Smaller and Faster.

Proceedings of the Cryptographic Hardware and Embedded Systems, 1999

Moduli for Testing Implementations of the RSA Cryptosystem.

Proceedings of the 14th IEEE Symposium on Computer Arithmetic (Arith-14 '99), 1999

1998

Exponentiation Using Division Chains.

IEEE Trans. Computers, 1998

1997

Space/Time Trade-Offs for Higher Radix Modular Multiplication Using Repeated Addition.

IEEE Trans. Computers, 1997

Exponentiation using Division Chains.

Proceedings of the 13th Symposium on Computer Arithmetic (ARITH-13 '97), 1997

Optimal Left-to-Right Pattern-Matching Automata.

Proceedings of the Algebraic and Logic Programming, 6th International Joint Conference, 1997

1995

Verification of hardware combining multiplication, division and square root.

Microprocessors and Microsystems - Embedded Hardware Design, 1995

Optimal parameters for on-line arithmetic.

Int. J. Comput. Math., 1995

1993

Systolic Modular Multiplication.

IEEE Trans. Computers, 1993

Hardware Implementation of Montgomery's Modular Multiplication Algorithm.

IEEE Trans. Computers, 1993

1991

Fast modular multiplication using 2-power radix.

Int. J. Comput. Math., 1991

Faster Modular Multiplication by Operand Scaling.

Proceedings of the Advances in Cryptology, 1991

1986

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.

Microprocessors and Microsystems - Embedded Hardware Design, 1986

1983

Intersection numbers for coherent configurations and the spectrum of a graph.

J. Comb. Theory, Ser. B, 1983