longshot-0.1.0.1: Fast Brute-force search using parallelism

LicenseMIT
MaintainerFrancis Lim <thyeem@gmail.com>
Stabilityexperimental
Portabilityunknown
Safe HaskellNone
LanguageHaskell2010

Crypto.Longshot

Description

How big is the search space? The space consists of two axes.

  • X-axis: Number of characters available
  • Y-axis: Search length of preimage to find

Note that it's proportional to (X ^ Y) rather than (X * Y)

The values below are defined by default.

When not provided as options in CUI, the following values are used.

Synopsis

Documentation

defChars :: String Source #

Characters available in a preimage

defSearchLength :: Int Source #

Search length of preimage

defNumPrefix :: Int Source #

Value related to the number of sparks

defNumBind :: Int Source #

Number of actions in TH bruteforceN

image :: String -> ByteString Source #

Image bytestring: target hash value to find

byteChars :: String -> [ByteString] Source #

Bytestring usable for preimage

bytePrefixes :: Int -> String -> [ByteString] Source #

Combination of prefixes possible: size of (length of chars) ^ (numPrefix)

toKey :: ByteString -> String Source #

Convert preimage found into key string