http:^^www.cs.pomona.edu^182bib.html
来自「This data set contains WWW-pages collect」· HTML 代码 · 共 236 行
HTML
236 行
Date: Tue, 14 Jan 1997 20:48:09 GMT
Server: NCSA/1.5.2
Last-modified: Fri, 01 Mar 1996 00:34:23 GMT
Content-type: text/html
Content-length: 8530
<!DOCTYPE HTML PUBLIC "-//W3O//DTD W3 HTML 2.0//EN"><!Converted with LaTeX2HTML 95 (Thu Jan 19 1995) by Nikos Drakos (nikos@cbl.leeds.ac.uk), CBLU, University of Leeds ><HEAD><TITLE>Cryptology Bibliography for CS182</TITLE></HEAD><BODY BGCOLOR="#FFFFFF"><meta name="description" value="Cryptology Bibliography for CS182"><meta name="keywords" value="182bib"><meta name="resource-type" value="document"><meta name="distribution" value="global"><P> This is the (growing) bibliography on cryptology that is beingcompiled by the participants in CS 182 at Pomona College and HarveyMudd College. Last updated on February 29, 1996.<P>Members of the class should send items to <!WA0><A NAME=tex2html1 HREF="mailto:rbull@pomona.edu">ProfessorBull</A>.<P>The authors of the notes are identified by their initials:<DL COMPACT><DT><DD>JH: <!WA1><A NAME=tex2html2 HREF="mailto:Jonathan_Herzog@hmc.edu">Jonathan Herzog</A><DT><DD>JM: <!WA2><A NAME=tex2html3 HREF="mailto:Jeffrey_Margileth@hmc.edu">Jeffrey Margileth</A><DT><DD>CW: <!WA3><A NAME=tex2html4 HREF="mailto:Charles_Wurster@hmc.edu">Charles Wurster</A><DT><DD>RB: <!WA4><A NAME=tex2html5 HREF="mailto:rbull@pomona.edu">Everett Bull</A><P> </DL><P><P><A NAME=SECTIONREF><H2></H2></A><P><DL COMPACT><DT><A NAME=BCC1988><STRONG>BCC88</STRONG></A><DD>Brassard, Chaum, and Crepeau. Minimum disclosure proofs of knowledge. <em> Journal of Computer and System Sciences</em>, 37:156--189, 1988. JH: One of the first papers on zero-knowledge proofs, it has a lot of the important definitions but it gets too technical.<P><DT><A NAME=Beutelspacher1994><STRONG>Beu94</STRONG></A><DD>Albrecht Beutelspacher. <em> Cryptology</em>. Mathematical Association of America, 1994. RB: Good, but basic, introduction.<P><DT><A NAME=BFS1992><STRONG>BFS92</STRONG></A><DD>Thomas Beth, Markus Frisch, and G. J. Simmons, editors. <em> Public-Key Cryptography: State of the Art and Future Directions</em>, volume 578 of <em> Lecture Notes in Computer Science</em>. Springer-Verlag, 1992. RB: Proceedings of a workshop in 1992.<P><DT><A NAME=Blum1986><STRONG>Blu86</STRONG></A><DD>Manuel Blum. How to prove a theorem so no one else can claim it. In <em> Proceesings of the International Congress of Mathematicians</em>, 1986. JH: Very dense overview of zero-knowledge proof protocols, (in which many of the protocols discussed elsewhere are dealt with rigorously) with the proof that mathematical theorems can be proven with this scheme.<P><DT><A NAME=Brassard1988><STRONG>Bra94</STRONG></A><DD>Giles Brassard. <em> Modern Cryptology</em>, volume 325 of <em> Lecture Notes in Computer Science</em>. Springer-Verlag, 1994. RB: Proceedings of a tutorial. Readable, with a final chapter on quantum cryptography.<P><DT><A NAME=BS1993a><STRONG>BS93a</STRONG></A><DD>E. Biham and A. Shamir. <em> Differential Cryptanalysis of the Data Encryption Standard</em>. Springer-Verlag, 1993. CW.<P><DT><A NAME=BS1993b><STRONG>BS93b</STRONG></A><DD>E. Biham and A. Shamir. Differential cryptanalysis of the full 16-round DES. In <em> Advances in Cryptology---Crypto '92</em>. Springer-Verlag, 1993. CW.<P><DT><A NAME=Calvocoressi1980><STRONG>Cal80</STRONG></A><DD>Peter Calvocoressi. <em> Top Secret Ultra</em>. Pantheon Books, 1980. JM: Has some good material, but not a lot and you have to dig for it.<P><DT><A NAME=CW1993><STRONG>CW93</STRONG></A><DD>K. W. Campbell and M. J. Wiener. Proof that DES is not a group. In <em> Advances in Cryptology --- Crypto '92</em>. Springer-Verlag, 1993. CW.<P><DT><A NAME=DH1977><STRONG>DH77</STRONG></A><DD>W. Diffie and M. E. Hellman. Exhaustive cryptanalysis of the NBS data encryption standard. <em> Computer</em>, 10:74--84, 1977. CW.<P><DT><A NAME=Harris1995><STRONG>Har95</STRONG></A><DD>Robert Harris. <em> Enigma</em>. Random House, 1995. JM: A fictional story based around Enigma & WW2-- entertaining and mildly informative.<P><DT><A NAME=Hellman1980><STRONG>Hel80</STRONG></A><DD>M. E. Hellman. A cryptanalytic time-memory trade off. <em> IEEE Transactions on Information Theory</em>, IT-26:401--406, 1980. CW.<P><DT><A NAME=HS1994><STRONG>HS94</STRONG></A><DD>F. H. Hinsley and Alan Stripp, editors. <em> Code breakers</em>. Oxford University Press, 1994. JM: Lots of WW2 codebreaking info, but it usually requires a bit of reading to find what you want.<P><DT><A NAME=Koblitz1987><STRONG>Kob87</STRONG></A><DD>Neal Koblitz. <em> A Course in Number Theory and Cryptography</em>, volume 14 of <em> Graduate Texts in Mathematics</em>. Springer-Verlag, 1987. RB: More number theory, above the elemenetary level, than cryptography.<P><DT><A NAME=Kozaczuk1984><STRONG>Koz84</STRONG></A><DD>Wladyslaw Kozaczuk. <em> Enigma: How the German machine cipher was broken ...</em>. University Publications of America, 1984. JM: Really useful appendix or two. Good technical reference.<P><DT><A NAME=Landau1988><STRONG>Lan88</STRONG></A><DD>Landau. Zero knowledge and the department of defense. <em> Notices of the American Mathematical Society</em>, 35(1), January 1988. JH: A narrative artice on the DoD gag order on the FFS zero-knowledge proof system (with a quasi-technical explaination of zero-knowledge proofs and the FFS system).<P><DT><A NAME=Matsui1993><STRONG>Mat93</STRONG></A><DD>M. Matsui. Linear cryptanalysis method for DES cipher. In <em> Advances in Cryptology---Eurocrypt '93</em>. Springer-Verlag, 1993. CW.<P><DT><A NAME=MH1981><STRONG>MH81</STRONG></A><DD>R. C. Merkle and M. E. Hellman. On the security of multiple encryption. <em> Communications of the ACM</em>, 24:465--467, July 1981. CW.<P><DT><A NAME=Odlyzko1990><STRONG>Odl90</STRONG></A><DD>A. M. Odlyzko. The rise and fall of knapsack cryptosystems. In Pomerance [<!WA5><A HREF="http://www.cs.pomona.edu/182bib.html#Pomerance1990">Pom90</A>], pages 75--88. RB: A self-contained description of the knapsack system and how to break it.<P><DT><A NAME=NIST1988><STRONG>oST88</STRONG></A><DD>National Institute of Standards and Technology. <em> Data Encryption Standard</em>, volume FIPS Publication 46-1. National Technical Information Service, 1988. CW: Originally issued by National Bureau of Standards.<P><DT><A NAME=Pomerance1990><STRONG>Pom90</STRONG></A><DD>C. Pomerance, editor. <em> Cryptology and Computational Number Theory</em>, volume 42 of <em> Proceedings of Symposia in Applied Mathematics</em>. American Mathematical Society, 1990. RB: Proceedings of a short course. Eight articles.<P><DT><A NAME=Rosen1993><STRONG>Ros93</STRONG></A><DD>Kenneth H. Rosen. <em> Elementary Number Theory and its Applications</em>. Addison-Wesley, third edition, 1993. RB: An introductory number theory text with up-to-date applications, including some cryptography.<P><DT><A NAME=RSA1978><STRONG>RSA78</STRONG></A><DD>R. L. Rivest, A. Shamir, and L. Adleman. A method for obtaining digital signatures and public-key cryptosystems. <em> Communications of the ACM</em>, 21(2):120--126, February 1978. RB: The seminal paper on the RSA algorithm.<P><DT><A NAME=Shamir1984><STRONG>Sha84</STRONG></A><DD>Adi Shamir. A polynomial-time algorithm for breaking the basic merkle-hellman cryptosystem. <em> IEEE Transactions on Information Theory</em>, IT-30(5):699--704, September 1984. RB: The key result in the downfall of knapsack cryptosystems. A different approach from the presentation in [<!WA6><A HREF="http://www.cs.pomona.edu/182bib.html#Odlyzko1990">Odl90</A>]---perhaps easier to understand.<P><DT><A NAME=Simmons1982><STRONG>Sim82</STRONG></A><DD>Gustavus J. Simmons, editor. <em> Secure Communication and Asymmetric Cryptosystems</em>, volume 69 of <em> AAAS Selected Symposium</em>. Westview Press, 1982. RB: Proceedings of a short course. Well-written articles at the cutting edge of the early 1980's.<P><DT><A NAME=VanLeeuwen1990><STRONG>Van90</STRONG></A><DD>J. Van Leeuwen, editor. <em> The Handbook of Theoretical Computer Science</em>, volume 1. MIT Press, 1990. JH: An overview of computer science. The chapter on encryption was written by Rivest, and so is an excellent explaination of just about all important topics in the subject, along with a huge bibliography.<P><DT><A NAME=Wiener1993><STRONG>Wie93</STRONG></A><DD>M. J. Wiener. Efficient DES key search, 1993. Presented at Crypto '93 rump session. CW.</DL><P><BR> <HR><P><ADDRESS><I><!WA7><A HREF="mailto:rbull@pomona.edu">Everett Bull</A><BR>February 29, 1996</I></ADDRESS></BODY>⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?