Implicant Based Boolean system solver

Title of the Talk: Implicant Based Boolean system solver
Speakers: Prof. Virendra Sule
Host Faculty: Prof. M V Panduranga Rao
Date: Nov 25, 2025
Time: 4 pm

Abstract: Boolean systems arise in many computationally intensive problems such as Cryptanalysis, Biological networks, SAT problems, Decoding problems, Constraint satisfaction and Verification. The talk is aimed at discussing an algorithm for returning all solutions of Boolean systems of equations or satisfying assignments of Boolean formulas. The algorithm makes use of orthogonal implicants of Boolean functions and shows that an effectively parallelizable algorithm can be constructed to compactly return all solutions of Boolean systems in terms of orthogonal implicants. Such an algorithm can provide a scalable approach for sparse formulas which occur in most practical problems and may provide practically feasible solutions.

Speaker Bio: Prof. Virendra Sule retired as a Professor from the Department of Electrical Engineering at IIT Bombay in 2023. He has been active in the field of Cryptography and Computations in finite fields and number theory for over 20 years. He has over 600 citations to his papers and has guided several PhD and MTech students. He completed PhD from IIT Bombay in 1990 and since then worked on the faculty of IIT Kanpur, IIT Bombay and CR Rao Institute as well as worked with several Govt. agencies and the private entity Computational Research Laboratories, Pune, a venture of Tata Sons. He has also worked as a Research Fellow at University of Southampton UK. His research interests are in Cryptography, Cryptanalysis and Computational methods involving finite fields and Boolean equations.