We stand with Ukraine

We stand with Ukraine

Daniel R. L. Brown

According to our database¹, Daniel R. L. Brown authored at least 54 papers between 2001 and 2023.

Collaborative distances:

Dijkstra number² of five.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2023

Plactic key agreement (insecure?).

[BibT_eX]

[DOI]

Daniel R. L. Brown

J. Math. Cryptol., 2023

More forging (and patching) of tropical signatures.

[BibT_eX]

[DOI]

Daniel R. L. Brown

,

IACR Cryptol. ePrint Arch., 2023

Failed crypto: Matrices over non-standard arithmetic.

[BibT_eX]

[DOI]

Daniel R. L. Brown

IACR Cryptol. ePrint Arch., 2023

Cryptanalysis of a key agreement scheme using determinants and rectangular matrices.

[BibT_eX]

[DOI]

Daniel R. L. Brown

IACR Cryptol. ePrint Arch., 2023

2022

Rolling up lattice cryptography primes.

[BibT_eX]

[DOI]

Daniel R. L. Brown

IACR Cryptol. ePrint Arch., 2022

2021

Cryptanalysis of 'MAKE'.

[BibT_eX]

[DOI]

Daniel R. L. Brown

,

,

Jason T. LeGrow

IACR Cryptol. ePrint Arch., 2021

Key agreement: security / division.

[BibT_eX]

[DOI]

Daniel R. L. Brown

IACR Cryptol. ePrint Arch., 2021

Plactic signatures.

[BibT_eX]

[DOI]

Daniel R. L. Brown

IACR Cryptol. ePrint Arch., 2021

Plactic key agreement.

[BibT_eX]

[DOI]

Daniel R. L. Brown

IACR Cryptol. ePrint Arch., 2021

Layering diverse cryptography to lower future secret attack risks: post-quantum estimates.

[BibT_eX]

[DOI]

Daniel R. L. Brown

IACR Cryptol. ePrint Arch., 2021

GLV+HWCD for 2y^2=x^3+x/GF(8^91+5).

[BibT_eX]

[DOI]

Daniel R. L. Brown

IACR Cryptol. ePrint Arch., 2021

2020

Rolling up sleeves when subversion's in a field?

[BibT_eX]

[DOI]

Daniel R. L. Brown

IACR Cryptol. ePrint Arch., 2020

2019

An optimist's Poisson model of cryptanalysis.

[BibT_eX]

[DOI]

Daniel R. L. Brown

IACR Cryptol. ePrint Arch., 2019

2018

RKHD ElGamal signing and 1-way sums.

[BibT_eX]

[DOI]

Daniel R. L. Brown

IACR Cryptol. ePrint Arch., 2018

ECC mod 8^91+5.

[BibT_eX]

[DOI]

Daniel R. L. Brown

IACR Cryptol. ePrint Arch., 2018

2016

Breaking RSA May Be As Difficult As Factoring.

[BibT_eX]

[DOI]

Daniel R. L. Brown

J. Cryptol., 2016

2015

Alternative cubics' rules with an algebraic appeal.

[BibT_eX]

[DOI]

Daniel R. L. Brown

IACR Cryptol. ePrint Arch., 2015

A flaw in a theorem about Schnorr signatures.

[BibT_eX]

[DOI]

Daniel R. L. Brown

IACR Cryptol. ePrint Arch., 2015

Bounds on surmising remixed keys.

[BibT_eX]

[DOI]

Daniel R. L. Brown

IACR Cryptol. ePrint Arch., 2015

Short Schnorr signatures require a hash function with more than just random-prefix resistance.

[BibT_eX]

[DOI]

Daniel R. L. Brown

IACR Cryptol. ePrint Arch., 2015

2014

CM55: special prime-field elliptic curves almost optimizing den Boer's reduction between Diffie-Hellman and discrete logs.

[BibT_eX]

[DOI]

Daniel R. L. Brown

IACR Cryptol. ePrint Arch., 2014

Some Theoretical Conditions for Menezes-Qu-Vanstone Key Agreement to Provide Implicit Key Authentication.

[BibT_eX]

[DOI]

Daniel R. L. Brown

IACR Cryptol. ePrint Arch., 2014

2012

Uniform Compression Functions Can Fail to Preserve "Full" Entropy.

[BibT_eX]

[DOI]

Daniel R. L. Brown

IACR Cryptol. ePrint Arch., 2012

2011

Formally Assessing Cryptographic Entropy.

[BibT_eX]

[DOI]

Daniel R. L. Brown

IACR Cryptol. ePrint Arch., 2011

Identity-Based Decryption.

[BibT_eX]

[DOI]

Daniel R. L. Brown

IACR Cryptol. ePrint Arch., 2011

2010

Elliptic Curve Private Key Structure.

[BibT_eX]

[DOI]

,

Daniel R. L. Brown

RFC, June, 2010

Internet X.509 Public Key Infrastructure: Additional Algorithms and Identifiers for DSA and ECDSA.

[BibT_eX]

[DOI]

,

Stefan Santesson

,

Kathleen M. Moriarty

,

Daniel R. L. Brown

,

RFC, January, 2010

Updates for RSAES-OAEP and RSASSA-PSS Algorithm Parameters.

[BibT_eX]

[DOI]

,

Daniel R. L. Brown

,

