Brute-force attack or exhaustive key search is a systematic way of checking all possible keys of an encryption system until the correct key is found. In this experiment, I am trying to analyse a weak PRG whose output can be predicted in roughly 2^28 time.This involves 2 python scripts,
– WeakPRG.py: With random seeds, each 28 bits, this algorithm will output 9 psuedo-random numbers.
– BreakPRG.py: This experiment will predict it’s 10th output in roughly 2^28 time.
I am having real fun with Cryptography :). Here I have shared my first experiment to understand the problem with using the same stream cypher key multiple times. There 2 python scripts,
– CypherText.py: This script will help you to generate keys and cypher texts
– CryptoUtils.py: This script will provide you tools and experiments to analyse the cypher.
Next couple of weeks I am going to experiment few basic techniques in cryptography to better understand “information security” – ie Confidentiality, Integrity and Availability! Probably I will more focus on Confidentiality and Integrity.