I am a researcher in Cryptology and Computation. I have been teaching in the EE department at Indian Institute of Technology Bombay, India for many years. I formulated foundational courses Introduction to Number Theory and Cryptography and Topics in Cryptology. The second course is especially focused on the theory of Boolean equations and Boolean approach to algebraic cryptanalysis. I have developed a parallel algorithm (which my students have implemented) for representing all solutions to Boolean systems ofequations. Using this algorithm I have shown that the Bivium stream cipher can be broken in feasible time and memory space. I call this algorithm the Implicant based solver. The first version of the algorithm is available in the paper arxiv.org/1611/09590v3, Feb 17.