Quantified Computation Tree Logic. - Anindya C. Patthak; Indrajit Bhattacharya; Anirban Dasgupta 001; Pallab Dasgupta; P. P. Chakrabarti 001 (Inf. Process. Lett., 2002)

Testing Low-Degree Polynomials over Prime Fields. - Charanjit S. Jutla; Anindya C. Patthak; Atri Rudra; David Zuckerman (FOCS, 2004)

A Simple and Provably Good Code for SHA Message Expansion. - Charanjit S. Jutla; Anindya C. Patthak (IACR Cryptol. ePrint Arch., 2005)

A Matching Lower Bound on the Minimum Weight of SHA-1 Expansion Code. - Charanjit S. Jutla; Anindya C. Patthak (IACR Cryptol. ePrint Arch., 2005)

Is SHA-1 conceptually sound? - Charanjit S. Jutla; Anindya C. Patthak (IACR Cryptol. ePrint Arch., 2005)

Correlated Algebraic-Geometric Codes: Improved List Decoding over Bounded Alphabets. - Venkatesan Guruswami; Anindya C. Patthak (FOCS, 2006)

Provably Good Codes for Hash Function Design. - Charanjit S. Jutla; Anindya C. Patthak (Selected Areas in Cryptography, 2006)