phc-discussions - Re: [PHC] [OT] Improvement to Momentum PoW

lists.openwall.net		lists / announce owl-users owl-dev john-users john-dev passwdqc-users yescrypt popa3d-users / oss-security kernel-hardening musl sabotage tlsify passwords / crypt-dev xvendor / Bugtraq Full-Disclosure linux-kernel linux-netdev linux-ext4 linux-hardening linux-cve-announce PHC
Open Source and information security mailing list archives

Hash Suite for Android: free password hash cracker in your pocket

[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]

Message-ID: <55B7D98A.2060203@cs.rit.edu>
Date: Tue, 28 Jul 2015 15:35:38 -0400
From: Alan Kaminsky <ark@...rit.edu>
To: discussions@...sword-hashing.net
Subject: Re: [PHC] [OT] Improvement to Momentum PoW

On 07/28/2015 01:39 PM, Bill Cox wrote:
> Here's a great link to radix-sort on GPUs
> <https://code.google.com/p/back40computing/wiki/RadixSorting>.  These guys
> can radix-sort 1 billion 32-bit hashes per second on a $100 GPU (GTX 480).
> After that, finding collisions is a linear pass, and can be done massively
> in parallel at full memory bandwidth.

Thanks for the link, Bill. But after the list of hashes is sorted, a collision 
with a specific hash could be detected with an O(log n) binary search, more 
quickly than an O(n) linear search.

-- 
-Alan Kaminsky
  Professor
  Department of Computer Science
  B. Thomas Golisano College of Computing and Information Sciences
  Rochester Institute of Technology