TE
科技回声
首页24小时热榜最新最佳问答展示工作
GitHubTwitter
首页

科技回声

基于 Next.js 构建的科技新闻平台,提供全球科技新闻和讨论内容。

GitHubTwitter

首页

首页最新最佳问答展示工作

资源链接

HackerNews API原版 HackerNewsNext.js

© 2025 科技回声. 版权所有。

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

2 点作者 bulla超过 1 年前

1 comment

jjgreen超过 1 年前
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>