Alan Sherman's Publications (selected--very out of date; see cv)

A. Books

1. Chaum, David; Ronald L. Rivest; and Alan T. Sherman, eds., {\it Advances in Cryptology: Proceedings of Crypto 82}, Plenum Press (New York, 1983). 331~pages.
2. Sherman, Alan T., {\it VLSI Placement and Routing: The PI Project}, Springer-Verlag (New York, 1989). 189~pages.

B. Articles in Refereed Journals

1. Kaliski, Burton S. Jr.; Ronald L. Rivest; and Alan T. Sherman, ``Is the Data Encryption Standard a group? (Results of cycling experiments on DES),'' {\it Journal of Cryptology}, {\bf 1}:1 (1988), 3--36.
2. Levine, Robert Y.; and Alan T. Sherman, ``A note on Bennett's time-space tradeoff for reversible computation,'' {\it SIAM Journal on Computing}, {\bf 19}:4 (August 1990), 673--677.
   \myindent {\small [A preliminary version appears as Technical Report 89-2, Tufts University Department of Computer Science (May 1989), and in modified form as Technical Report UMIACS-TR-90-63/CS-TR-2467, University of Maryland College Park (May 1990).]}
3. Baldwin, Robert W.; and Alan T. Sherman, ``How we solved the \$100,000 Decipher Puzzle (16 hours too late),'' {\it Cryptologia}, {\bf XXIV}:3 (July 1990), 258--284.
   \myindent {\small [A preliminary version appears as Technical Report 89-3, Tufts University Department of Computer Science (July 1989), and in modified form as Technical Report UMIACS-TR-90-64/CS-TR-2468 University of Maryland College Park (May 1990).]}
4. Ganesan, Ravi; and Alan T. Sherman, ``Statistical techniques for language recognition: An introduction and guide for cryptanalysts,'' {\it Cryptologia}, {\bf XVII}:4 (October 1993), 321--366.
   \myindent {\small [Preliminary version available as Technical Report CS-TR-3036/UMIACS-TR-93-16, University of Maryland College Park (February 1993), and as Technical Report TR~CS-93-02, University of Maryland Baltimore County (February 28, 1993).]}
5. Konstantinos Kalpakis; and Alan T. Sherman, ``Probabilistic analysis of an enhanced partitioning algorithm for the Steiner tree problem in $R^d$,'' {\it Networks}, {\bf 24}:3 (May 1994), 147--159.
   \myindent {\small [An early version appears as Technical Report CS-TR-2936/UMIACS-TR-92-83, University of Maryland College Park (July 1992), and in modified form as Technical Report TR~CS-93-10, University of Maryland Baltimore County (July 29, 1992).]} %20~pages.
6. Ravada, Sivakumar; and Alan T. Sherman, ``Experimental evaluation of a partitioning algorithm for the Steiner tree problem in $R^2$ and $R^3$,'' {\it Networks}, in press. 9~pages.
   \myindent {\small [A complete version (with supplement) appears as Technical Report TR~CS-93-12, University of Maryland Baltimore County (September 28, 1993).]}
7. Ganesan, Ravi; and Alan T. Sherman, ``Statistical techniques for language recognition: An empirical study using real and simulated English,'' {\it Cryptologia}, in press. 39~pages.
   \myindent {\small [A preliminary version appears as Technical Report CS-TR-3036/UMIACS-TR-93-16, University of Maryland College Park (July 1993), and a complete version (with supplement) appears as Technical Report TR~CS-93-03, University of Maryland Baltimore County (September 28, 1993). 48~pages.]}
8. Cain, Thomas; and Alan T. Sherman, ``How to break Gifford's Cipher,'' (June 2, 1994), {\it Cryptologia}, tentatively accepted for publication. 49~pages.
   \myindent {\small [Also appears as Technical Report CS-TR-3298/UMIACS-TR-94-72, University of Maryland College Park (June 2, 1994), and as Technical Report TR~CS-94-7, Computer Science Department, University of Maryland Baltimore County (June 2, 1994).]}

C. Works Submitted for Publication (In Review)

1. Rabi Muhammad; and Alan T. Sherman, ``Associative one-way functions: A new paradigm for secret-key agreement and digital signatures'' (November 15, 1993), submitted to {\it SIAM Journal on Computing}. 13~pages.
   \myindent {\small [A preliminary version appears as Technical Report CS-TR-3183/UMIACS-TR-93-124, University of Maryland College Park (July 1993), and as Technical Report TR~CS-93-18, Computer Science Department, University of Maryland Baltimore County (November 15, 1993).]}
