#### Filter Results:

#### Publication Year

1986

2013

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- James A. Muir, Douglas R. Stinson
- CT-RSA
- 2005

For an integer w ≥ 2, a radix 2 representation is called a width-w nonadjacent form (w-NAF, for short) if each nonzero digit is an odd integer with absolute value less than 2 w−1 , and of any w consecutive digits, at most one is nonzero. In elliptic curve cryptography, the w-NAF window method is used to efficiently compute nP where n is an integer and P is… (More)

- James A. Muir, Douglas R. Stinson
- Selected Areas in Cryptography
- 2003

It is known that every positive integer n can be represented as a finite sum of the form n = P ai2 i , where ai ∈ {0, 1, −1} for all i, and no two consecutive ai's are non-zero. Such sums are called nonadja-cent representations. Nonadjacent representations are useful in efficiently implementing elliptic curve arithmetic for cryptographic applications. In… (More)

- Clemens Heuberger, James A. Muir
- IACR Cryptology ePrint Archive
- 2008

An online algorithm is presented that produces an optimal radix-2 representation of an input integer n using digits from the set D ,u = {a ∈ Z : ≤ a ≤ u}, where ≤ 0 and u ≥ 1. The algorithm works by scanning the digits of the binary representation of n from left-to-right (i.e., from most-significant to least-significant). The output representation is… (More)

- James A. Muir, Paul C. van Oorschot
- ACM Comput. Surv.
- 2009

Internet geolocation technology aims to determine the physical (geographic) location of Internet users and devices. It is currently proposed or in use for a wide variety of purposes, including targeted marketing, restricting digital content sales to authorized jurisdictions, and security applications such as reducing credit card fraud. This raises questions… (More)

- James A. Muir, Douglas R. Stinson
- Math. Comput.
- 2006

Let w ≥ 2 be an integer and let Dw be the set of integers which includes zero and the odd integers with absolute value less than 2 w−1. Every integer n can be represented as a finite sum of the form n = P a i 2 i , with a i ∈ Dw, such that of any w consecutive a i 's at most one is nonzero. Such representations are called width-w nonadjacent forms (w-NAFs).… (More)

I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, including any required final revisions, as accepted by my examiners. I understand that my thesis may be made electronically available to the public. ii Abstract The traditional model of cryptography examines the security of cryptographic prim-itives as mathematical… (More)

- James A. Muir
- ICICS
- 2005

Seifert recently described a new fault attack against an implementation of RSA signature verification. Here we give a simplified analysis of Seifert's attack and gauge its practicality against RSA moduli of practical sizes. We suggest an improvement to Seifert's attack which has the following consequences: if an adversary is able to cause random faults in… (More)

Internet geolocation technology (IP geolocation) aims to determine the physical (geographic) location of Internet users and devices. It is currently proposed or in use for a wide variety of purposes, including targeted marketing, restricting digital content sales to authorized jurisdictions, and security applications such as reducing credit card fraud. This… (More)

- James A. Muir, Douglas R. Stinson
- Appl. Algebra Eng. Commun. Comput.
- 2006

So-called nonadjacent representations are commonly used in elliptic curve cryptography to facilitate computing a scalar multiple of a point on an elliptic curve. A nonadjacent representation having few non-zero coefficients would further speed up the computations. However, any attempt to use these techniques must also consider the impact on the security of… (More)

- Clemens Heuberger, James A. Muir
- J. Mathematical Cryptology
- 2006

Redundant number systems (e.g., signed binary representations) have been utilized to efficiently implement algebraic operations required by public-key cryptosystems, especially those based on elliptic curves. Several families of integer representations have been proposed that have a minimal number of nonzero digits (so-called minimal weight… (More)