Daniel R. L. Brown

International Association for Cryptologic Research

Daniel R. L. Brown Search web for home page

	year	title	booktitle	pages
1	2010	Stange's Elliptic Nets and Coxeter Group F4	eprint	online
2	2010	Lower Bounds for Straight Line Factoring	eprint	online
3	2008	The Encrypted Elliptic Curve Hash	eprint	online
4	2008	One-Up Problem for (EC)DSA	eprint	online
5	2008	Toy Factoring by Newton's Method	eprint	online
6	2008	User-Sure-and-Safe Key Retrieval	eprint	online
7	2007	A Security Analysis of the NIST SP 800-90 Elliptic Curve Random Number Generator	eprint	online
8	2007	A Security Analysis of the NIST SP 800-90 Elliptic Curve Random Number Generator	crypto	466-481
9	2007	Irreducibility to the One-More Evaluation Problems: More May Be Less	eprint	online
10	2006	Conjectured Security of the ANSI-NIST Elliptic Curve RNG	eprint	online
11	2006	Multi-Dimensional Montgomery Ladders for Elliptic Curves	eprint	online
12	2006	What Hashes Make RSA-OAEP Secure?	eprint	online
13	2005	Deniable Authentication with RSA and Multicasting	eprint	online
14	2005	Breaking RSA May Be As Difficult As Factoring	eprint	online
15	2005	Prompted User Retrieval of Secret Entropy: The Passmaze Protocol	eprint	online
16	2005	A Weak-Randomizer Attack on RSA-OAEP with e = 3	eprint	online
17	2005	On Finding Roots Without Factoring and A Special Purpose Factoring Algorithm	eprint	online
18	2004	The Static Diffie-Hellman Problem	eprint	online
19	2003	Validation of Elliptic Curve Public Keys	pkc	211-223
20	2002	Generic Groups, Collision Resistance, and ECDSA	eprint	online