Криптография 2е издание Протоколы, алгоритмы и исходные тексты на языке С
 Скачать 3.25 Mb.
|
|
Part 406: Airlink Security," CDPD Industry Input Coordinator. Costa Mesa, Calif.. Jul 1993. 38. H.R. Amirazizi, E.D. Karnin, and J.M. Reyneri, "Compact Knapsacks are Polynomial Solvable," ACM SIGACT News, v.15, 1983, pp. 20-22. 39. R.J. Anderson, "Solving a Class of Stream Ciphers," Cryptologia, v. 14, n. 3, Jul 1990, pp. 285-288. 40. R.J. Anderson, "A Second Generation Electronic Wallet," ESORICS 92, Proceedings of the Second European Symposium on Research in Computer Security, Springer 54. Verlag, 1992, pp. 411 418. 41. R.J. Anderson, "Faster Attack on Certain Stream Ciphers, " Electronics Letters, v. 29, n. 15, 22 Jul 1993, pp. 1322-1323. 42. R.J. Anderson! "Derived Sequence Attacks on Stream Ciphers, " presented at the rump session of CRYPTO '93, Aug 1993. 43. R.J. Anderson, "Why Cryptosystems Fail," lst ACM Conference on Computer and Communications Security ACM Press, 1993, pp. 215-227. 44. R.J. Anderson, "Why Cryptosystems Fail," Communications of the ACM, v. 37, n. 11, Nov 1994, pp. 32 40. 45. R.J. Anderson, "On Fibonacci Keystream 58. Generators, " K. U. Lezzven Workshop on Cryptographic Algorithms, Springer-Verlag, 1995, to appear. 46. R.J. Anderson, "Searching for the Optimum Correlation Attack, " K. U. Leuven Workshop on Cryptographic Algorithms, Springer-Verlag, 1995. to appear. 47. R.J. Anderson and T.M.A. Lomas, "Fortifying Key Negotiation Schemes with Poorly Chosen Passwords," Electronics Letters, v. 30, n. 13, 23 Jun 1994, pp. 1040-1041. 48. R.J. Anderson and R. Needham, "Robustness Principles for Public Key Protocols," Advances in Cryptology CRYPTO '95 Proceedings, Springer-Verlag, 1995, to appear, 49. D. Andleman and J. Reeds, "On the Cryptanalysis of Rotor Machines and Substitution- Permutation Networks," IEEE Trans actions on Information Theory, v. IT-28, n. 4, Jul 1982, pp. 578-584. 50. ANSI X3.92, "American National Standard for Data Encryption Algorithm (DEA )," Ameriean National Standards Institute, 1981. 51. ANSI X3.105, "American National Standard for Information Systems Data Link Encryption, " Ameriean National Standards Institute, 1983. 52. ANSI X3.106, "American National Standard for Information Systems Data Encryption Algorithm Modes of Operation," Ameriean National Standards Institute, 1 983. 53. ANSI X9.8, "American National Standard for Personal Information Number (PIN ) Management and Security, " American Bankers Association, 1982. 54. ANSI X9.9 (Revised, "American National Standard for Financial Institution Message Authentication (Wholesales), " American Bankers Association, 1986. 55. ANSI X9.17 (Revised. "American National Standard for Financial Institution Key Management (Wholesales)" American Bankers Assoeiation, 1985. 56. ANSI X9.19, "American National Standard for Retail Message Authentication," Ameriean Bankers Assoeiation, 1985. 57. ANSI X9.23, "American National Standard for Financial Institution Message Encryption, " American Bankers Assoeiation, 1988. 58. ANSI X9.24, "Draft Proposed Ameriean National Standard for Retail Key Management," Ameriean Bankers Assoeiation, 1988. 59. ANSI X9.26 (Revised). "American National Standard for Financial Institution Sign-On Authentication for Wholesale Financial Transaction," American Bankers Association, 1990. 60. ANSI X9.30, "Working Draft: Public Key Cryptography Using irreversible Algorithms for the Financial Services Industry''' Ameriean Bankers Association, Aug 1994. 61. ANSI X9.31, "Working Draft: Public Key Cryptography Using Reversible Algorithms for the Financial Services Industry," Ameriean Bankers Association, Mar 1993. 62. K. Aoki and K. Ohta, "Differential-Linear Cryptanalysis of FEAL-8," Proceedings of the 1995 Symposium on Cryptography and Information Security (SCIS by), Innyama, Japan, 24-27 Jan 1995, pp. A3.4.1-11. (In Japanese) 63. K. Araki and T. Sekine, "On the Conspiracy Problem of the Generalized Tanaka's Cryptosystem," IEICE Transactions, v. E74, n. 8, Aug 1991, pp. 2176-2178. 64. S. Araki, K. Aoki, and K. Ohta, "The Best Linear Expression Search for FEAL," Pro- ceedings of the 1995 Symposium on Cryptography and Information Security (SCIS 95), Inuyama, Japan, 24-27 Jan 1995, pp. A4.4.1-10. 65. C. Asmuth and J. Bloom, "A Modular Approach to Key Safeguarding," IE EE Transactions on Information Theory, v. IT- 29, n. 2, Mar 1983, pp. 208 210. 66. D. Atkins, M. Graff, A.K. Lenstra, and RC. Leyland, "The Magic Words are Squeamish Ossifrage, " Advances in Cryptology ASIA CRYPT '94 Proceedings, Springer- Verlag, 1995, pp. 263-277. 67. AT&T, "T7001 Random Number Generator," Data Sheet, Aug 1986. 68. AT<, "ATTEST Readying New Spy-Proof Phone for Big Military and Civilian Markets," The Report on ATTEST, 2 Jun 1986, pp. 6-7. 69. AT&T, "T7002/T7003 Bit Slice Multiplier," product announcement, 1987. 70. AT&T, "Telephone Security Device TSD 3600 User's Manual, " ATTEST, 20 Sep 1992. 71. Y. Aumann and U. Feige, "On Message Proof Systems with Known Space Verifiers," Advances in Cryptology CRYPTO '93 Proceedings, Springer-Verlag, 1994, pp. 85-99. 72. R.G. Ayoub, An Introduction to the Theory of Numbers, Providence, Rl: American Mathematical Society, 1963. 73. A. Aziz and W. Diffie, "Privacy and Authentication for Wireless Local Area Networks," IEEE Personal Communications, v. l, n. 1, 1994, pp. 25-31. 74. A. Bahreman and J.D. Tygar, "Certified Electronic Mail," Proceedings of the Internet Society 1994 Workshop on Network and Distributed System Secunty, The Internet Society, 1994, pp. 3-19. 75. D. Balenson, "Automated Distribution of Cryptographic Keys Using the Financial Institution Key Management Standard, " IEEE Communications Magazine, v. 23, n. 9. Sep 1985, pp. 41-46. 76. D. Balenson, "Privacy Enhancement for Internet Electronic Mail: Part 111: Algo 91. rithms, Modes, and Identifiers, " RFC 1423, Feb 1993. 77. D. Balenson, C.M. Ellison, S.B. Lipner, and S.T. Walker, "A New Approach to Software Key Escrow Encryption," TIS Report #520, Trusted Information Systems, Aug 94 78. R. Ball, Mathematical Recreations and Essays, New York: MacMillan, 1960. 79. J. Bamford, The Puzzle Palace, Boston: 93. Houghton Mifflin, 1982. 80. J. Bamford and W. Madsen, The Puzzle Palace, Second Edition, Penguin Books, 1995. 81. S.K. Banerjee, "High Speed Implementa- tion of DES," Computers ed Security, v. l, 1982, pp. 261-267. 82. Z. Baodong, "MC-Veiled Linear Transform Public Key Cryptosystem," Acta Electron- ica Sinica, v. 20, n. 4, Apt 1992, pp. 21-24. {In Chinese 1 83. P.H. Bardell, "Analysis of Cellular Automata Used as Pseudorandom Pattern Generators," Proceedings of 1990 Interna- tional Test Conference, pp. 762-768. 84. T. Baritaud, H. Gilbert, and M. Girault, "FFT Hashing is not Collision-Free, " Advances in Cryptology EUR OCRYPT '92 Proceedings, Springer-Verlag, 1993, pp. 35-44. 85. C. Barker, "An Industry Perspective of the CCEP, " 2nd Annual AIAA Computer Security Conference Proceedings, 1986. 86. W.G. Barker, Cryptanalysis of the Hagelin Cryptograph, Aegean Park Press, 1977. 87. R Barrett, "Implementing the Rivest Shamir and Adleman Public Key Encryption Algorithm on a Standard Digital Signal Processor," Advances in Cryptology CRYPTO '86 Proceedings, Springer-Verlag, 1987, pp 311-323. 88. T.C. Bartee and D.l. Schneider, "Computation with Finite Fields," Information and Control, v. 6, n. 2, Jun 1963, pp. 79-98. 89. U. Baum and S. Blackburn, "Clock Controlled Pseudorandom Generators on Finite Groups," K.U Leuven Workshop on Cryptographic Algorithms, Springer-Verlag, 1995, to appear. 90. K.R. Bauer, T.A. Bersen, and R.J. Feiertag, "A Key Distribution Protocol Using Event Markers," ACM Transactions on Computer Systems, v. 1, n. 3, 1983, pp. 249-255. 91. F. Bauspiess and F. Damm, "Requirements for Cryptographic Hash Functions," Com- puters Security, v. l l, n. 5, Sep 1992, pp. 427 437. 92. D. Bayer, S. Haber, and W.S. Stornetta, "Improving the Efficiency and Reliability of Digital Time-Stamping, " Sequences '91: Methods in Communication, Security, and Computer Science, Springer-Verlag, 1992, pp. 329-334. 93. R. Bayer and J.K. Metzger, "On the Encipherment of Search Trees and Random Access Files," ACM Transactions on Data base Systems, v. l, n. 1, Mar 1976, pp. 37-52. 94. M. Beale and M.F. Monaghan, "Encrytion Using Random Boolean Functions," Cryp- tography and Coding, H.J. Beker and F.C. Piper, eds., Oxford: Clarendon Press, 1989, pp. 219-230. 95. P. Beauchemin and G. Brassard, "A Gener- alization of Hellman's Extension to Shannon's Approach to Cryptography," lournal of Cryptology, v. 1, n. 2, 1988, pp. 129-132. 96. R Beauchemin, G. Brassard, C. Crepeau, C. Goutier, and C. Pomerance, "The Generation of Random Numbers that are Probably Prime, " Journal of Cryptology, v. 1, n. 1, 1988, pp. 53-64. 97. D. Beaver, J. Feigenbaum, and V Shoup, "Fliding Instances in Zero-Knowledge Proofs, " Advances in Cryptology CR YPTO '90 Proceedings, Springer-Verlag, 1991, pp. 326- 338. 98. H. Beker, J. Friend, and P. Halliden, "Simplifying Key Management in Electronic Funds Transfcr Points of Sale Systems," Electronics Letters, v. 19, n. 12, Jun 1983, pp. 442 444. 99. H. Beker and F. Piper, Cipher Systems: The Protection of Communications, London: Northwood Books, 1982. 100. D.E. Bell and L.J. LaPadula, "Secure Computer Systems: Mathematical Foundations, " Report ESD-TR-73-275, MITRE Corp., 1973. 101. D.E. Bell and L.J. LaPadula, "Secure Computer Systems: A Mathematical Model," Report MTR-2547, MITRE Corp., 1973. 102. D.E. Bell and L.J. LaPadula, "Secure Computer Systems: A Refinement of the Mathematical Model," Report ESD-TR-73-278, MITRE Corp., 1974. 103. D.E. Bell and L.J. LaPadula. "Secure Com- puter Systems: Unified Exposition and Multics Interpretation," Report ESD-TR- 75-306, MITRE Corp., 1976. 104. M. Bellare and S. Goldwasser, "New Paradigms for Digital Signatures and Message Authentication Based on Non-interactive Zero Knowledge Proofs, " Advances in Cryptology CRYPTO '89 Proceedings, Springer-Verlag, 1990, pp. 194-211. 105. M. Bellare and S. Micali, "Non-interactive Oblivious Transfer and Applications, " Advances in Cryptology CRYPTO '89 Proceedings, Springer-Verlag, 1990, pp.547-557. 106. M. Bellare, S. Micali, and R. Ostrovsky, "Perfect Zero-Knowledge in Constant Rounds," Proceedings of the 22nd ACM Symposium on the Theory of Computing, 1990, pp. 482- 493. 107. S.M. Bellovin, "A Preliminary Technical Analysis of Clipper and Skipjack," unpublished manuscript, 20 Apr 1993. 108. S.M. Bellovin and M. Merritt, "Limitations of the Kerberos Protocol, " Winter 1991 USENIX Conference Proceedings, USENIX Association, 1991, pp. 253-267. 109. S.M. Bellovin and M. Merritt, "Encrypted Key Exchange: Password-Based Protocols Secure Against Dictionary Attacks," Proceedings of the 1992 IEEE Computer Society Conference on Research in Security and Privacy, 1992, pp. 72-84. 110. S.M. Bellovin and M. Merritt, "An Attack on the Interlock Protocol When Used for Authentication, " IEEE Transactions on Information Theory, v. 40, n. 1, Jan 1994, pp. 273-275. 111. S.M. Bellovin and M. Merritt, "Cryptographic Protocol for Secure Communications, " U.S. Patent #5,241,599, 31 Aug 93. 112. J. Ben-Aroya and E. Biham, "Differential Cryptanalysis of Lucifer, " Advances in Cryptology CRYPTO '93 Proceedings, Springer-Verlag, 1994, pp. 187-199. 113. J.C. Benaloh, "Cryptographic Capsules: A Disjunctive Primitive for Interactive Protocols," Advances in Cryptology CRYPTO '86 Proceedings, Springer-Verlag, 1987, 213-222. 114. J.C. Benaloh, "Secret Sharing Homorphisms: Keeping Shares of a Secret Secret, " Advances in Cryptology CRYPTO '86 Proceedings, Springer-Verlag, 1987. pp. 251-260. 115. J.C. Benaloh, "Verifiable Secret-Ballot Elections, " Ph.D. dissertation, Yale University, YALEU/DCS/TR-561, Dec 1987. 116. J.C. Benaloh and M. de Mare, "One-Way Accumulators: A Decentralized Alternative to Digital Signatures," Advances in Cryptology EUROCRYPT '93 Proceedings, Springer- Verlag, 1994, pp. 274 285. 117. J.C. Benaloh and D. Tuinstra, "Receipt Free Secret Ballot Elections," Proceedings of the 26th ACM Symposium on the Theory of Computing, 1994, pp. 544-553. 118. J.C. Benaloh and M. Yung, "Distributing the Power of a Government to Enhance the Privacy of Voters, " Proceedings of the 130. 5th ACM Symposium on the Principles in Distributed Computing, 1986, pp. 52-62. 119. A. Bender and G. Castagnoli, "On the Implementation of Elliptic Curve Cryptosystems, " Advances in Cryptology CRYPTO '89 Proceedings, Springer-Verlag, 1990, pp. 186-192. 120. S. Bengio, G. Brassard, Y.G. Desmedt, C. Goutier, and J.-J. Quisquater, "Secure Implementation of Identification Systems, " Journal of Cryptology, v. 4, n. 3, 1991, pp. 175-184. 121. C.H. Bennett, F. Bessette, G. Brassard, L. Salvail, and J. Smolin, "Experimental Quantum Cryptography, " Advances in Cryptology EUROCRYPT '90 Proceedings, Springer-Verlag, 1991, pp. 253-265. 122. C.H. Bennett, F. Bessette, G. Brassard, L. Salvail, and J. Smolin, "Experimental Quantum Cryptography, "Journal of Cryptology, v. 5, n. 1, 1992, pp. 3-28. 123. C.H. Bennett and G. Brassard, "Quantum Cryptography: Public Key Distribution and Coin Tossing, " Proceedings of the IEEE International Conference on Computers, Systems, and Signal Processing, Banjalore, India, Dec 1984, pp. 175-179. 124. C.H. Bennett and G. Brassard, "An Update on Quantum Cryptography," Advances in Cryptology: Proceedings of CRYPTO 84, Springer-Verlag, 1985, pp. 475-480. 125. C.H. Bennett and G. Brassard, "Quantum Public-Key Distribution System, " IBM Technical Disclosure Bulletin, v. 28, 1985, pp. 3153-3163. 126. C.H. Bennett and G. Brassard, "Quantum Public Key Distribution Reinvented, " S IGACT News, v. 18, n.4, 1987, pp. 51-53. 127. C.H. Bennett and G. Brassard, "The Dawn of a New Era for Quantum Cryptography: The Expenmental Prototype is Working!" SIGACT News, v. 20, n. 4, Fall 1989, pp. 78-82. 128. C.H. Bennett, G. Brassard, and S. Breidbart, Quantum Cryptography 11: How to Re-Use a One-Time Pad Safely Even if P=NP, unpublished manuscript, Nov 1982. 129. C.H. Bennett, G. Brassard, S. Breidbart, and S. Weisner, "Quantum Cryptography, or Unforgeable Subway Tokens," Advances in Cryptology: Proceedings of Crypto 82, Plenum Press, 1983, pp. 267-275. 130. C.H. Bennett, G. Brassard, C. Crepeau, and M.-H. Skubiszewska, "Practical Quantum Oblivious Transfer, " Advances in Cryptology CRYPTO '91 Proceedings, Springer-Verlag, 1992, pp. 351-366. 131. C.H. Bennett, G. Brassard, and A.K. Ekert, "Quantum Cryptography," Scientific American, v. 267, n.4, Oct 1992, pp. 50-57. 132. C.H. Bennett, G. Brassard, and N.D. Mermin, "Quantum Cryptography Without Bell's Theorem, " Physical Review Letters, v.68, n.5, 3 Feb 1992, pp. 557-559. 133. C.H. Bennett, G. Brassard, and J.-M. Robert, "How to Reduce Your Enemy's Information," Advances in Cryptology CRYPTO '85 Proceedings, Springer-Verlag, 1986, pp. 468-476. 134. C.H. Bennett, G. Brassard, and J.-M. Robert, "Privacy Amplification by Public Discussion," SIAM Journal on Computing, v. 17, n.2, Apr 1988, pp. 210-229. 135. J. Bennett, "Analysis of the Encryption Algorithm Used in WordPerfect Word Processing Program," Cryptologia, v. l l, n. 4, Oct 1987, pp. 206-210. 136. M. Ben-Or, S. Goldwasscr, and A. Wigderson, "Completeness Theorems for Non- Cryptographic Fault-Tolerant Distributed Computation, " Proceedings of the 20th ACM Symposium on the Theory of Computing, 1988, pp. 1-10. 137. M. Ben-Or, O. Goldreich, S. Goldwasser, J. Hastad, J. Kilian, S. Micali, and R Rogaway, "Everything Provable is Provable in Zero-Knowledge," Advances in Cryptology CRYPTO '88 Proceedings, Springer-Verlag, 1990, pp. 37-56. 138. M. Ben-Or, O. Goldreich, S. Micali, and R.L. Rivest, "A Fair Protocol for Signing Contracts," IEEE Transactions on Information Theory, v. 36, n. 1, Jan 1990, pp. 40 46. 139. H.A. Bergen and W.J. Caelli, "File Security in WordPerfect 5.0," Cryptologia, v. 15, n. 1, Jan 1991, pp. 57-66. 140. E.R. Berlekamp, Algebraic Coding Theory, Aegean Park Press, 1984. 141. S. Berkovits, "How to Broadcast a Secret," Advances i n Cryptology EUROCRYPT '91 Proceedings, Springer-Verlag, 1991, pp. 535-541. 142. S. Berkovits, J. Kowalchuk, and B. Schanning, "Implementing Public-Key Scheme, " IEEE Communications Magazine, v. 17, n. 3, May 1979, pp. 2-3. 143. D.J. Bernstein, Bernstein vs. U.S. Depart- ment of State et al., Civil Action No. C95- 0582-MHP, United States District Court for the Northern District of California, 21 Feb 1995. 144. T. Berson, "Differential Cryptanalysis Mod 232 with Applications to MD5, " Advances in Cryptology EUROCRYPT '92 Proceedings, 1992, pp. 71-80. 145. T. Beth, Verfahren der schnellen Fourier-Transformation, Teubner, Stuttgart, 1984. (In German.) 146. T. Beth, "Efficient Zero-Knowledge Identification Scheme for Smart Cards," Advances in Cryptology EUROCRYPT '88 Proceedings, Springer-Verlag, 1988, pp. 77-84. 147. T. Beth, B.M. Cook, and D. Gollmann, "Architectures for Exponentiation in GF|2n|," Advances in Cryptology CRYPTO '86 Proceedings, Springer-Verlag, 1987, pp. 302-310. 148. T. Beth and Y. Desmedt, "Identification Tokens or: Solving the Chess Grandmastcr Problem," Advances in Cryptology CRYPTO '90 Proceedings, Springer-Verlag, 1991, pp. 169-176. 149. T. Beth and C. Ding, "On Almost Nonlinear Permutations, " Advances in Cryptology EUROCRYPT '93 Proceedings, Springer-Verlag, 1994, pp. 65-76. 150. T. Beth, M. Frisch, and G.J. Simmons, eds., Lecture Notes in Computer Science 578; Public Key Cryptography: State of the Art and Future Directions, Springer-Verlag, 1992. 151. T. Beth and F.C. Piper, "The Stop-and-Go Generator," Advances in Cryptology: Procedings of EUROCRYPT 84, Springer-Verlag, 1984, pp. 88-92. |