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.

Bruteforcing the Devil

46 pointsby Pfifferalmost 11 years ago

11 comments

lunixbochsalmost 11 years ago
I came up with a mutation-based solution to this. Supply any string and it finds a valid hash in as few edits as possible.<p>Example: <a href="http://bochs.info/img/mutation-20140606-024906.png" rel="nofollow">http:&#x2F;&#x2F;bochs.info&#x2F;img&#x2F;mutation-20140606-024906.png</a><p>One could definitely optimize this to be less destructive and produce more pronounceable results. It&#x27;s basically two pieces: an engine for suggesting mutations, and a simple algorithm to score and pick mutations. Changes to either half (vowel distribution, ngrams, etc) could result in better strings.<p>(fyi, this kind of attack is a big reason to use cryptographic hashes: <a href="http://en.wikipedia.org/wiki/Cryptographic_hash_function" rel="nofollow">http:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Cryptographic_hash_function</a>)
评论 #7858503 未加载
na85almost 11 years ago
Aw guys, don&#x27;t go start posting on their site (which I won&#x27;t link) with devil names. Everyone knows communities turn to shit when they get too big and 300 different users posting all with blank icons is going to kill the fun for them.<p>I&#x27;m not even a member of Merveilles but that makes me sad for them.
评论 #7859072 未加载
评论 #7856633 未加载
评论 #7857567 未加载
pedroxalmost 11 years ago
This hash is very weak. You can actually find many preimages of a given hash value in seconds with a meet-in-the-middle attack: <a href="https://gist.github.com/pedrox/eb8d674bf2b8be63da0f" rel="nofollow">https:&#x2F;&#x2F;gist.github.com&#x2F;pedrox&#x2F;eb8d674bf2b8be63da0f</a>
评论 #7858129 未加载
评论 #7858163 未加载
oneiricalmost 11 years ago
Is it supposed to be obvious where this #Merveilles community with its icons is on the web? Am I unaware of a whole type of communities like this?
评论 #7856550 未加载
评论 #7856768 未加载
评论 #7856751 未加载
评论 #7856769 未加载
panarkyalmost 11 years ago
<p><pre><code> I’m half tempted to buy a few hours of highcpu AWS compute power and get it done nowish instead ... I set myself a $50 spending limit, which gave me about 24 hours of compute on an instance with 32 virtual cores </code></pre> The price of a c3.8xlarge with 32 cores and 60 GB is currently $0.28 in us-west-2.<p>You could get 178 hours of compute for your $50 budget.
评论 #7858350 未加载
user24almost 11 years ago
I think shoruzorhorheugogeuzudeazaeon actually sounds a bit more like a demon than the other candidates.
评论 #7857922 未加载
foxhillalmost 11 years ago
i was intrigued by this, so i done it in C.<p>on my 4-core MBP (2.6ghz ivy bridge) i can manage ~1.8 <i>billion</i> hashes per second.<p>i could parallelize with OpenCL, but i think this is enough. after a few minutes, i get ARbyhlf as a valid name (although i don&#x27;t know if this is actually valid.. but it definitely might be)<p>(removed)<p>edit: just realised that my nonce calculation was wrong.. <a href="http://pastebin.com/bcHcECPJ" rel="nofollow">http:&#x2F;&#x2F;pastebin.com&#x2F;bcHcECPJ</a>
评论 #7858473 未加载
makoConstructalmost 11 years ago
WOW my C++ solution is horrible. It&#x27;s as though I&#x27;d just ignored everything I&#x27;ve learned about Doing Things Right in C++ Post 2010. Such is hacking, I guess.
评论 #7857860 未加载
lifeformedalmost 11 years ago
Woah, if you zoom in onto this site, the letters slowly shift apart over time.
verroqalmost 11 years ago
Or you can write it OpenCL and get a result near instantly.
评论 #7856572 未加载
ingenteralmost 11 years ago
Oh, the joys of generating a recognizable tripcode.