- Publications
- Influence

Claim Your Author Page

Ensure your research is discoverable on Semantic Scholar. Claiming your author page allows you to personalize the information displayed and manage publications.

- Charanjit S. Jutla, Anindya C. Patthak
- IACR Cryptology ePrint Archive
- 2005

We develop a new computer assisted technique for lower bounding the minimum distance of linear codes similar to those used in SHA-1 message expansion. Using this technique, we prove that a modified… (More)

- Charanjit S. Jutla, Anindya C. Patthak
- IACR Cryptology ePrint Archive
- 2005

Recently, Wang, Yin, and Yu ([WYY05b]) have used a low weight codeword in the SHA-1 message expansion to show a better than brute force method to find collisions in SHA-1. The smallest minimum weight… (More)

We present an efficient randomized algorithm to test if a given function f : F pn → Fp (where p is a prime) is a low-degree polynomial. This gives a local test for Generalized Reed-Muller codes over… (More)

- Charanjit S. Jutla, Anindya C. Patthak, Atri Rudra, David Zuckerman
- 45th Annual IEEE Symposium on Foundations of…
- 2004

We present an efficient randomized algorithm to test if a given function f : F/sub p/ /sup n/ /spl rarr/ F/sub p/ (where p is a prime) is a low-degree polynomial. This gives a local test for… (More)

- Charanjit S. Jutla, Anindya C. Patthak
- IACR Cryptology ePrint Archive
- 2005

We argue that if the message expansion code of SHA-1 is replaced by a linear code with a better minimum distance, then the resulting hash function is collision resistant. To support this argument, we… (More)

The invention describes new high temperature structural materials consisting of titanium carbide vanadium carbide alloys produced by zone refining techniques. The materials are fully dense and may be… (More)

- Venkatesan Guruswami, Anindya C. Patthak
- 47th Annual IEEE Symposium on Foundations of…
- 2006

We define a new family of error-correcting codes based on algebraic curves over finite fields, and develop efficient list decoding algorithms for them. Our codes extend the class of… (More)

- Anindya C. Patthak, Indrajit Bhattacharya, Anirban Dasgupta, Pallab Dasgupta, P. P. Chakrabarti
- Inf. Process. Lett.
- 2002

Computation Tree Logic (CTL) is one of the most syntactically elegant and computationally attractive temporal logics for branching time model checking. In this paper, we observe that while CTL can be… (More)

- Venkatesan Guruswami, Anindya C. Patthak
- FOCS
- 2006

We define a new family of error-correcting codes based on algebraic curves over finite fields, and develop efficient list decoding algorithms for them. Our codes extend the class of… (More)

- Charanjit S. Jutla, Anindya C. Patthak
- IEEE Transactions on Information Theory
- 2009

A new technique to lower-bound the minimum distance of certain types of quasi-cyclic codes with large dimension by reducing the problem to lower-bounding the minimum distance of a few significantly… (More)