Anindya C. Patthak

Publication Activity (10 Years)

Years Active: 2002-2009
Publications (10 Years): 0

Publications

Charanjit S. Jutla, Anindya C. Patthak
Provably Good Codes for Hash Function Design. IEEE Trans. Inf. Theory 55 (1) (2009)
Charanjit S. Jutla, Anindya C. Patthak, Atri Rudra, David Zuckerman
Testing low-degree polynomials over prime fields. Random Struct. Algorithms 35 (2) (2009)
Venkatesan Guruswami, Anindya C. Patthak
Correlated algebraic-geometric codes: Improved list decoding over bounded alphabets. Math. Comput. 77 (261) (2008)
Venkatesan Guruswami, Anindya C. Patthak
Correlated Algebraic-Geometric Codes: Improved List Decoding over Bounded Alphabets. FOCS (2006)
Charanjit S. Jutla, Anindya C. Patthak
Provably Good Codes for Hash Function Design. Selected Areas in Cryptography (2006)
Charanjit S. Jutla, Anindya C. Patthak
A Simple and Provably Good Code for SHA Message Expansion. IACR Cryptol. ePrint Arch. 2005 (2005)
Charanjit S. Jutla, Anindya C. Patthak
A Matching Lower Bound on the Minimum Weight of SHA-1 Expansion Code. IACR Cryptol. ePrint Arch. 2005 (2005)
Charanjit S. Jutla, Anindya C. Patthak
Is SHA-1 conceptually sound? IACR Cryptol. ePrint Arch. 2005 (2005)
Charanjit S. Jutla, Anindya C. Patthak, Atri Rudra, David Zuckerman
Testing Low-Degree Polynomials over Prime Fields. FOCS (2004)
Anindya C. Patthak, Indrajit Bhattacharya, Anirban Dasgupta, Pallab Dasgupta, P. P. Chakrabarti
Quantified Computation Tree Logic. Inf. Process. Lett. 82 (3) (2002)