Anindya C. Patthak

According to our database, Anindya C. Patthak authored at least 7 papers between 2002 and 2006.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2006

Provably Good Codes for Hash Function Design.

Charanjit S. Jutla, Anindya C. Patthak

Proceedings of the Selected Areas in Cryptography, 13th International Workshop, 2006

Correlated Algebraic-Geometric Codes: Improved List Decoding over Bounded Alphabets.

Venkatesan Guruswami, Anindya C. Patthak

Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, 2006

2005

Is SHA-1 conceptually sound?

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

A Simple and Provably Good Code for SHA Message Expansion.

Charanjit S. Jutla, Anindya C. Patthak

IACR Cryptol. ePrint Arch., 2005

2004

Testing Low-Degree Polynomials over Prime Fields.

Charanjit S. Jutla, Anindya C. Patthak, Atri Rudra, David Zuckerman

Proceedings of the 45th Symposium on Foundations of Computer Science, 2004

2002

Quantified Computation Tree Logic.

Anindya C. Patthak, Indrajit Bhattacharya, Anirban Dasgupta, Pallab Dasgupta, P. P. Chakrabarti

Inf. Process. Lett., 2002