Techniqueresearch
Coppersmith's method
Also called Coppersmith's theorem, Coppersmith's theorem for small roots.
Uses lattice reduction to find small integer roots of modular or integer polynomials.
Uses lattice reduction to find small integer roots of modular or integer polynomials.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag TWEX4X Edit this page History Report an error