Boolean functions capture various problems and situations arising in computer science and other areas. In this synopsis, we study boolean functions using two complexity measures.

For two Boolean functions f and g acting on n and m bits respectively, their composition f o g is a Boolean function on nm bits defined as follows. Its input is thought of as consisting of n blocks, each m bits long.

PCryptography plays a vital role in securing e-business and e-commerce transactions. However, in spite of their mathematical robustness when these algorithms are implemented they may leak sensitive information via unintended side-channels.

STCS Vigyan Vidushi 2022, a summer school for women undergraduate and masters students will be held in TIFR Mumbai campus from July 2 to July 15, 2022.