{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

applied cryptography - protocols, algorithms, and source code in c

167 e biham and a shamir differential cryptanalysis

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Certain Parts Are as Hard as the Whole,” Proceedings of the 25th IEEE Symposium on the Foundations of Computer Science, 1984, pp. 449–457. 36. W. Alexi, B.–Z. Chor, O. Goldreich, and C.P. Schnorr, “RSA and Rabin Functions: Certain Parts are as Hard as the Whole,” SIAM Journal on Computing, v. 17, n. 2, Apr 1988, pp. 194–209. 37. Ameritech Mobile Communications et al., “Cellular Digital Packet Data System Specifications: 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–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,” 1st 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 Generators,” K.U. Leuven 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,” Advan...
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online