,

,

RFC, January, 2010

Use of Elliptic Curve Cryptography (ECC) Algorithms in Cryptographic Message Syntax (CMS).

[BibT_eX]

[DOI]

,

Daniel R. L. Brown

RFC, January, 2010

Stange's Elliptic Nets and Coxeter Group F4.

[BibT_eX]

[DOI]

Daniel R. L. Brown

IACR Cryptol. ePrint Arch., 2010

Lower Bounds for Straight Line Factoring.

[BibT_eX]

[DOI]

Daniel R. L. Brown

IACR Cryptol. ePrint Arch., 2010

2009

Elliptic Curve Cryptography Subject Public Key Information.

[BibT_eX]

[DOI]

,

Daniel R. L. Brown

,

,

,

RFC, March, 2009

Security of ECQV-Certified ECDSA Against Passive Adversaries.

[BibT_eX]

[DOI]

Daniel R. L. Brown

,

Matthew J. Campagna

,

Scott A. Vanstone

IACR Cryptol. ePrint Arch., 2009

2008

One-Up Problem for (EC)DSA.

[BibT_eX]

[DOI]

Daniel R. L. Brown

IACR Cryptol. ePrint Arch., 2008

User-Sure-and-Safe Key Retrieval.

[BibT_eX]

[DOI]

Daniel R. L. Brown

IACR Cryptol. ePrint Arch., 2008

Toy Factoring by Newton's Method.

[BibT_eX]

[DOI]

Daniel R. L. Brown

IACR Cryptol. ePrint Arch., 2008

The Encrypted Elliptic Curve Hash.

[BibT_eX]

[DOI]

Daniel R. L. Brown

IACR Cryptol. ePrint Arch., 2008

2007

A rooted map invariant, non-orientability and Jack symmetric functions.

[BibT_eX]

[DOI]

Daniel R. L. Brown

,

David M. Jackson

J. Comb. Theory, Ser. B, 2007

A Security Analysis of the NIST SP 800-90 Elliptic Curve Random Number Generator.

[BibT_eX]

[DOI]

Daniel R. L. Brown

,

Kristian Gjøsteen

IACR Cryptol. ePrint Arch., 2007

Irreducibility to the One-More Evaluation Problems: More May Be Less.

[BibT_eX]

[DOI]

Daniel R. L. Brown

IACR Cryptol. ePrint Arch., 2007

2006

What Hashes Make RSA-OAEP Secure?

[BibT_eX]

[DOI]

Daniel R. L. Brown

IACR Cryptol. ePrint Arch., 2006

Multi-Dimensional Montgomery Ladders for Elliptic Curves.

[BibT_eX]

[DOI]

Daniel R. L. Brown

IACR Cryptol. ePrint Arch., 2006

Conjectured Security of the ANSI-NIST Elliptic Curve RNG.

[BibT_eX]

[DOI]

Daniel R. L. Brown

IACR Cryptol. ePrint Arch., 2006

2005

Prompted User Retrieval of Secret Entropy: The Passmaze Protocol.

[BibT_eX]

[DOI]

Daniel R. L. Brown

IACR Cryptol. ePrint Arch., 2005

A Weak-Randomizer Attack on RSA-OAEP with e = 3.

[BibT_eX]

[DOI]

Daniel R. L. Brown

IACR Cryptol. ePrint Arch., 2005

Deniable Authentication with RSA and Multicasting.

[BibT_eX]

[DOI]

Daniel R. L. Brown

IACR Cryptol. ePrint Arch., 2005

Generic Groups, Collision Resistance, and ECDSA.

[BibT_eX]

[DOI]

Daniel R. L. Brown

Des. Codes Cryptogr., 2005

Accelerated Verification of ECDSA Signatures.

[BibT_eX]

[DOI]

,

Daniel R. L. Brown

,

Robert P. Gallant

,

Robert J. Lambert

,

,

Scott A. Vanstone

Proceedings of the Selected Areas in Cryptography, 12th International Workshop, 2005

2004

The Static Diffie-Hellman Problem.

[BibT_eX]

[DOI]

Daniel R. L. Brown

,

Robert P. Gallant

IACR Cryptol. ePrint Arch., 2004

2003

Validation of Elliptic Curve Public Keys.

[BibT_eX]

[DOI]

,

Daniel R. L. Brown

,

,

,

Scott A. Vanstone

Proceedings of the Public Key Cryptography, 2003

2002

Use of Elliptic Curve Cryptography (ECC) Algorithms in Cryptographic Message Syntax (CMS).

[BibT_eX]

[DOI]

Simon Blake-Wilson

,

Daniel R. L. Brown

,

RFC, April, 2002

The Quadrangulation Conjecture for Orientable Surfaces.

[BibT_eX]

[DOI]

Daniel R. L. Brown

,

David M. Jackson

J. Comb. Theory, Ser. B, 2002

2001

Provably Secure Implicit Certificate Schemes.

[BibT_eX]

[DOI]

Daniel R. L. Brown

,

Robert P. Gallant

,

Scott A. Vanstone

Proceedings of the Financial Cryptography, 2001

Formal Security Proofs for a Signature Scheme with Partial Message Recovery.

[BibT_eX]

[DOI]

Daniel R. L. Brown

,

Proceedings of the Topics in Cryptology, 2001

Loading...