Susan Landau is Bridge Professor in Cyber Security and Policy at The Fletcher School and the School of Engineering, Department of Computer Science, Tufts University. Landau is a leading expert in surveillance and privacy issues. The author of many research papers and books, Landau has testified before Congress, written for the Washington Post, Science, and Scientific American, and frequently appears on NPR and BBC. She originated the understanding that the encryption conflict is over security versus security—not security versus privacy—a view now widely accepted. Landau's book Listening In: Cybersecurity in an Insecure Age was called one of the "highlights of this season's releases" by Nature, while Privacy on the Line: The Politics of Wiretapping and Encryption. co-authored with Whitfield Diffie, is considered a classic in the field and has won several awards. She is founding director of the Tufts MS program in Cybersecurity and Public Policy. Previous to Tufts, Landau was a Senior Staff Privacy Analyst at Google and a Distinguished Engineer at Sun Microsystems, and a faculty member at Worcester Polytechnic Institute, the University of Massachusetts Amherst, and Wesleyan University. She has received the 2024 Bertrand Russell Prize of the American Mathematical Society, the USENIX Lifetime Achievement Award, and numerous other awards. She received a BA from Princeton, MS from Cornell, and PhD from MIT.

Susan Landau
Photo by Ben Barnhart
Landau is strongly committed to women's success in science. Her activities have included co-creating the graduate student GREPSEC workshops in privacy and security for women and members of underrepresented groups, conceiving of and co-creating the ACM Athena Lectureship, starting researcHers, a mailing list for women computer science researchers in academia, industry and government labs and co-organizing the first MIT Celebration of Women in Math meeting. Landau received the 2008 Women of Vision Social Impact Award from the Anita Borg Institute for Women and Technology.


MIT Press

Yale University Press

MIT Press

MIT Press
(Publications are arranged by subject and may be listed in more than one category if appropriate.)

Cryptography and Cryptography Policy

Contact-Tracing Apps, Privacy, and Equity



Law and Public Policy

Identity Management

Digital Rights Management

Symbolic Computation

  • S. Landau, "Computations with Algebraic Numbers," in J. Grabmeier, E. Kaltofen, and V. Weispfennig (eds.), Computer Algebra Handbook, Spring Verlag, 2003, pp. 18-19.
  • S. Landau and N. Immerman, Embedding Linkages in Integer Lattices, Algorithmica, Vol. 43, No. 5, May 2000, pp. 115-120. A preliminary version appeared in MSI Workshop on Computational Geometry, October, 1994.
  • S. Landau, Compute and Conjecture, Commentary (In My Opinion), Notices of the American Mathematical Society, Feb. 1999, p. 189.
  • S. Landau, : Four Different Views, Mathematical Intelligencer, Vol. 20, No. 4 (Fall 1998), pp. 55-60.
  • D. Kozen, S. Landau, and R. Zippel, Decomposition of Algebraic Functions, Journal of Symbolic Computation, Vol. 22 (1996), pp. 235-246. A preliminary version appeared in Algorithmic Number Theory Symposium (1994).
  • S. Landau, How to Tangle with a Nested Radical, Mathematical Intelligencer, Vol. 16, No. 2 (Spring 1994), pp. 49-55.
  • S. Landau, Finding Maximal Subfields, SIGSAM Bulletin, Vol. 27, No. 3 (1993), pp. 4-8.
  • S. Landau, Simplification of Nested Radicals, SIAM J. of Comput., Vol. 21 (1992), pp. 85-110. A preliminary version appeared in Thirtieth Annual IEEE Symposium on Foundations of Computer Science (1989), pp. 314-319.
  • S. Landau, A Note on `Zippel Denesting,' J. Symb. Comput., Vol. 13 (1992), pp. 41-47.
  • J. Cremona and S. Landau, Shrinking Lattice Polyhedra, SIAM J. of Discrete Math, Vol. 3, No. 3 (1990), pp. 338-348. A preliminary version appeared in Proceedings of the First ACM-SIAM Symposium on Discrete Algorithms (1990), pp. 188-193.
  • D. Kozen and S. Landau, Polynomial Decomposition Algorithms, J. Symb. Comput., Vol. 7 (1989), pp. 445-456. Appeared in a different version as J. von zur Gathen, D. Kozen and S. Landau, "Functional Decomposition of Polynomials" Twenty-Eight Annual IEEE Symposium on the Foundations of Computer Science (1989), pp. 314-319.
  • S. Landau, Factoring Polynomials Quickly, Notices of the American Mathematical Society, [Special Article Series], vol. 34, No. 1 (1987), pp. 3-8.
  • S. Landau and G. Miller, Solvability by Radicals is in Polynomial Time, J. Comput. Sys. Sci., Vol. 30, No. 2 (1985), pp. 179-208. A preliminary version appeared in Fifteenth ACM Symposium on Theory of Computing (1983), pp. 140-151.
  • S. Landau, Factoring Polynomials over Algebraic Number Fields, SIAM J. of Comput., Vol. 14, No. 1 (1985), pp. 184-195.
  • S. Landau, Polynomial Time Algorithms for Galois Groups, Proceedings of the Int'l. Symposium on Symbolic and Algebraic Computation (1984), Spring Verlag Lecture Notes in Computer Science, No. 174, pp. 225-236.


  • N. Immerman and S. Landau, The Complexity of Iterated Multiplication, Information and Computation Vol. 116, No. 1 (1995), pp. 103-116. A preliminary version appeared in Fourth Annual Structure in Complexity Conference (1989), pp. 104-111.
  • S. Landau and N. Immerman, The Similarities (and Differences) between Polynomials and Integers, Int'l. Conf. on Number Theoretic and Algebraic Methods in Computer Science (1993), pp. 57-59.

Women in Science

Blog Posts, Letters to the Editor, and Other Short Pieces on a Variety of Topics




Professional Activities (recent)


Honors and Awards

  Contact Information

For all Tufts-related activity:


For any non-Tufts-related activities:


  Copyright © 2024 Susan Landau | Site Design by Silvana.Net