Daniel R. L. Brown

发表

Provably Secure Implicit Certificate Schemes

Scott A. Vanstone, Daniel R. L. Brown, Robert P. Gallant, 2002, Financial Cryptography.

On Finding Roots Without Factoring and A Special Purpose Factoring Algorithm

Daniel R. L. Brown, 2005, IACR Cryptol. ePrint Arch..

One-Up Problem for (EC)DSA

Daniel R. L. Brown, 2008, IACR Cryptol. ePrint Arch..

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

Daniel R. L. Brown, 2005, IACR Cryptol. ePrint Arch..

Uniform Compression Functions Can Fail to Preserve "Full" Entropy

Daniel R. L. Brown, 2012, IACR Cryptol. ePrint Arch..

An optimist's Poisson model of cryptanalysis

Daniel R. L. Brown, 2019, IACR Cryptol. ePrint Arch..

Security of ECQV-Certified ECDSA Against Passive Adversaries

Scott A. Vanstone, Matthew J. Campagna, Daniel R. L. Brown, 2009, IACR Cryptol. ePrint Arch..

Identity-Based Decryption

Daniel R. L. Brown, 2011, IACR Cryptol. ePrint Arch..

Formally Assessing Cryptographic Entropy

Daniel R. L. Brown, 2011, IACR Cryptol. ePrint Arch..

User-Sure-and-Safe Key Retrieval

Daniel R. L. Brown, 2008, IACR Cryptol. ePrint Arch..

The Static Diffie-Hellman Problem

Daniel R. L. Brown, Robert P. Gallant, Daniel R. L. Brown, 2004, IACR Cryptology ePrint Archive.

Conjectured Security of the ANSI-NIST Elliptic Curve RNG

Daniel R. L. Brown, 2006, IACR Cryptol. ePrint Arch..

Generic Groups, Collision Resistance, and ECDSA

Daniel R. L. Brown, 2002, Des. Codes Cryptogr..

Signatures sur courbes elliptiques de Pinstov et Vanstone avec récupération authentifiée de message

Daniel R. L. Brown, Matthew John Campagna, Gregory Marc Zaverucha, 2011 .

Signatures avec recuperation de message confidentiel

Scott A. Vanstone, Daniel R. L. Brown, Matthew John Campagna, 2008 .

Updates for RSAES-OAEP and RSASSA-PSS Algorithm Parameters

Russ Housley, Sean Turner, Daniel R. L. Brown, 2010, RFC.

Rolling up sleeves when subversion's in a field?

Daniel R. L. Brown, 2020, IACR Cryptol. ePrint Arch..

Bounds on surmising remixed keys

Daniel R. L. Brown, Daniel R. L. Brown, 2015, IACR Cryptol. ePrint Arch..

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

Daniel R. L. Brown, 2015, IACR Cryptol. ePrint Arch..

A flaw in a theorem about Schnorr signatures

Daniel R. L. Brown, Daniel R. L. Brown, 2015, IACR Cryptol. ePrint Arch..

Lower Bounds for Straight Line Factoring

Daniel R. L. Brown, 2010, IACR Cryptol. ePrint Arch..

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

Simon Blake-Wilson, Paul Lambert, Daniel R. L. Brown, 2002, RFC.

Prompted User Retrieval of Secret Entropy: The Passmaze Protocol

Daniel R. L. Brown, Daniel R. L. Brown, 2005, IACR Cryptol. ePrint Arch..

Multi-Dimensional Montgomery Ladders for Elliptic Curves

Daniel R. L. Brown, 2006, IACR Cryptol. ePrint Arch..

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

Daniel R. L. Brown, Daniel R. L. Brown, 2014, IACR Cryptol. ePrint Arch..

Modal Analysis as a Bridge Monitoring Tool, #399

Ahmet E. Aktan, Victor J. Hunt, M. Lenett, 1999 .

The Quadrangulation Conjecture for Orientable Surfaces

Daniel R. L. Brown, David M. Jackson, D. Jackson, 2002, J. Comb. Theory, Ser. B.

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

Daniel R. L. Brown, David M. Jackson, 2007, J. Comb. Theory, Ser. B.

Breaking RSA May Be As Difficult As Factoring

Daniel R. L. Brown, Daniel R. L. Brown, 2014, Journal of Cryptology.

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

Daniel R. L. Brown, 2014, IACR Cryptol. ePrint Arch..

Elliptic Curve Private Key Structure

Sean Turner, Daniel R. L. Brown, Daniel R. L. Brown, 2010, RFC.

Identification de fréquence radio authentifiée et système de distribution de clé correspondant

Scott A. Vanstone, Randy Tsang, Daniel R. L. Brown, 2007 .

What Hashes Make RSA-OAEP Secure?

Daniel R. L. Brown, 2006, IACR Cryptol. ePrint Arch..

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

Daniel R. L. Brown, Daniel R. L. Brown, 2007, IACR Cryptol. ePrint Arch..

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

Kristian Gjøsteen, Daniel R. L. Brown, Daniel R. L. Brown, 2007, CRYPTO.

Signaturen mit wiedergewinnung vertraulicher nachrichten

Scott A. Vanstone, Daniel R. L. Brown, Matthew John Campagna, 2008 .

Formal Security Proofs for a Signature Scheme with Partial Message Recovery

Donald Byron Johnson, Daniel R. L. Brown, 2001, CT-RSA.

Toy Factoring by Newton's Method

Daniel R. L. Brown, 2008, IACR Cryptol. ePrint Arch..

RKHD ElGamal signing and 1-way sums

Daniel R. L. Brown, 2018, IACR Cryptol. ePrint Arch..

Elliptic Curve Cryptography Subject Public Key Information

Russ Housley, Sean Turner, Daniel R. L. Brown, 2009, RFC.

Alternative cubics' rules with an algebraic appeal

Daniel R. L. Brown, 2015, IACR Cryptol. ePrint Arch..

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

Stefan Santesson, Daniel R. L. Brown, Quynh Dang, 2010, RFC.

Verbindung von Daten mit einer ECDSA-Signaturkomponente

Scott A. Vanstone, Herbert A. Little, Daniel R. L. Brown, 2011 .

Deniable Authentication with RSA and Multicasting

Daniel R. L. Brown, 2005, IACR Cryptol. ePrint Arch..

The Encrypted Elliptic Curve Hash

Daniel R. L. Brown, 2008, IACR Cryptol. ePrint Arch..

Accelerated Verification of ECDSA Signatures

Scott A. Vanstone, Daniel R. L. Brown, Robert P. Gallant, 2005, Selected Areas in Cryptography.

ECC mod 8^91+5

Daniel R. L. Brown, 2018, IACR Cryptol. ePrint Arch..