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

科技回声

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

GitHubTwitter

首页

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

资源链接

HackerNews API原版 HackerNewsNext.js

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

Encryption Security May Not Be Secure Anymore (Possible AES Crack)

11 点作者 emilong将近 9 年前

8 条评论

moyix将近 9 年前
Seems <i>very</i> dubious:<p>* As one poster mentioned, as far as I know factoring has nothing at all to do with AES.<p>* Mentions of it have previously been cropping up on conspiracy theory sites: <a href="http:&#x2F;&#x2F;www.abovetopsecret.com&#x2F;forum&#x2F;thread1120355&#x2F;pg1" rel="nofollow">http:&#x2F;&#x2F;www.abovetopsecret.com&#x2F;forum&#x2F;thread1120355&#x2F;pg1</a><p>* Nothing on the University of Toronto&#x27;s press office page: <a href="http:&#x2F;&#x2F;media.utoronto.ca&#x2F;media-releases&#x2F;" rel="nofollow">http:&#x2F;&#x2F;media.utoronto.ca&#x2F;media-releases&#x2F;</a><p>* Terms like &quot;Quadratic Curves embodied within numeric sentences such as Fibonacci Sequences, Non-Evenly Divisible Values including PI, Catalan Numbers, Mersenne Primes&quot; set off my crank mathematics alarms pretty badly.<p>* ACA doesn&#x27;t seem to have a section for presenting abstracts. Possibly they meant a poster? It can&#x27;t be a full paper, because acceptance notification for that isn&#x27;t until July 13th, 2016 (<a href="http:&#x2F;&#x2F;www.mathematik.uni-kassel.de&#x2F;ACA2016&#x2F;images&#x2F;poster.pdf" rel="nofollow">http:&#x2F;&#x2F;www.mathematik.uni-kassel.de&#x2F;ACA2016&#x2F;images&#x2F;poster.pd...</a>)
评论 #11873539 未加载
carey将近 9 年前
Is there <i>any</i> source for this that&#x27;s less dodgy? Is it any different from the known weaknesses in the key derivation for AES-256?
评论 #11872995 未加载
评论 #11872910 未加载
zephyrthenoble将近 9 年前
The &quot;press release&quot; links to here: <a href="http:&#x2F;&#x2F;www.mathematik.uni-kassel.de&#x2F;ACA2016&#x2F;" rel="nofollow">http:&#x2F;&#x2F;www.mathematik.uni-kassel.de&#x2F;ACA2016&#x2F;</a> which is definitely not the University of Toronto&#x27;s Math or CS department page.
评论 #11873060 未加载
评论 #11873034 未加载
dmfdmf将近 9 年前
Setting aside if this is true or not (and my gut feeling is that it is not), given the widespread impact of an AES or RSA crack what should one do with such knowledge? It seems irresponsible to just publish it and let the chips fall. On the other hand if you&#x27;ve spent your entire career in the field such a breakthrough would be the ultimate achievement and would expand your career opportunities a thousandfold and it would be very difficult to keep it to yourself or a handful of colleagues sworn to secrecy.
ComputerGuru将近 9 年前
Way too vague. It talks about the output of the AES block algorithm being definitively non-random for certain inputs but then talks about factoring integers which has nothing to do with symmetric transforms.<p>I&#x27;d (obviously) question their code, the implementations of their algorithms, etc. instead. Also, no university I know publishes results like this instead of in a respectable journal. If you really wanted to be fancy, you&#x27;d call a press conference, not some dodgy PR news service.
bedros将近 9 年前
Integer factoring has nothing to do with AES Crack. Are they talking about RSA?
DKnoll将近 9 年前
Here are all UofT press releases: <a href="http:&#x2F;&#x2F;media.utoronto.ca&#x2F;media-releases&#x2F;" rel="nofollow">http:&#x2F;&#x2F;media.utoronto.ca&#x2F;media-releases&#x2F;</a><p>Note that this is nowhere to be seen.
dendisuhubdy将近 9 年前
Can anybody confirm this?