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 135: Computer Theory and Programming Languages
CSC 152: Cryptography

Since coming to Sacramento State I have taught CSC 1, 15, 20, 28, 130, 132, 135, 148, 151, 152, 206, and 252.

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, I only take on students who have taken CSC 152 and have a project idea. If this is you, contact me.


The design and evolution of OCB, with P Rogaway, invited submission to Journal of Cryptology, Springer, 2021. [pdf, DOI]

The definition and software performance of Hashstream, a fast length-flexible PRF, in Cryptography, MDPI, 2018. [pdf, DOI]

CAESAR authenticated-encryption competition finalist: OCB, with P Rogaway, 2016. [pdf, link]

CAESAR authenticated-encryption competition third-round candidate: AEZ, with VT Hoang and P Rogaway, 2017. [pdf, link]

CAESAR authenticated-encryption competition second-round candidate: HS1-SIV, 2016. [pdf, link]

Robust authenticated-encryption: AEZ and the problem that it solves, with VT Hoang and P Rogaway, from Advances in Cryptology (Eurocrypt 2015), Springer, 2015. [proceedings, full, DOI]

The OCB authenticated-encryption algorithm, with P Rogaway, RFC 7253, IETF, 2014. [text, DOI]

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

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

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

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

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

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

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, DOI]

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, DOI]

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

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, DOI]

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, DOI]

Google Scholar listing