atoponce

Verifiable brute force strength

Below are table of various projects that can completely exhaust n-bits of keyspace. In other words, counting completely and fully from 0 to 2ⁿ-1.

This Gist implies no discussion about how this is relevant to quantum computing using Grover's algorithm, meet-in-the-middle or birthday attacks, or anything of the like. It's strictly a Gist about raw speed, measuring the result in bits.

If you know of other noteworthy and verifiable brute force searching projects,

novoid

#!/bin/sh
FILENAME=$(basename $0)
DEBUG="true" ## if true, verbose debug output is activated
DEBUG="false"
ERRORFOLDER="unknown_destinations" ## if found as a sub-directory, all non-matching files are moved there
SIMULATE="true" ## if true, no files are moved
SIMULATE="false"

warn_and_exit()
{