Bruteforcing Hashed Passwords Using Rainbow Tables
Details to be written. (Possible directions: GPU-accelerated; Finer control on plaintext search space. Contact me if you are interested.)
Breaking Comp128 with less than 32768 chosen-plaintexts
Comp128 is the widely used authentication crypto in the GSM network. Attacks based on induced collision due to narrow pipes in Comp128 was discovered more than 10 years ago and break Comp128 completely. Sadly it's still being used widely in some countries (e.g. China, but with a hack to stop naive attacks). The objective of the project is to find the 128 bits encryption key hidden in the SIM card with less than 32768 chosen plaintexts, better than the original WGB paper's O(2^17). It requires efforts in understanding Comp128, devising your own algorithms that run *effeciently* and knowledge of probabilities.