Alan_Sherman - peregrineshahin/ChessProgrammingWiki GitHub Wiki

title: Alan Sherman

Home * People * Alan Sherman

Alan T. Sherman [1] Alan T. Sherman,

an American computer scientist, cryptographer, and full professor of computer science at University of Maryland, Baltimore County. He earned his M.Sc. and Ph.D. under Ronald L. Rivest at MIT in 1981 and 1987 respectively. His research interests include high-integrity voting systems, information assurance, cryptology, and discrete algorithms. Alan Sherman has been the faculty advisor of the UMBC Chess Club since 1991 [2] [3] [4].

[5]

Ronald L. Rivest, Alan T. Sherman (1982). Randomized Encryption Techniques. CRYPTO 1982
Alan T. Sherman (1986). Cryptology and VLSI - Part I: Detecting and Exploiting Algebraic Weaknesses in Cryptosystems. Ph.D. thesis
Alan T. Sherman (1986). Cryptology and VLSI - Part II: Algorithms for Placing Modules on a Custom VLSI Chip. Ph.D. thesis, MIT, advisor Ronald L. Rivest
Burton S. Kaliski Jr., Ronald L. Rivest, Alan T. Sherman (1988). Is the Data Encryption Standard a group? (Results of cycling experiments on DES). Journal of Cryptology, Vol. 1 [6]
Alan T. Sherman (1989). VLSI Placement and Routing: The PI Project. Springer

Alan T. Sherman, David A. McGrew (2003). Key Establishment in Large Dynamic Groups Using One-Way Function Trees. IEEE Transactions on Software Engineering, Vol. 29, No. 5
Kevin Fisher, Richard Carback, Alan T. Sherman (2006). Punchscan: Introduction and System Definition of a High-Integrity Election System. pdf