2. Lazoff, David M., and Alan T. Sherman, ``An exact formula for the expected wire length between two randomly chosen terminals'' (July 20, 1994), submitted to {\it SIAM Review}. 14~pages.
   \myindent {\small [Available as Technical Report TR~CS-94-08, Computer Science Department, University of Maryland Baltimore County (July 20, 1994).]}

D. Articles in Proceedings of Refereed Conferences

1. Rivest, Ronald L.; and Alan T. Sherman, ``Randomized encryption techniques'' in {\it Advances in Cryptology: Proceedings of Crypto 82}, David Chaum, Ronald L. Rivest, and Alan T. Sherman, eds., Plenum Press (New York, 1983), 145--163.
   \myindent {\small [Also appears as Technical Memorandum TM-234, MIT Laboratory for Computer Science (January 1983). By agreement with Plenum Press, this paper will not be published elsewhere.]}
2. Kaliski, Burton S. Jr.; Ronald L. Rivest; and Alan T. Sherman, ``Is the Data Encryption Standard a group?'' in {\it Advances in Cryptology: Proceedings of Eurocrypt 85}, Franz Pichler, ed., Springer-Verlag (New York, 1986), 81--95.
3. Kaliski, Burton S. Jr.; Ronald L. Rivest; and Alan T. Sherman, ``Is the Data Encryption Standard a pure cipher? (Results of more cycling experiments on DES)'' in {\it Advances in Cryptology: Proceedings of Crypto 85}, H. C. Williams, ed., Springer-Verlag (New York, 1986), 212--226.
4. Kalpakis, Konstantinos; and Alan T. Sherman, ``Probabilistic analysis of an enhanced partitioning algorithm for the Steiner tree problem in $R^d$'' in {\it Proceedings of the 13th Annual Allerton Conference on Communication, Control, and Computing}, edited by Paul Van Dooren and Mark Spong, University of Illinois at Urbana-Champaign (1992), 553--564.
5. Cain, Thomas; and Alan T. Sherman, ``How to break Gifford's Cipher (extended abstract),'' (May 31, 1994), {\it Proceedings of the Second Annual ACM Conference on Computer and Communications Security}, accepted for publication. 13~pages.

E. Other Publications

1. Sherman, Alan T., ``On superpolylogarithmic subexponential functions (Part I),'' {\it SIGACT News}, {\bf 22}:1 (winter 1991), Whole Number~78, 65--73.
   \myindent {\small [A preliminary version of the entire paper is available as Technical Report UMIACS-TR-90-97/CS-TR-2506, University of Maryland College Park (July 1990), and in modified form as Technical Report TR~CS-91-17, University of Maryland Baltimore County (April 1991). This work was performed at the University of Maryland College Park on December 11, 1991.]}
2. Sherman, Alan T., ``On superpolylogarithmic subexponential functions (Part II),'' {\it SIGACT News}, {\bf 22}:2 (spring 1991), Whole Number~79, 51--56.
3. Chang, Richard; and Alan T. Sherman, ``Report on the 8th Maryland Theory Day,'' {\it SIGACT News}, {\bf 24}:2 (April 29, 1993), Whole Number~87, 81--82.

F. Works in Preparation

1. Pollack, Ann; and Alan T. Sherman, ``On the complexity of orienting uniform modules to minimize estimated wire length'' (draft: July 19, 1993), 14~pages.
2. Cain, Thomas; and Alan T. Sherman, ``Cryptanalysis of filter-generators from ciphertext alone.''
3. Sherman, Alan T., ``A simplified approach to probabilistic polynomial-time complexity classes'' (draft: August 23, 1990), 14~pages.
4. Panesar, Kiran S.; Alan T. Sherman; and Kirthivasan Venkatraman, ``The vowel-count method for solving columnar transposition ciphers: Quantification, analysis, extensions, and experimental results'' (draft: August 16, 1993), 21~pages.

G. Theses

1. Sherman, Alan T., ``On the Enigma cryptograph and formal definitions of cryptographic strength,'' S.M. Thesis, Department of Electrical Engineering and Computer Science, MIT (June 1981). Thesis supervisor: Ronald L. Rivest. 45~pages.
2. Sherman, Alan T., ``Cryptology and VLSI (a two-part dissertation): I. Detecting and exploiting algebraic weaknesses in cryptosystems II. Algorithms for placing modules on a custom VLSI chip,'' Ph.D. Thesis, Department of Electrical Engineering and Computer Science, MIT (October 1986). Thesis supervisor: Ronald L. Rivest. 221~pages.
   \myindent {\small [Available as Technical Report TR-381, MIT Laboratory for Computer Science (October 1986), and as VLSI Memo No.\ 86-343, Microsystems Research Center, MIT (October 1986).]}