longshot-0.1.0.5: Fast Brute-force search using parallelism

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

Crypto.Longshot.Const

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 #

Default characters available in a preimage

defSearchLength :: Int Source #

Default search length of preimage

limitSearchLength :: Int Source #

Limit search length of preimage

defNumPrefix :: Int Source #

Default value related to the number of sparks

maxNumBind :: Int Source #

Maximum number of actions in bruteforceN