default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel R. L. Brown
Person information
- affiliation: BlackBerry, Mississauga, ON, Canada
- affiliation: Certicom Corp, Mississauga, ON, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j6]Daniel R. L. Brown:
Plactic key agreement (insecure?). J. Math. Cryptol. 17(1) (2023)- [i47]Daniel R. L. Brown:
Cryptanalysis of a key agreement scheme using determinants and rectangular matrices. IACR Cryptol. ePrint Arch. 2023: 188 (2023) - [i46]Daniel R. L. Brown, Chris Monico:
More forging (and patching) of tropical signatures. IACR Cryptol. ePrint Arch. 2023: 1837 (2023) - [i45]Daniel R. L. Brown:
Failed crypto: Matrices over non-standard arithmetic. IACR Cryptol. ePrint Arch. 2023: 1910 (2023) - 2022
- [j5]Daniel R. L. Brown, Neal Koblitz, Jason T. LeGrow
:
Cryptanalysis of "MAKE". J. Math. Cryptol. 16(1): 98-102 (2022) - [i44]Daniel R. L. Brown:
Rolling up lattice cryptography primes. IACR Cryptol. ePrint Arch. 2022: 329 (2022) - 2021
- [i43]Daniel R. L. Brown:
GLV+HWCD for 2y^2=x^3+x/GF(8^91+5). IACR Cryptol. ePrint Arch. 2021: 383 (2021) - [i42]Daniel R. L. Brown, Neal Koblitz, Jason T. LeGrow:
Cryptanalysis of 'MAKE'. IACR Cryptol. ePrint Arch. 2021: 465 (2021) - [i41]Daniel R. L. Brown:
Layering diverse cryptography to lower future secret attack risks: post-quantum estimates. IACR Cryptol. ePrint Arch. 2021: 608 (2021) - [i40]Daniel R. L. Brown:
Plactic key agreement. IACR Cryptol. ePrint Arch. 2021: 625 (2021) - [i39]Daniel R. L. Brown:
Plactic signatures. IACR Cryptol. ePrint Arch. 2021: 938 (2021) - [i38]Daniel R. L. Brown:
Key agreement: security / division. IACR Cryptol. ePrint Arch. 2021: 1112 (2021) - 2020
- [i37]Daniel R. L. Brown:
Rolling up sleeves when subversion's in a field? IACR Cryptol. ePrint Arch. 2020: 74 (2020)
2010 – 2019
- 2019
- [i36]Daniel R. L. Brown:
An optimist's Poisson model of cryptanalysis. IACR Cryptol. ePrint Arch. 2019: 1465 (2019) - 2018
- [i35]Daniel R. L. Brown:
ECC mod 8^91+5. IACR Cryptol. ePrint Arch. 2018: 121 (2018) - [i34]Daniel R. L. Brown:
RKHD ElGamal signing and 1-way sums. IACR Cryptol. ePrint Arch. 2018: 186 (2018) - 2016
- [j4]Daniel R. L. Brown:
Breaking RSA May Be As Difficult As Factoring. J. Cryptol. 29(1): 220-241 (2016) - 2015
- [i33]Daniel R. L. Brown:
Short Schnorr signatures require a hash function with more than just random-prefix resistance. IACR Cryptol. ePrint Arch. 2015: 169 (2015) - [i32]Daniel R. L. Brown:
Bounds on surmising remixed keys. IACR Cryptol. ePrint Arch. 2015: 375 (2015) - [i31]Daniel R. L. Brown:
A flaw in a theorem about Schnorr signatures. IACR Cryptol. ePrint Arch. 2015: 509 (2015) - [i30]Daniel R. L. Brown:
Alternative cubics' rules with an algebraic appeal. IACR Cryptol. ePrint Arch. 2015: 544 (2015) - 2014
- [i29]Daniel R. L. Brown:
Some Theoretical Conditions for Menezes-Qu-Vanstone Key Agreement to Provide Implicit Key Authentication. IACR Cryptol. ePrint Arch. 2014: 50 (2014) - [i28]Daniel R. L. Brown:
CM55: special prime-field elliptic curves almost optimizing den Boer's reduction between Diffie-Hellman and discrete logs. IACR Cryptol. ePrint Arch. 2014: 877 (2014) - 2012
- [i27]Daniel R. L. Brown:
Uniform Compression Functions Can Fail to Preserve "Full" Entropy. IACR Cryptol. ePrint Arch. 2012: 665 (2012) - 2011
- [i26]Daniel R. L. Brown:
Identity-Based Decryption. IACR Cryptol. ePrint Arch. 2011: 266 (2011) - [i25]Daniel R. L. Brown:
Formally Assessing Cryptographic Entropy. IACR Cryptol. ePrint Arch. 2011: 659 (2011) - 2010
- [i24]Daniel R. L. Brown:
Lower Bounds for Straight Line Factoring. IACR Cryptol. ePrint Arch. 2010: 47 (2010) - [i23]Daniel R. L. Brown:
Stange's Elliptic Nets and Coxeter Group F4. IACR Cryptol. ePrint Arch. 2010: 161 (2010) - [i22]Sean Turner, Daniel R. L. Brown:
Use of Elliptic Curve Cryptography (ECC) Algorithms in Cryptographic Message Syntax (CMS). RFC 5753: 1-61 (2010) - [i21]Sean Turner, Daniel R. L. Brown, Kelvin Yiu, Russ Housley, Tim Polk:
Updates for RSAES-OAEP and RSASSA-PSS Algorithm Parameters. RFC 5756: 1-6 (2010) - [i20]Quynh Dang, Stefan Santesson, Kathleen M. Moriarty, Daniel R. L. Brown, Tim Polk:
Internet X.509 Public Key Infrastructure: Additional Algorithms and Identifiers for DSA and ECDSA. RFC 5758: 1-8 (2010) - [i19]Sean Turner, Daniel R. L. Brown:
Elliptic Curve Private Key Structure. RFC 5915: 1-7 (2010)
2000 – 2009
- 2009
- [i18]Daniel R. L. Brown, Matthew J. Campagna, Scott A. Vanstone:
Security of ECQV-Certified ECDSA Against Passive Adversaries. IACR Cryptol. ePrint Arch. 2009: 620 (2009) - [i17]Sean Turner, Daniel R. L. Brown, Kelvin Yiu, Russ Housley, Tim Polk:
Elliptic Curve Cryptography Subject Public Key Information. RFC 5480: 1-20 (2009) - 2008
- [i16]Daniel R. L. Brown:
The Encrypted Elliptic Curve Hash. IACR Cryptol. ePrint Arch. 2008: 12 (2008) - [i15]Daniel R. L. Brown:
Toy Factoring by Newton's Method. IACR Cryptol. ePrint Arch. 2008: 149 (2008) - [i14]Daniel R. L. Brown:
User-Sure-and-Safe Key Retrieval. IACR Cryptol. ePrint Arch. 2008: 190 (2008) - [i13]Daniel R. L. Brown:
One-Up Problem for (EC)DSA. IACR Cryptol. ePrint Arch. 2008: 286 (2008) - 2007
- [j3]Daniel R. L. Brown, David M. Jackson:
A rooted map invariant, non-orientability and Jack symmetric functions. J. Comb. Theory B 97(3): 430-452 (2007) - [c5]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 - [i12]Daniel R. L. Brown, Kristian Gjøsteen:
A Security Analysis of the NIST SP 800-90 Elliptic Curve Random Number Generator. IACR Cryptol. ePrint Arch. 2007: 48 (2007) - [i11]Daniel R. L. Brown:
Irreducibility to the One-More Evaluation Problems: More May Be Less. IACR Cryptol. ePrint Arch. 2007: 435 (2007) - 2006
- [i10]Daniel R. L. Brown:
Conjectured Security of the ANSI-NIST Elliptic Curve RNG. IACR Cryptol. ePrint Arch. 2006: 117 (2006) - [i9]Daniel R. L. Brown:
Multi-Dimensional Montgomery Ladders for Elliptic Curves. IACR Cryptol. ePrint Arch. 2006: 220 (2006) - [i8]Daniel R. L. Brown:
What Hashes Make RSA-OAEP Secure? IACR Cryptol. ePrint Arch. 2006: 223 (2006) - 2005
- [j2]Daniel R. L. Brown:
Generic Groups, Collision Resistance, and ECDSA. Des. Codes Cryptogr. 35(1): 119-152 (2005) - [c4]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 - [i7]Daniel R. L. Brown:
Deniable Authentication with RSA and Multicasting. IACR Cryptol. ePrint Arch. 2005: 56 (2005) - [i6]Daniel R. L. Brown:
A Weak-Randomizer Attack on RSA-OAEP with e = 3. IACR Cryptol. ePrint Arch. 2005: 189 (2005) - [i5]Daniel R. L. Brown:
Breaking RSA May Be As Difficult As Factoring. IACR Cryptol. ePrint Arch. 2005: 380 (2005) - [i4]Daniel R. L. Brown:
Prompted User Retrieval of Secret Entropy: The Passmaze Protocol. IACR Cryptol. ePrint Arch. 2005: 434 (2005) - 2004
- [i3]Daniel R. L. Brown, Robert P. Gallant:
The Static Diffie-Hellman Problem. IACR Cryptol. ePrint Arch. 2004: 306 (2004) - 2003
- [c3]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
- [j1]Daniel R. L. Brown, David M. Jackson:
The Quadrangulation Conjecture for Orientable Surfaces. J. Comb. Theory B 86(1): 54-79 (2002) - [i2]Daniel R. L. Brown:
Generic Groups, Collision Resistance, and ECDSA. IACR Cryptol. ePrint Arch. 2002: 26 (2002) - [i1]Simon Blake-Wilson, Daniel R. L. Brown, Paul Lambert:
Use of Elliptic Curve Cryptography (ECC) Algorithms in Cryptographic Message Syntax (CMS). RFC 3278: 1-16 (2002) - 2001
- [c2]Daniel R. L. Brown, Don B. Johnson:
Formal Security Proofs for a Signature Scheme with Partial Message Recovery. CT-RSA 2001: 126-142 - [c1]Daniel R. L. Brown, Robert P. Gallant, Scott A. Vanstone:
Provably Secure Implicit Certificate Schemes. Financial Cryptography 2001: 147-156
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 20:36 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
