Victor Shoup


Victor Shoup
Alma mater
Known forCramer–Shoup cryptosystem
Scientific career
Thesis"Removing Randomness from Computational Number Theory" (1989)
Doctoral advisorEric Bach

Victor Shoup is a computer scientist and mathematician. He obtained a PhD in computer science from the University of Wisconsin–Madison in 1989,[1] and he did his undergraduate work at the University of Wisconsin-Eau Claire.[2] He is a professor at the Courant Institute of Mathematical Sciences at New York University, focusing on algorithm and cryptography courses. He has held positions at AT&T Bell Labs, the University of Toronto, Saarland University, and the IBM Zurich Research Laboratory.[3]

Shoup's main research interests and contributions are computer algorithms relating to number theory, algebra, and cryptography. His contributions to these fields include:

  • The Cramer–Shoup cryptosystem asymmetric encryption algorithm bears his name.
  • His freely available (under the terms of the GNU GPL) C++ library of number theory algorithms, NTL, is widely used and well regarded for its high performance.
  • He is the author of a widely used[citation needed] textbook, A Computational Introduction to Number Theory and Algebra, which is freely available online.
  • He has proved (while at IBM Zurich) a lower bound to the computational complexity for solving the discrete logarithm problem in the generic group model. This is a problem in computational group theory which is of considerable importance to public-key cryptography.
  • He acted as editor for the ISO 18033-2 standard for public-key cryptography.[4]
  • One of the primary developers of HElib.


  • A Computational Introduction to Number Theory and Algebra, 2nd Edition, 2009, Cambridge University Press, ISBN 978-0521516440, ISBN 0521516447


  1. ^ Victor Shoup at the Mathematics Genealogy Project
  2. ^ Victor Shoup at NYU Arts and Sciences
  3. ^ 5-day minicourse on Public Key Cryptography at NYU Courant Institute
  4. ^ Victor, Shoup (December 6, 2004). "FCD 18033-2 Encryption algorithms — Part 2: Asymmetric ciphers" (PDF). Retrieved October 15, 2018.