XOR Cracker (decimal byte lists)

Ciphertext must be provided as comma-separated decimal bytes, e.g. 25,20,29,29,30

Continuously samples random repeating keys and applies to ciphertext until a match is found (must-contain or heuristic).

/known-crib

Crib drag

Provide a known substring (crib) and try positions/key-lengths to reconstruct the repeating key.

Bruteforcing Attack m

Ciphertext (decimal bytes, comma separated) Max key length (1..) Must-Contain (optional) — if the decoded plaintext contains this substring the run will stop and report success

This attempts random keys continuously and updates live. It will not freeze your browser; use Stop to cancel.

Status

idle

Attempts: 0

Last key (dec): -

Last plaintext (preview):

Found result

(none)

Known-string (Crib) Attack

Ciphertext (decimal bytes, comma separated) Crib (known plaintext substring) Max key length to try

This tries all positions where the crib fits and reconstructs repeating-key candidates for each key-length.

Results

(no results)