Don Coppersmith
E663909
Don Coppersmith is an American mathematician and cryptographer known for his influential work in number theory, lattice-based methods, and the design and cryptanalysis of IBM and RSA cryptographic systems.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Don Coppersmith canonical | 1 |
Statements (43)
| Predicate | Object |
|---|---|
| instanceOf |
human
ⓘ
mathematician ⓘ |
| affiliation | IBM Research NERFINISHED ⓘ |
| countryOfCitizenship | United States of America ⓘ |
| employer | IBM NERFINISHED ⓘ |
| fieldOfWork |
cryptography
ⓘ
lattice-based cryptography ⓘ mathematics ⓘ number theory ⓘ |
| hasContribution |
improvements to algorithms in algebraic number theory
ⓘ
methods for finding small solutions to polynomial congruences ⓘ techniques for attacking RSA with partial key exposure ⓘ techniques for attacking RSA with small secret exponents ⓘ use of lattice basis reduction in cryptanalysis ⓘ |
| hasResearchArea |
algorithmic number theory
ⓘ
computational complexity aspects of cryptography ⓘ modular arithmetic algorithms ⓘ public-key cryptosystems ⓘ |
| influenced |
design of modern public-key cryptosystems
ⓘ
development of lattice-based cryptanalysis ⓘ security parameter choices for RSA ⓘ |
| knownFor |
applications of lattice reduction to cryptography
ⓘ
cryptanalysis of RSA ⓘ design of cryptographic algorithms at IBM ⓘ lattice-based methods in cryptanalysis ⓘ work on discrete logarithm problems ⓘ work on factoring-related algorithms ⓘ work on fast algorithms in number theory ⓘ |
| notableFor |
impact on practical cryptographic security guidelines
ⓘ
influential contributions to lattice-based cryptanalysis ⓘ influential contributions to public-key cryptography ⓘ influential contributions to the security analysis of RSA ⓘ |
| notableWork |
Coppersmith method
NERFINISHED
ⓘ
Coppersmith’s algorithm for finding small roots of bivariate modular equations NERFINISHED ⓘ Coppersmith’s algorithm for finding small roots of univariate modular equations NERFINISHED ⓘ Coppersmith’s attack on RSA with small decryption exponent NERFINISHED ⓘ papers on fast arithmetic algorithms ⓘ papers on lattice-based attacks on RSA ⓘ papers on number-theoretic algorithms for cryptography ⓘ papers on small-exponent RSA vulnerabilities ⓘ |
| occupation |
cryptographic researcher
ⓘ
research scientist ⓘ |
| workedAt | IBM Thomas J. Watson Research Center NERFINISHED ⓘ |
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.