Anindya C Patthak
Anindya C Patthak
Verified email at oracle.com
Title
Cited by
Cited by
Year
Testing low‐degree polynomials over prime fields
CS Jutla, AC Patthak, A Rudra, D Zuckerman
Random Structures & Algorithms 35 (2), 163-193, 2009
86*2009
Testing low-degree polynomials over prime fields
CS Jutla, AC Patthak, A Rudra, D Zuckerman
Foundations of Computer Science, 2004. Proceedings. 45th Annual IEEE …, 2004
602004
Correlated Algebraic-Geometric codes: Improved list decoding over bounded alphabets
V Guruswami, AC Patthak
Foundations of Computer Science, 2006. FOCS'06. 47th Annual IEEE Symposium …, 2006
292006
A matching lower bound on the minimum weight of sha-1 expansion code
CS Jutla, AC Patthak
Cryptology ePrint Archive, Report 2005/266, 2005. http://eprint. iacr. org, 2005
272005
Quantified computation tree logic
AC Patthak, I Bhattacharya, A Dasgupta, P Dasgupta, PP Chakrabarti
Information processing letters 82 (3), 123-129, 2002
232002
A simple and provably good code for SHA message expansion
CS Jutla, AC Patthak
IACR preprint archive, 2005
212005
Is SHA-1 conceptually sound?
CS Jutla, AC Patthak
IACR Cryptology ePrint Archive 2005, 350, 2005
132005
Provably good codes for hash function design
C Jutla, A Patthak
Selected Areas in Cryptography, 376-393, 2007
122007
Provably good codes for hash function design
CS Jutla, AC Patthak
Information Theory, IEEE Transactions on 55 (1), 33-45, 2009
62009
Error correcting codes: Local testing, list decoding, and applications
AC Patthak
ProQuest, 2007
22007
Testing Polynomials over Prime Fields
CS Jutla, AC Patthak, A Rudra, D Zuckerman
2004
The system can't perform the operation now. Try again later.
Articles 1–11