TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

Low-exponent attack on RSA: an example

4 pointsby rdpintqogeogsaaabout 3 years ago

1 comment

jwilkabout 3 years ago
&gt; we can still recover mᵉ = m⁶⁵⁵³⁷, but finding m would be much harder, if possible at all<p>On my (low-end) machine, I can compute 65537th power of a 4096-bit message in ~4 seconds. So just throwing binary search at the problem would give me the answer in 5 hours or so. There are more sophisticated root-finding algorithms that would be likely much faster.
评论 #31393093 未加载