top | item 41130693

Univariate Coppersmith Algorithm

12 points| boogiemath | 1 year ago |boogiemath.org

1 comment

order

nneonneo|1 year ago

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).