lib/crypto-toolbox/analyzers/utils/key_candidate_map.rb
module Analyzers
module Utils
class KeyCandidateMap
# This class represents a position-index based map of possible values of a key.
# Example:
# {
# 1 => [1,100,22,33]
# 2 => [2,77,255]
# ...
# n => [22,55,222]
# }
include ::Utils::Reporting::Console
def initialize
@lang_detector = Analyzers::Utils::AsciiLanguageDetector.new
end
# factory method for easy use
def self.create(input_buf,keylen)
new.run(input_buf,keylen)
end
# Algorithm
# 1) for each position of the key: (key_byte_pos)
# 2) create a stream of all the nth bytes of the keylen
# 3) xor any possible byte value (guess) with all nth's bytes
# 4) select those guesses that decipher the nth-byte stream to only english plain ascii chars
def run(input_buf,keylen)
candidate_map = (0..(keylen-1)).each_with_object({}) do |key_byte_pos,hsh|
=begin
# Letter frquency testing
freqs = letter_freq(nth_byte_stream.xor_all_with(guess).str)
diff = FREQUENCIES.keys - freqs.keys
binding.pry if nth_byte_stream.xor_all_with(guess).bytes.all?{|byte| acceptable_char?(byte) } &&
((diff.map{|c| FREQUENCIES[c]}.reduce(&:+)||0) > 16)
=end
# create an array of every nth byte of the input. ( thus a pseudo stream of the nth bytes )
# 1) create an enumerator of the nth positions. e.g for iteration 0: [0,7,14,...]
# 2) Next: Map the positions to bytes of the input buffer
nth_byte_stream = input_buf.nth_bytes(keylen,offset: key_byte_pos)
hsh[key_byte_pos] = 0.upto(255).select{|guess| nth_byte_stream.xor_all_with(guess).bytes.all?{|byte| acceptable_char?(byte) } }
jot("found #{hsh[key_byte_pos].inspect} bytes for position: #{key_byte_pos}",debug: true)
end
candidate_map
end
private
# Checks if a given byte maps to a reasonable english language character
def acceptable_char?(byte)
@lang_detector.ascii_lingual_byte?(byte)
end
end
end
end