Sacramento State Logo Ted Krovetz
Computer Science Department
California State University
6000 J Street
Sacramento CA 95819-6021

Office: 5012 Riverside Hall
Office hours:
Picture of Ted Krovetz

Current Courses:

CSC 15: Programming Concepts and Methodology I
CSC 152/252: Cryptography

Courses Often Taught By Me:

CSC 15: Programming Concepts and Methodology I (Every semester)
CSC 140: Advanced Algorithm Design and Analysis (Spring of even-numbered years)
CSC 151: Compiler Construction (Spring of odd-numbered years)
CSC 152: Cryptography (Every Fall)
CSC 252: Cryptography Theory and Practice (Fall)

I have also taught CSC 1, 28, 130, 132, 148 and 206, but not recently.

Research and Projects:

My research focuses on efficient and provably secure symmetric cryptography, especially universal hashing and its applications. If you are interested in working on a supervised project, please read this.


The OCB authenticated-encryption algorithm, with P Rogaway, internet-draft in preparation to become an IETF RFC, 2014. [link]

The software performance of authenticated-encryption modes, with P Rogaway, from Fast Software Encryption (FSE 2011), Springer, 2011. [pdf 717KB]

VHASH security, with W Dai, IACR ePrint Archive, 2007. [pdf 133KB]

Patent-free authenticated-encryption as fast as OCB, from Advances in Computer, Information, and Systems Sciences, and Engineering (TeNe 2006), Springer, 2007. [pdf 176KB]

Message authentication on 64-bit architectures, from Selected Areas of Cryptography (SAC 2006), Springer, 2007. [pdf 192KB]

Variationally universal hashing, with P Rogaway, in Information Processing Letters, Elsevier, 2006. [pdf 176KB]

UMAC: Message authentication code using universal hashing, with J Black, S Halevi, A Hevia, H Krawczyk and P Rogaway, RFC 4418, IETF, 2006. [text 51KB]

OCB: A block-cipher mode of operation for efficient authenticated encryption, with P Rogaway, M Bellare and J Black, from Eighth ACM Conference on Computer and Communications Security, ACM Press, 2001. [pdf 172KB]

Fast universal hashing with small keys and no preprocessing: The PolyR construction, with P Rogaway, from International Conference on Information and Communications Security 2000, Springer, 2001. [pdf 176KB]

Software-optimized universal hashing and message authentication, PhD Dissertation, UC Davis, 2000. [pdf 888KB]

UMAC: Fast and secure message authentication, with J Black, S Halevi, H Krawczyk and P Rogaway, from Advances in Cryptology (CRYPTO 1999), Springer, 1999. [pdf 228KB]

Luby-Rackoff backwards: increasing security by making block ciphers non-invertible, with M Bellare and P Rogaway, from Advances in Cryptology (Eurocrypt 1998), Springer, 1998. [pdf 180KB]