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

Email: tdk@csus.edu
Office: 5012 Riverside Hall
Office hours and calendar
Picture of Ted Krovetz

Current Courses:

CSC 28: Discrete Structures in Computer Science
CSC 130: Data Structures and Algorithms
Course Discussion Forums

Courses Regularly Taught By Me:

CSC 28: Discrete structures for computer science (Most semesters)
CSC 140: Advanced Algorithm Design and Analysis (Spring of even-numbered years)
CSC 152: Cryptography (Fall of every year)
CSC 252: Cryptography theory and practice (Fall of every year)

I have also taught CSC 1, 130, 132, 148 and 206, but none on a predictable basis.

Research and Projects:

My research focuses on efficient and provably secure symmetric cryptography, especially universal hashing and its applications. If you are interested in trading units for programming, or in working on a supervised project, please come talk to me. (Possible projects.)

Some projects I'm working on:

OCB: Low-overhead authenticated encryption
VMAC: Universal hashing optimized for 64-bit architectures
UH-PRF: A pseudo-random function from {0,1}* to {0,1}* using universal hashing and a stream cipher
UH-PRF-SIV: Using UH-PRF in SIV mode
FastCrypto website
Architecture Farm: Web-based testbed for upload-compile-execute cycle on multiple architectures

Publications:

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]