default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDColin D. Walter
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[i3]Colin D. Walter:
The Montgomery and Joye Powering Ladders are Dual. IACR Cryptol. ePrint Arch. 2017: 1081 (2017)- [i2]Colin D. Walter:
Hardware Aspects of Montgomery Modular Multiplication. IACR Cryptol. ePrint Arch. 2017: 1115 (2017) - 2014
- [p3]Mehari G. Msgna, Colin D. Walter:
An Overview of PIC Microcontrollers and Their Suitability for Cryptographic Algorithms. Secure Smart Embedded Devices, Platforms and Applications 2014: 475-495 - 2013
- [c27]Muhammad Qasim Saeed, Zeeshan Bilal, Colin D. Walter:
An NFC based consumer-level counterfeit detection framework. PST 2013: 135-142 - 2012
- [c26]Colin D. Walter:
A Duality in Space Usage between Left-to-Right and Right-to-Left Exponentiation. CT-RSA 2012: 84-97 - [c25]Muhammad Qasim Saeed, Colin D. Walter:
Off-line NFC Tag Authentication. ICITST 2012: 730-735 - 2011
- [c24]Muhammad Qasim Saeed, Colin D. Walter:
A Record Composition/Decomposition attack on the NDEF Signature Record Type Definition. ICITST 2011: 283-287 - [r3]Scott Contini, Çetin Kaya Koç, Colin D. Walter:
Modular Arithmetic. Encyclopedia of Cryptography and Security (2nd Ed.) 2011: 795-798 - 2010
- [c23]Colin D. Walter:
Fast Scalar Multiplication for ECC over GF(p) Using Division Chains. WISA 2010: 61-75
2000 – 2009
- 2009
- [c22]Werner Schindler, Colin D. Walter:
Optimal Recovery of Secret Keys from Weak Side Channel Traces. IMACC 2009: 446-468 - [p2]Colin D. Walter:
Leakage from Montgomery Multiplication. Cryptographic Engineering 2009: 431-449 - [p1]Colin D. Walter:
Randomized Exponentiation Algorithms. Cryptographic Engineering 2009: 451-473 - 2008
- [c21]Colin D. Walter:
Recovering Secret Keys from Weak Side Channel Traces of Differing Lengths. CHES 2008: 214-227 - 2007
- [c20]Colin D. Walter:
Longer Randomly Blinded RSA Keys May Be Weaker Than Shorter Ones. WISA 2007: 303-316 - 2005
- [c19]Colin D. Walter, David Samyde:
Data Dependent Power Use in Multipliers. IEEE Symposium on Computer Arithmetic 2005: 4-12 - [r2]Scott Contini, Çetin Kaya Koç, Colin D. Walter:
Modular Arithmetic. Encyclopedia of Cryptography and Security 2005 - [r1]Çetin Kaya Koç, Colin D. Walter:
Montgomery Arithmetic. Encyclopedia of Cryptography and Security 2005 - 2004
- [c18]Colin D. Walter:
Simple Power Analysis of Unified Code for ECC Double and Add. CHES 2004: 191-204 - [c17]Colin D. Walter:
Issues of Security with the Oswald-Aigner Exponentiation Algorithm. CT-RSA 2004: 208-221 - 2003
- [j11]Mark G. Arnold, Thomas A. Bailey, John R. Cowles, Colin D. Walter:
Fast Fourier Transforms Using the Complex Logarithmic Number System. J. VLSI Signal Process. 33(3): 325-335 (2003) - [c16]Colin D. Walter:
Seeing through MIST Given a Small Fraction of an RSA Private Key. CT-RSA 2003: 391-402 - [c15]Werner Schindler, Colin D. Walter:
More Detail for a Combined Timing and Power Attack against Implementations of RSA. IMACC 2003: 245-263 - [c14]Colin D. Walter:
Longer Keys May Facilitate Side Channel Attacks. Selected Areas in Cryptography 2003: 42-57 - [e1]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. Lecture Notes in Computer Science 2779, Springer 2003, ISBN 3-540-40833-9 [contents] - [i1]Colin D. Walter:
Security Constraints on the Oswald-Aigner Exponentiation Algorithm. IACR Cryptol. ePrint Arch. 2003: 13 (2003) - 2002
- [c13]Colin D. Walter:
Breaking the Liardet-Smart Randomized Exponentiation Algorithm. CARDIS 2002: 59-68 - [c12]Colin D. Walter:
Some Security Aspects of the M IST Randomized Exponentiation Algorithm. CHES 2002: 276-290 - [c11]Colin D. Walter:
Precise Bounds for Montgomery Modular Multiplication and Some Potentially Insecure RSA Moduli. CT-RSA 2002: 30-39 - [c10]Colin D. Walter:
MIST: An Efficient, Randomized Exponentiation Algorithm for Resisting Power Analysis. CT-RSA 2002: 53-66 - 2001
- [c9]Mark G. Arnold, Colin D. Walter:
Unrestricted Faithful Rounding is Good Enough for Some LNS Applications. IEEE Symposium on Computer Arithmetic 2001: 237-246 - [c8]Colin D. Walter:
Sliding Windows Succumbs to Big Mac Attack. CHES 2001: 286-299 - [c7]Colin D. Walter, Susan Thompson:
Distinguishing Exponent Digits by Observing Modular Subtractions. CT-RSA 2001: 192-207 - 2000
- [c6]Colin D. Walter:
Data Integrity in Hardware for Modular Arithmetic. CHES 2000: 204-215
1990 – 1999
- 1999
- [j10]Nadia Nedjah, Colin D. Walter, Stephen E. Eldridge:
Efficient Automata-Driven Pattern-Matching for Equational Programs. Softw. Pract. Exp. 29(9): 793-813 (1999) - [c5]Colin D. Walter:
Moduli for Testing Implementations of the RSA Cryptosystem. IEEE Symposium on Computer Arithmetic 1999: 78-85 - [c4]Colin D. Walter:
Montgomery's Multiplication Technique: How to Make It Smaller and Faster. CHES 1999: 80-93 - 1998
- [j9]Colin D. Walter:
Exponentiation Using Division Chains. IEEE Trans. Computers 47(7): 757-765 (1998) - 1997
- [j8]Colin D. Walter:
Space/Time Trade-Offs for Higher Radix Modular Multiplication Using Repeated Addition. IEEE Trans. Computers 46(2): 139-141 (1997) - [c3]Nadia Nedjah
, Colin D. Walter, Stephen E. Eldridge:
Optimal Left-to-Right Pattern-Matching Automata. ALP/HOA 1997: 273-286 - [c2]Colin D. Walter:
Exponentiation using Division Chains. IEEE Symposium on Computer Arithmetic 1997: 92-97 - 1995
- [j7]Colin D. Walter:
Optimal parameters for on-line arithmetic. Int. J. Comput. Math. 56(1-2): 11-18 (1995) - [j6]Colin D. Walter:
Verification of hardware combining multiplication, division and square root. Microprocess. Microsystems 19(5): 243-245 (1995) - 1993
- [j5]Colin D. Walter:
Systolic Modular Multiplication. IEEE Trans. Computers 42(3): 376-378 (1993) - [j4]Stephen E. Eldridge, Colin D. Walter:
Hardware Implementation of Montgomery's Modular Multiplication Algorithm. IEEE Trans. Computers 42(6): 693-699 (1993) - 1991
- [j3]Colin D. Walter:
Fast modular multiplication using 2-power radix. Int. J. Comput. Math. 39(1-2): 21-28 (1991) - [c1]Colin D. Walter:
Faster Modular Multiplication by Operand Scaling. CRYPTO 1991: 313-323
1980 – 1989
- 1986
- [j2]Colin D. Walter, Jonathan P. Bowen:
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 10(9): 513 (1986) - 1983
- [j1]Colin D. Walter:
Intersection numbers for coherent configurations and the spectrum of a graph. J. Comb. Theory B 35(2): 201-204 (1983)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
