The following pages link to Daniel R. L. Brown (Q271593):
Displaying 12 items.
- Breaking RSA may be as difficult as factoring (Q271594) (← links)
- (Q875946) (redirect page) (← links)
- A rooted map invariant, non-orientability and Jack symmetric functions (Q875947) (← links)
- The quadrangulation conjecture for orientable surfaces (Q1850623) (← links)
- Cryptanalysis of ``MAKE'' (Q2114537) (← links)
- Generic groups, collision resistance, and ECDSA (Q2572964) (← links)
- Plactic key agreement (insecure?) (Q2689206) (← links)
- (Q2724433) (← links)
- A Security Analysis of the NIST SP 800-90 Elliptic Curve Random Number Generator (Q3612565) (← links)
- Validation of Elliptic Curve Public Keys (Q4414710) (← links)
- (Q4739514) (← links)
- Accelerated Verification of ECDSA Signatures (Q5426199) (← links)
