Research

 My research area is the Analysis of Boolean Functions, with connections to learning theory, additive combinatorics, and cryptography. I am particularly interested in how simplicity in spectral structure acts as a simplifying principle, both for understanding Boolean functions and for designing efficient algorithms.

Manuscript

1. On Nonlinearity Estimation Problem
with Arijit Ghosh, and Subhamoy Maitra

2. Distribution Free Fourier Sparsity Testing
with Arijit Ghosh

3. Approximating Sumset Size via Dense Coset Decomposition
with Arijit Ghosh

4. Spectral Shadows: When Communication Complexity Meets Linear Invariance Testing
with Swarnalipa Dutta, Arijit Ghosh, Chandrima Kayal, and Manaswi Paraashar

Published

1. Testing Fourier Sparsity via Implicit Sensing
   with Arijit Ghosh, and Subhamoy Maitra

ICLR (2026)

2. Spectral Norm, Economical Sieve, and Linear Invariance Testing of Boolean Functions
   with Swarnalipa Dutta, Arijit Ghosh, Chandrima Kayal, and Manaswi Paraashar
   STACS (2026)

3. Price of Parsimony: Complexity of Fourier Sparsity Testing
   with Arijit Ghosh
   NeurIPS (2025)

4. Testing Isomorphism of Boolean Functions over Abelian Groups
   with Swarnalipa Dutta, Arijit Ghosh, Chandrima Kayal, and Manaswi Paraashar
   APPROX/RANDOM (2025) 

5. Construction of Maiorana–McFarland type cryptographically significant Boolean functions with good implementation properties
   with Deng Tang, Anupam Chattopadhyay, Bimal Mandal, and Subhamoy Maitra
   Communications in Cryptology (2025) 

6. On Differential Uniformity of Extremal Functions
   with Nikolay Stoyanov Kaleyski
   BFA (2025)

7. Modifying Bent Functions to Obtain Balanced Ones with High Nonlinearity
   with Subhamoy Maitra, and Bimal Mandal
   Indocrypt (2022)