Anindya C. Patthak

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

Collaborative distances:

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

2009

Provably Good Codes for Hash Function Design.

Charanjit S. Jutla, Anindya C. Patthak

IEEE Trans. Inf. Theory, 2009

Testing low-degree polynomials over prime fields.

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

Random Struct. Algorithms, 2009

2008

Correlated algebraic-geometric codes: Improved list decoding over bounded alphabets.

Venkatesan Guruswami, Anindya C. Patthak

Math. Comput., 2008

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

2002

Quantified Computation Tree Logic.

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

Inf. Process. Lett., 2002