|
Charanjit S. JutlaResearch Staff Member
Research Lab: Watson Research Center (Hawthorne)
Selected Publications
- A Simple Biased Distribution for Dinur's Construction, ECCC TR-06-121.
- A Simple and Provably Good Code for SHA Message Expansion,
(with Anindya C. Patthak), NIST Hash Workshop 2005. Also in SAC 2006.
- PRF Domain Extension Using DAGs, Proc. Theory of Cryptography Conference, 2006 (slightly edited version).
- Parallelizable Authentication Trees (with Eric W. Hall), Proc. Selected Areas in Cryptography, 2005.
- Testing Low Degree Polynomials over Prime Fields (with A. Patthak, A. Rudra and D. Zuckerman), Proc. FOCS 2004.
- Lowerbound on Linear Authenticated Encryption, Proc. Selected Areas in Cryptography, 2003.
- Encryption Modes with Almost Free Message Integrity, Proc. Eurocrypt 2001. A more detailed version.
- On Finding Small Solutions of Modular Multivariate Polynomial Equations, Proc. Eurocrypt 1998.
- The Complexity of Tree Automata and Logics of Programs (with E. A. Emerson), SIAM J. of Comp. 29(1), 1999. Extended abstract in Proc. FOCS 1988.
- Determinization and Memoryless Winning Strategies, Information and Computation 133(2), 1997.
- Mu-Calculus, Determinacy, and Tree Automata (with E. A. Emerson), Proc. FOCS 1991.
Contact: use the userid altujsc in reverse followed by domain us.ibm.com
Last updated 19 Jun 2007
|
|
|
