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.

QC Algorithms: Faster Calculation of Prime Numbers, Breaking RSA-2048 Key

2 pointsby bullaover 1 year ago

1 comment

jjgreenover 1 year ago
You&#x27;ve been trolled: There&#x27;s a nice comment (by clipsy) on an earlier submission [1]<p><i>Absolute looney toons garbage. Check the list of previous publications and you&#x27;ll find that in the past 3 months(!) the author claims to have broken RSA, disproved the existence of dark matter, and shown that irrational and complex numbers do not exist.</i><p>Good of clipsy to do that research, as soon as I found that he calls himself &quot;Ed Gerck, PhD, PhD&quot; [2] I laughed and walked away.<p>[1] <a href="https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=38092272">https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=38092272</a><p>[2] <a href="https:&#x2F;&#x2F;www.linkedin.com&#x2F;in&#x2F;edgerck" rel="nofollow noreferrer">https:&#x2F;&#x2F;www.linkedin.com&#x2F;in&#x2F;edgerck</a>