%% URL: "http://theory.lcs.mit.edu/~rivest/crypto.bib" %% Maintained by Be Hubbard and Ronald L. Rivest. %% Last updated 4/2/95 (1268 entries) %% This bibliography contains COMPLETE listings for: %% CRYPTO '81--'94, EUROCRYPT '84, AUSCRYPT'90 %% Burg Feuerstein '82 %% and PARTIAL lists for many other conferences. %% We are in the process of merging into this bibliography the %% bibliography from "Cryptography: Theory and Practice" by Doug %% Stinson (CRC Press, 1995). An excellent book! (Thanks, Doug) %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %% Various journal and conference string definitions: @string{ASIACRYPT91 = "Advances in Cryptology--ASIACRYPT '91"} @string{AUSCRYPT90 = "Advances in Cryptology--AUSCRYPT '90"} @string{CACM = {Communications of the ACM}} @string{JCSS = {JCSS}} @string{SIAM = {SIAM J.\ Computing}} @string{ACM = {ACM}} @string{IEEE = {IEEE}} @string{AFIPS = {AFIPS}} @string{CRYPTO81 = "Advances in Cryptology: A Report on CRYPTO 81"} @string{CRYPTO82 = "Proc.\ CRYPTO 82"} @string{CRYPTO83 = "Proc.\ CRYPTO 83"} @string{CRYPTO84 = "Proc.\ CRYPTO 84"} @string{CRYPTO85 = "Proc.\ CRYPTO 85"} @string{CRYPTO86 = "Proc.\ CRYPTO 86"} @string{CRYPTO87 = "Proc.\ CRYPTO 87"} @string{CRYPTO88 = "Proc.\ CRYPTO 88"} @string{CRYPTO89 = "Proc.\ CRYPTO 89"} @string{CRYPTO90 = "Proc.\ CRYPTO 90"} @string{CRYPTO91 = "Proc.\ CRYPTO 91"} @string{CRYPTO92 = "Proc.\ CRYPTO 92"} @string{CRYPTO93 = "Proc.\ CRYPTO 93"} @string{CRYPTO94 = "Proc.\ CRYPTO 94"} @string{CRYPTO94 = "Proc.\ CRYPTO 95"} @string{EUROCRYPT84 = {Proc.\ EUROCRYPT 84}} @string{EUROCRYPT85 = {Proc.\ EUROCRYPT 85}} @string{EUROCRYPT86 = {Proc.\ EUROCRYPT 86}} @string{EUROCRYPT87 = {Proc.\ EUROCRYPT 87}} @string{EUROCRYPT88 = {Proc.\ EUROCRYPT 88}} @string{EUROCRYPT89 = {Proc.\ EUROCRYPT 89}} @string{EUROCRYPT90 = {Proc.\ EUROCRYPT 90}} @string{EUROCRYPT91 = {Proc.\ EUROCRYPT 91}} @string{EUROCRYPT92 = {Proc.\ EUROCRYPT 92}} @string{EUROCRYPT93 = {Proc.\ EUROCRYPT 93}} @string{EUROCRYPT94 = {Proc.\ EUROCRYPT 94}} @string{EUROCRYPT95 = {Proc.\ EUROCRYPT 95}} @string{FOCS77 = {Proc.\ $18$th IEEE Symp.\ on Foundations of Comp.\ Science}} @string{FOCS78 = {Proc.\ $19$th IEEE Symp.\ on Foundations of Comp.\ Science}} @string{FOCS79 = {Proc.\ $20$th IEEE Symp.\ on Foundations of Comp.\ Science}} @string{FOCS80 = {Proc.\ $21$st IEEE Symp.\ on Foundations of Comp.\ Science}} @string{FOCS81 = {Proc.\ $22$nd IEEE Symp.\ on Foundations of Comp.\ Science}} @string{FOCS82 = {Proc.\ $23$rd IEEE Symp.\ on Foundations of Comp.\ Science}} @string{FOCS83 = {Proc.\ $24$th IEEE Symp.\ on Foundations of Comp.\ Science}} @string{FOCS84 = {Proc.\ $25$th IEEE Symp.\ on Foundations of Comp.\ Science}} @string{FOCS85 = {Proc.\ $26$th IEEE Symp.\ on Foundations of Comp.\ Science}} @string{FOCS86 = {Proc.\ $27$th IEEE Symp.\ on Foundations of Comp.\ Science}} @string{FOCS87 = {Proc.\ $28$th IEEE Symp.\ on Foundations of Comp.\ Science}} @string{FOCS88 = {Proc.\ $29$th IEEE Symp.\ on Foundations of Comp.\ Science}} @string{FOCS89 = {Proc.\ $30$th IEEE Symp.\ on Foundations of Comp.\ Science}} @string{FOCS90 = {Proc.\ $31$st IEEE Symp.\ on Foundations of Comp.\ Science}} @string{FOCS91 = {Proc.\ $32$nd IEEE Symp.\ on Foundations of Comp.\ Science}} @string{FOCS92 = {Proc.\ $33$rd IEEE Symp.\ on Foundations of Comp.\ Science}} @string{FOCS93 = {Proc.\ $34$th IEEE Symp.\ on Foundations of Comp.\ Science}} @string{FOCS94 = {Proc.\ $35$th IEEE Symp.\ on Foundations of Comp.\ Science}} @string{FOCS95 = {Proc.\ $36$th IEEE Symp.\ on Foundations of Comp.\ Science}} @string{STOC79 = {Proc.\ $11$th ACM Symp.\ on Theory of Computing}} @string{STOC80 = {Proc.\ $12$th ACM Symp.\ on Theory of Computing}} @string{STOC81 = {Proc.\ $13$th ACM Symp.\ on Theory of Computing}} @string{STOC82 = {Proc.\ $14$th ACM Symp.\ on Theory of Computing}} @string{STOC83 = {Proc.\ $15$th ACM Symp.\ on Theory of Computing}} @string{STOC84 = {Proc.\ $16$th ACM Symp.\ on Theory of Computing}} @string{STOC85 = {Proc.\ $17$th ACM Symp.\ on Theory of Computing}} @string{STOC86 = {Proc.\ $18$th ACM Symp.\ on Theory of Computing}} @string{STOC87 = {Proc.\ $19$th ACM Symp.\ on Theory of Computing}} @string{STOC88 = {Proc.\ $20$th ACM Symp.\ on Theory of Computing}} @string{STOC89 = {Proc.\ $21$st ACM Symp.\ on Theory of Computing}} @string{STOC90 = {Proc.\ $22$nd ACM Symp.\ on Theory of Computing}} @string{STOC91 = {Proc.\ $23$rd ACM Symp.\ on Theory of Computing}} @string{STOC92 = {Proc.\ $24$th ACM Symp.\ on Theory of Computing}} @string{STOC93 = {Proc.\ $25$th ACM Symp.\ on Theory of Computing}} @string{STOC94 = {Proc.\ $26$th ACM Symp.\ on Theory of Computing}} @string{STOC95 = {Proc.\ $27$th ACM Symp.\ on Theory of Computing}} @string{PODC87 = {Proc.\ $6$th ACM Symp.\ on Principles of Distributed Computation}} @string{PODC86 = {Proc.\ $5$th ACM Symp.\ on Principles of Distributed Computation}} @string{PODC95 = {Proc.\ $14$th ACM Symp.\ on Principles of Distributed Computation}} %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %% Sorted into order by latex key value @inproceedings{AbadiAlBrFeHe88, author = {M. Abadi and E. Allender and A. Broder and J. Feigenbaum and L.A. Hemachandra}, title = {On Generating Solved Instances of Computational Problems}, pages = {297--310}, booktitle = CRYPTO88, editor = {S. Goldwasser}, note = {Lecture Notes in Computer Science No.\ 403 }, publisher = {Springer-Verlag}, year = 1988 } @article{AbadiFeKi89, author = {Martin Abadi and Joan Feigenbaum and Joe Kilian}, title = {On Hiding Information from an Oracle}, journal = {Journal of Computer and Systems Science}, volume = 39, number = 1, year = 1989, pages = {21--50} } @inproceedings{AbadiBuLa92, author = {M. Abadi and M. Burrows and B. Lampson}, title = {A calculus for access control in distributed systems}, pages = {1--23}, booktitle = CRYPTO91, editor = {J. Feigenbaum}, note = {Lecture Notes in Computer Science No.\ 576}, publisher = {Springer}, year = 1992 } @inproceedings{Abadi97, author = {Martin Abadi}, title = {On SDSI's Linked Local Name Spaces}, booktitle = {Proceedings 10th IEEE Computer Security Foundations Workshop}, month = Jun, year = 1997 } @manual{AccreditedSC81, author = {{Accredited Standards Committee X3}}, year = {1981}, title = {American National Standard X3.92: Data Encryption Algorithm ({DEA})} } @manual{AccreditedSC82, author = {{Accredited Standards Committee X9}}, year = {1982}, title = {American National Standard X9.9: Financial Institution Message Authentication} } @manual{AccreditedSC85, author = {{Accredited Standards Committee X9}}, year = {1985}, title = {American National Standard X9.17: Financial Institution Key Management (Wholesale)} } @manual{AccreditedSC93, newtag = {AccreditedSC93}, author = {{Accredited Standards Committee X9}}, year = {1993}, title = {Working Draft: American National Standard X9.30-199X: Public Key Cryptography Using Irreversible Algorithms for the Financial Services Industry: Part 1: The Digital Signature Algorithm (DSA)}, month = {June 18,} } @manual{AccreditedSC93a, newtag = {AccreditedSC93a}, author = {{Accredited Standards Committee X9}}, year = {1993}, title = {Working Draft: American National Standard X9.30-1993: Public Key Cryptography Using Irreversible Algorithms for the Financial Services Industry: Part 2: The Secure Hash Algorithm ({SHA})} } @manual{AccreditedSC93b, newtag = {AccreditedSC93b}, author = {{Accredited Standards Committee X9}}, year = {1993}, title = {Working Draft: American National Standard X9.30-1993: Public Key Cryptography Using Irreversible Algorithms for the Financial Services Industry: Part 4: Management of Symmetric Algorithm Keys Using {Diffie-Hellman}}, month = {June 4,} } @manual{AccreditedSC93c, newtag = {AccreditedSC93c}, author = {{Accredited Standards Committee X9}}, year = {1993}, title = {Working Draft: American National Standard X9.31-1992: Public Key Cryptography Using Reversible Algorithms for the Financial Services Industry: Part 1: The {RSA} Signature Algorithm}, month = {March 7,} } @manual{AccreditedSC93d, newtag = {AccreditedSC93d}, author = {{Accredited Standards Committee X9}}, year = {1993}, title = {Working Draft: American National Standard X9.31-1992: Public Key Cryptography Using Reversible Algorithms for the Financial Services Industry: Part 2: The {MDC-2} Hash Algorithm}, month = {June 4,} } @manual{AccreditedSC93e, newtag = {AccreditedSC93e}, author = {{Accredited Standards Committee X9}}, year = {1993}, title = {Working Draft: American National Standard X9.31-1993: Public Key Cryptography Using Reversible Algorithms for the Financial Services Industry: Part 4: Management of Symmetric Algorithm Keys Using {RSA}}, month = {June 4,} } @manual{AccreditedSC93f, newtag = {AccreditedSC93f}, author = {{Accredited Standards Committee X9}}, year = {1993}, title = {Working Draft: American National Standard X9.41-1993: Security Services Management for the Financial Services Industry}, month = {August} } @phdthesis{Adams90, author = {C.M. Adams}, title = {A formal and practical design procedure for substitution-permutation network cryptosystems}, school = {Queen's University}, year = 1990 } @article{Adams92, author = {Adams, C.M.}, year = {1992}, title = {{On Immunity against Biham and Shamir's ``Differential Cryptanalysis''}}, journal = {Information Processing Letters}, volume = 41, number = 2, pages = {77--80} } @inproceedings{AdamsMe88, author = {Carlisle M. Adams and Henk Meijer}, title = {Security-related comments regarding McEliece's public-key cryptosystem}, pages = {224--228}, booktitle = CRYPTO87, editor = {Carl Pomerance}, note = {Lecture Notes in Computer Science No.\ 293 }, publisher = {Springer-Verlag}, year = 1988 } @inproceedings{AdamsTa90, author = {Carlisle Adams and Stafford Tavares}, title = {Good-{S}-boxes are easy to find}, pages = {612--615}, booktitle = CRYPTO89, editor = {G. Brassard}, note = {Lecture Notes in Computer Science No.\ 435}, publisher = {Springer-Verlag}, year = 1990 } @article{AdamsTa90a, author = {C.M. Adams and S.E. Tavares}, title = {Generating and counting binary bent sequences}, journal = {IEEE Transactions on Information Theory}, month = Sep, year = 1990, volume = 36, number = 5, pages = {1170--1173} } @article{AdamsTa90b, author = {C.M. Adams and S.E. Tavares}, title = {The Structured Design of Cryptographically Good {S}-Boxes}, journal = {Journal of Cryptology}, year = 1990, volume = 3, number = 1, pages = {27--41} } @inproceedings{Adleman77, author = {L. M. Adleman}, title = {A Subexponential Algorithm for the Discrete Logarithm Problem with Applications to Cryptography}, pages = {55--60}, booktitle = FOCS77, address = {Providence}, year = 1977, publisher = {IEEE} } @inproceedings{Adleman82, author = {Leonard Adleman}, title = {Primality Testing}, pages = {10--10}, booktitle = CRYPTO81, editor = {Allen Gersho}, organization = {U.C. Santa Barbara Dept. of Elec. and Computer Eng.}, note = {Tech Report 82-04}, year = 1982 } @inproceedings{Adleman83, author = {L. M. Adleman}, title = {On Breaking Generalized Knapsack Public Key Cryptosystems}, pages = {402--412}, booktitle = STOC83, publisher = ACM, address = {Boston}, year = 1983 } @inproceedings{Adleman83a, author = {Leonard M. Adleman}, title = {Implementing an Electronic Notary Public}, pages = {259--265}, booktitle = CRYPTO82, editor = {R. L. Rivest and A. Sherman and D. Chaum}, publisher = {Plenum Press}, address = {New York}, year = 1983 } @inproceedings{Adleman83b, author = {Leonard M. Adleman}, title = {On Breaking the Iterated {M}erkle-{H}ellman Public-Key Cryptosystem}, pages = {303--308}, booktitle = CRYPTO82, editor = {R. L. Rivest and A. Sherman and D. Chaum}, publisher = {Plenum Press}, address = {New York}, year = 1983 } @techreport{Adleman90, author = {L. M. Adleman}, title = {Factoring Numbers Using Singular Integers}, institution = {U.S.C. Computer Science Department}, number = {TR 90-20}, month = Sep, year = 1990 } @inproceedings{Adleman88, author = {L.M. Adleman}, title = {An Abstract Theory of Computer Viruses}, pages = {354--374}, booktitle = CRYPTO88, editor = {S. Goldwasser}, note = {Lecture Notes in Computer Science No.\ 403 }, publisher = {Springer-Verlag}, year = 1988 } @inproceedings{Adleman94, author = {Leonard M. Adleman}, title = {Algorithmic Number Theory--The Complexity Contribution}, booktitle = STOC94, publisher = ACM, address = {Montreal, Canada}, year = 1994, pages = {88--113} } @article{Adleman95, author = {Leonard M. Adleman}, title = {A thousand billion billion sums}, journal = {The Economist}, year = 1995, pages = {83--84} } @inproceedings{AdlemanDe94, author = {Leonard M. Adleman and Johnathan DeMarrais}, title = {A subexponential algorithm for discrete logarithms over all finite fields }, pages = {147--158}, booktitle = CRYPTO93, editor = {Douglas R. Stinson}, note = {Lecture Notes in Computer Science No.\ 773}, publisher = {Springer}, year = 1994 } @inproceedings{AdlemanHu87, author = {L. M. Adleman and M. A. Huang}, title = {Recognizing primes in random polynomial time}, pages = {462--469}, booktitle = STOC87, publisher = ACM, address = {New York City}, year = 1987 } @inproceedings{AdlemanMaMi77, author = {L. M. Adleman and K. Manders and G. Miller}, title = {On taking roots in finite fields}, pages = {175--177}, booktitle = FOCS77, address = {Providence}, publisher = IEEE, year = 1977 } @article{AdlemanPoRu83, author = {L. M. Adleman and C. Pomerance and R. S. Rumely}, title = {On distinguishing prime numbers from composite numbers}, journal = {Ann. Math.}, volume = 117, year = 1983, pages = {173--206} } @inproceedings{Agnew85, author = {Gordon B. Agnew}, title = {Secrecy and Privacy in a Local Area Network Environment}, pages = {349--363}, booktitle = EUROCRYPT84, editor = {T. Beth and N. Cot and I. Ingemarsson}, note = {Lecture Notes in Computer Science No.\ 209}, publisher = {Springer-Verlag}, year = 1985 } @inproceedings{AgnewMuVa88, author = {Agnew, G.B. and Mullin, R.C. and Vanstone, S.A.}, year = 1988, title = {A secure public key protocol based on discrete exponentiation}, booktitle = {Advances in Cryptology --- Eurocrypt '88}, editor = {C.G. {G\"{u}nther}}, publisher = {Springer-Verlag}, address = {Berlin}, pages = {159--166} } @inproceedings{AielloBeVe95, author = {William Aiello and Mihir Bellare and Ramarathnam Venkatesan}, title = {Knowledge on the Average--- Perfect, Statistical and Logarithmic}, pages = {469-478}, booktitle = STOC95, publisher = ACM, address = {Las Vegas}, year = 1995 } @article{AielloGoHa90, author = {W. Aiello and S. Goldwasser and J. Hastad}, title = {On the Power of Interaction}, journal = {Combinatorica}, volume = 10, number = 1, year = 1990, pages = {3-25} } @article{AielloHa91, author = {W. Aiello and J. Hastad}, title = {Statistical Zero Knowledge Can Be Recognized in Two Rounds}, journal = JCSS, volume = 42, year = 1991, pages = {327--345} } @inproceedings{Akl84, author = {Selim G. Akl}, title = {On the Security of Compressed Encodings}, pages = {209--230}, booktitle = CRYPTO83, editor = {D. Chaum}, publisher = {Plenum Press}, address = {New York}, year = 1984 } @inproceedings{AklMe85, author = {Selim G. Akl and Henk Meijer}, title = {A Fast Pseudo Random Permutation Generator with Applications to Cryptology}, pages = {269--275}, booktitle = CRYPTO84, editor = {G. R. Blakley and D. C. Chaum}, note = {Lecture Notes in Computer Science No.\ 196}, publisher = {Springer}, year = 1985 } @inproceedings{AklTa83, author = {Selim G. Akl and Peter D. Taylor}, title = {Cryptographic Solution to a Multilevel Security Problem}, pages = {237--249}, booktitle = CRYPTO82, editor = {R. L. Rivest and A. Sherman and D. Chaum}, publisher = {Plenum Press}, address = {New York}, year = 1983 } @inproceedings{AlexiChGoSc84, author = {W. B. Alexi and B. Chor and O. Goldreich and C. P. Schnorr}, title = {{RSA/Rabin} bits are ${1/2} + {1/{poly(\log(N))}}$ Secure}, pages = {449--457}, booktitle = FOCS84, address = {Singer Island}, publisher = IEEE, year = 1984 } @article{AlexiChGoSc88, author = {W. B. Alexi and B. Chor and O. Goldreich and C. P. Schnorr}, title = {{RSA}/{Rabin} functions: certain parts are as hard as the whole}, pages = {194--209}, journal = {SIAM J. Computing}, year = 1988, month = Apr, volume = 17, number = 2 } @INPROCEEDINGS{Alagar90, author = {V.S. Alagar}, title = {Range Equations and Range Matrices: A Study in Statistical Database Security}, booktitle = AUSCRYPT90, year = 1990, editor = {J. Seberry and J. Pieprzyk}, series = {Lecture Notes in Computer Science}, volume = 453, publisher = {Springer-Verlag}, pages = {360--385} } @inproceedings{AlonGaYu, author = {N. Alon and Z. Galil and M. Yung}, year = 1995, title = {Verifiable secret sharing and achieving simultaneity in the presence of faults}, booktitle = {Proc.\ 3rd Annual European Symposium on Algorithmns}, series = {Lecture Notes in Computer Science 979}, volume = {ESA 95}, publisher = {Springer Verlag}, pages = {523--537} } @article{AlonGoHaPe92, author = {N. Alon and O. Goldreich and J. Hastad and R. Peralta}, title = {Simple Constructions of Almost $k-$wise Independent Random Variables}, journal = {Journal of Random Structures and Algorithms}, volume = 3, number = 3, year = 1992, pages = {289--304} } @article{AlpernSc83, author = {B. Alpern and F. B. Schneider}, title = {Key exchange using `Keyless Cryptography'}, journal = {Information Processing Letters}, volume = 16, year = 1983, pages = {79--81} } @Article{AmaKan95, Author = "E. Amaldi and V. Kann", Title = "The complexity and approximability of finding maximum feasible subsystems of linear relations", Journal = "Theoret. Comput. Sci.", Volume = "147", Year = "1995", Pages = "181--210" } @manual{AmeritechMob93, newtag = {AmeritechMob93}, author = {{Ameritech Mobile Communications {\em et al}}}, year = {1993}, title = {Cellular Digital Packet Data System Specifications: Part 406: Airlink Security} } @article{AmesGaSc83, author = {S. Ames and M. Gasser and R. Schell}, title = {Security Kernel Design and Implementation; An Introduction}, journal = {IEEE Computer}, volume = 16, number = 7, year = 1983 } @INPROCEEDINGS{Ames90, author = {M. Ames}, title = {Secure Cryptographic Initialization}, booktitle = AUSCRYPT90, year = 1990, editor = {J. Seberry and J. Pieprzyk}, series = {Lecture Notes in Computer Science}, volume = 453, publisher = {Springer-Verlag}, pages = {451--462} } @inproceedings{AmiraziziHe82, author = {Hamid Amirazizi and Martin E. Hellman}, title = {Time-Memory-Processor Tradeoffs}, pages = {7-9}, booktitle = CRYPTO81, editor = {Allen Gersho}, organization = {U.C. Santa Barbara Dept. of Elec. and Computer Eng.}, note = {Tech Report 82-04}, year = 1982 } @inproceedings{AmiraziziKaRe82, author = {Hamid Amirazizi and Ehud Karnin and Justin Reyneri}, title = {A Polynomial Time Solution for Compact Knapsacks}, pages = {17--19}, booktitle = CRYPTO81, editor = {Allen Gersho}, organization = {U.C. Santa Barbara Dept. of Elec. and Computer Eng.}, note = {Tech Report 82-04}, year = 1982 } @techreport{Anderson72, author = {J.P. Anderson}, title = {Computer Security Technology Planning Study}, institution = {Hanscom AFB}, number = {ESD--TR--73--51}, month = {October}, year = 1972 } % note: not in class file cabinet yet @article{Anderson93, author = {Ross Anderson}, year = 1993, title = {A Practical {RSA} Trapdoor}, journal = {Electronics Letters}, volume = 29, number = 11, month = {27 May}, pages = 995 } @article{Anderson94, author = {Ross J. Anderson}, title = {Why Cryptosystems Fail}, journal = {Communications of the ACM}, month = Nov, year = 1994, volume = 37, number = 11, pages = {32--41} } @inproceedings{AndersonBi96, author = {Ross Anderson and Eli Biham}, title = {Two Practical and Probably Secure Block Ciphers: {BEAR} and {LION}}, pages = {114--120}, booktitle = {Fast Software Encryption}, editor = {Dieter Gollman}, publisher = {Springer}, year = 1996, note = {(Proceedings Third International Workshop, Feb.\ 1996, Cambridge, UK)} } @misc{AndersonMaSu95, author = {Ross Anderson and Harry Manifavas and Chris Sutherland}, title = {A Practical Electronic Cash System}, institution = {Computer Laboratory, Pembroke Street, Cambridge {CB2 3QG}, U.K.}, year = 1995, note = {Available from author: {\tt Ross.Anderson@cl.cam.ac.uk}} } @book{Andrews76, title = {The Theory of Partitions}, author = {George E. Andrews}, publisher = {Addison-Wesley}, year = 1976, volume = 2, series = {Encyclopedia of Mathematics and its Applications} } @techreport{Angluin82, author = {D. Angluin}, title = {Lecture notes on the complexity of some problems in number theory}, institution = {Yale University Computer Science Department}, year = 1982, month = Aug, number = {TR-243} } @techreport{AngluinLi83, author = {D. Angluin and D. Lichtenstein}, title = {Provable Security of Cryptosystems: A Survey}, institution = {Yale University Department of Computer Science}, month = Oct, year = 1983, number = {TR-288} } @INPROCEEDINGS{AnthonyMaSeWi90, author = {M.H.G. Anthony and K.M. Martin and J. Seberry and P. Wild}, title = {Some Remarks on Authentication Systems}, booktitle = AUSCRYPT90, year = 1990, editor = {J. Seberry and J. Pieprzyk}, series = {Lecture Notes in Computer Science}, volume = 453, publisher = {Springer-Verlag}, pages = {122--139} } @book{Anton91, author = {H. Anton}, title = {Elementary Linear Algebra (Sixth Edition)}, publisher = {John Wiley and Sons}, year = 1991 } @book{Apostol76, author = {Tom M. Apostol}, title = {Introduction to Analytic Number Theory}, publisher = {Springer-Verlag}, year = 1976 } @techreport{AokiOhArMa94, author = {Aoki, K. and Ohta, K. and Araki, S. and Matsui, M.}, year = {1994}, title = {Linear Cryptanalysis of {FEAL-8} (Experimentation Report)}, institution = {IEICE}, number = {ISEC 94-6 (1994-05)} } @InProceedings{AroraLuMoSuSz91, author = {Sanjeev Arora and Carsten Lund and Rajeev Motwani and Madhu Sudan and Mario Szegedy}, title = {Proof Verification and Hardness of Approximation Problems}, month = {October}, year = {1991}, booktitle = {Proc.\ 33rd IEEE Foundations of Computer Science}, pages = {14--23} } @article{AsmuthBl81, author = {C. A. Asmuth and G. R. Blakley}, title = {An efficient algorithm for constructing a cryptosystem which is harder to break than two other cryptosystems}, journal = {Comp.\ and Maths.\ with Appls.}, year = 1981, volume = 7, pages = {447--450} } @inproceedings{AumannFe94, author = {Yonatan Aumann and Uriel Feige}, title = {On message proof systems with known space verifiers}, pages = {85--99}, booktitle = CRYPTO93, editor = {Douglas R. Stinson}, note = {Lecture Notes in Computer Science No.\ 773}, publisher = {Springer}, year = 1994 } @inproceedings{AvisTa83, author = {G.M. Avis and S.E. Tavares}, title = {Using Data Uncertainty to Increase the Crypto-Complexity of Simple Private Key Enciphering Schemes}, pages = {139--143}, booktitle = CRYPTO82, editor = {R. L. Rivest and A. Sherman and D. Chaum}, publisher = {Plenum Press}, address = {New York}, year = 1983 } @inproceedings{AwerbuchChGoMi86, author = {Awerbuch, B. and Chor, B. and Goldwasser, S. and Micali, S.}, year = 1986, title = {Verifiable secret sharing and achieving simultaneity in the presence of faults}, booktitle = {Proc.\ 26th Annual IEEE Symp.\ of Foundations of Computer Science}, publisher = {IEEE}, address = {New York}, pages = {383--395} } @inproceedings{Bach83, author = {Eric Bach}, title = {How to generate factored random numbers}, pages = {184--188}, booktitle = Stoc83, publisher = Acm, address = {Boston}, year = 1983 } @Article{Bach88, author = {Eric Bach}, title = {How to generate factored random numbers}, pages = {179--193}, journal = {SIAM J. Computing}, year = 1988, month = Apr, volume = 17, number = 2 } @inproceedings{Bach88a, author = {Eric Bach}, title = {Intractable Problems in Number Theory}, pages = {77--93}, booktitle = CRYPTO88, editor = {S. Goldwasser}, note = {Lecture Notes in Computer Science No. 403 }, publisher = {Springer-Verlag}, year = 1988 } @incollection{Bach90, author = {Eric Bach}, title = {Number-Theoretic Algorithms}, booktitle = {Annual Review of Computer Science}, publisher = {Annual Reviews, Inc.}, addr = {Palo Alto}, year = 1990, volume = 4, pages = {119--172} } @article{Bach91, author = {Eric Bach}, title = {Toward a Theory of {Pollard's Rho} Method}, journal = {Information and Computation}, volume = 90, year = 1991, number = 2, month = Feb, pages = {139--155}, comment = {Rigorous approach, in contrast to usual heuristic analysis. Proves rigorously that for $n=pq$, with $p