Hacker News new | ask | show | jobs
Univariate Coppersmith Algorithm (boogiemath.org)
12 points by boogiemath 688 days ago
1 comments

The mind-boggling thing (to me) about this algorithm is that it also works to find small solutions modulo unknown factors of N. This makes it really useful for finding factors of N given knowledge of some of the bits (for example, if part of a private key is leaked in a screenshot, or through improper redaction).