 | 2011 |
| 29 |  | Daniel R. L. Brown:
Identity-Based Decryption.
IACR Cryptology ePrint Archive 2011: 266 (2011) |
| 28 |  | Daniel R. L. Brown:
Formally Assessing Cryptographic Entropy.
IACR Cryptology ePrint Archive 2011: 659 (2011) |
| 2010 |
| 27 |  | Daniel R. L. Brown:
Stange's Elliptic Nets and Coxeter Group F4.
IACR Cryptology ePrint Archive 2010: 161 (2010) |
| 26 |  | Daniel R. L. Brown:
Lower Bounds for Straight Line Factoring.
IACR Cryptology ePrint Archive 2010: 47 (2010) |
| 2009 |
| 25 |  | Daniel R. L. Brown,
Matthew J. Campagna,
Scott A. Vanstone:
Security of ECQV-Certified ECDSA Against Passive Adversaries.
IACR Cryptology ePrint Archive 2009: 620 (2009) |
| 2008 |
| 24 |  | Daniel R. L. Brown:
The Encrypted Elliptic Curve Hash.
IACR Cryptology ePrint Archive 2008: 12 (2008) |
| 23 |  | Daniel R. L. Brown:
Toy Factoring by Newton's Method.
IACR Cryptology ePrint Archive 2008: 149 (2008) |
| 22 |  | Daniel R. L. Brown:
User-Sure-and-Safe Key Retrieval.
IACR Cryptology ePrint Archive 2008: 190 (2008) |
| 21 |  | Daniel R. L. Brown:
One-Up Problem for (EC)DSA.
IACR Cryptology ePrint Archive 2008: 286 (2008) |
| 2007 |
| 20 |  | Daniel R. L. Brown,
Kristian Gjøsteen:
A Security Analysis of the NIST SP 800-90 Elliptic Curve Random Number Generator.
CRYPTO 2007: 466-481 |
| 19 |  | Daniel R. L. Brown:
Irreducibility to the One-More Evaluation Problems: More May Be Less.
IACR Cryptology ePrint Archive 2007: 435 (2007) |
| 18 |  | Daniel R. L. Brown,
Kristian Gjøsteen:
A Security Analysis of the NIST SP 800-90 Elliptic Curve Random Number Generator.
IACR Cryptology ePrint Archive 2007: 48 (2007) |
| 17 |  | Daniel R. L. Brown,
David M. Jackson:
A rooted map invariant, non-orientability and Jack symmetric functions.
J. Comb. Theory, Ser. B 97(3): 430-452 (2007) |
| 2006 |
| 16 |  | Daniel R. L. Brown:
Conjectured Security of the ANSI-NIST Elliptic Curve RNG.
IACR Cryptology ePrint Archive 2006: 117 (2006) |
| 15 |  | Daniel R. L. Brown:
Multi-Dimensional Montgomery Ladders for Elliptic Curves.
IACR Cryptology ePrint Archive 2006: 220 (2006) |
| 14 |  | Daniel R. L. Brown:
What Hashes Make RSA-OAEP Secure?
IACR Cryptology ePrint Archive 2006: 223 (2006) |
| 2005 |
| 13 |  | Adrian Antipa,
Daniel R. L. Brown,
Robert P. Gallant,
Robert J. Lambert,
René Struik,
Scott A. Vanstone:
Accelerated Verification of ECDSA Signatures.
Selected Areas in Cryptography 2005: 307-318 |
| 12 |  | Daniel R. L. Brown:
Generic Groups, Collision Resistance, and ECDSA.
Des. Codes Cryptography 35(1): 119-152 (2005) |
| 11 |  | Daniel R. L. Brown:
A Weak-Randomizer Attack on RSA-OAEP with e = 3.
IACR Cryptology ePrint Archive 2005: 189 (2005) |
| 10 |  | Daniel R. L. Brown:
On Finding Roots Without Factoring and A Special Purpose Factoring Algorithm.
IACR Cryptology ePrint Archive 2005: 208 (2005) |
| 9 |  | Daniel R. L. Brown:
Breaking RSA May Be As Difficult As Factoring.
IACR Cryptology ePrint Archive 2005: 380 (2005) |
| 8 |  | Daniel R. L. Brown:
Prompted User Retrieval of Secret Entropy: The Passmaze Protocol.
IACR Cryptology ePrint Archive 2005: 434 (2005) |
| 7 |  | Daniel R. L. Brown:
Deniable Authentication with RSA and Multicasting.
IACR Cryptology ePrint Archive 2005: 56 (2005) |
| 2004 |
| 6 |  | Daniel R. L. Brown,
Robert P. Gallant:
The Static Diffie-Hellman Problem.
IACR Cryptology ePrint Archive 2004: 306 (2004) |
| 2003 |
| 5 |  | Adrian Antipa,
Daniel R. L. Brown,
Alfred Menezes,
René Struik,
Scott A. Vanstone:
Validation of Elliptic Curve Public Keys.
Public Key Cryptography 2003: 211-223 |
| 2002 |
| 4 |  | Daniel R. L. Brown:
Generic Groups, Collision Resistance, and ECDSA.
IACR Cryptology ePrint Archive 2002: 26 (2002) |
| 3 |  | Daniel R. L. Brown,
David M. Jackson:
The Quadrangulation Conjecture for Orientable Surfaces.
J. Comb. Theory, Ser. B 86(1): 54-79 (2002) |
| 2001 |
| 2 |  | Daniel R. L. Brown,
Donald Byron Johnson:
Formal Security Proofs for a Signature Scheme with Partial Message Recovery.
CT-RSA 2001: 126-142 |
| 1 |  | Daniel R. L. Brown,
Robert P. Gallant,
Scott A. Vanstone:
Provably Secure Implicit Certificate Schemes.
Financial Cryptography 2001: 147-156 |