{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

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

77 385 c coveyou and rd macpherson fourier analysis of

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: Among Disclosure Problems,” Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, 1986, pp. 168–173. 246. G. Brassard, C. Crépeau, and J.–M. Robert, “All–or–Nothing Disclosure of Secrets,” Advances in Cryptology—CRYPTO ’86 Proceedings, Springer–Verlag, 1987, pp. 234–238. 247. G. Brassard, C. Crépeau, and M. Yung, “Everything in NP Can Be Argued in Perfect Zero–Knowledge in a Bounded Number of Rounds,” Proceedings on the 16th International Colloquium on Automata, Languages, and Programming, Springer–Verlag, 1989, pp. 123–136. 248. R.P. Brent, “An Improved Monte–Carlo Factorization Algorithm,” BIT, v. 20, n. 2, 1980, pp. 176–184. 249. R.P. Brent, “On the Periods of Generalized Fibonacci Recurrences, Mathematics of Computation, v. 63, n. 207, Jul 1994, pp. 389–401. 250. R.P. Brent, “Parallel Algorithms for Integer Factorization,” Research Report CMA–R49–89, Computer Science Laboratory, The Australian National University, Oct 1989. 251. D.M. Bressoud, Factorization and Primality Testing, Springer–Verlag, 1989. 252. E.F. Brickell, “A Fast Modular Multiplication Algorithm with Applications to Two Key Cryptography,” Advances in Cryptology: Proceedings of Crypto 82, Plenum Press, 1982, pp. 51–60. 253. E.F. Brickell, “Are Most Low Density Polynomial Knapsacks Solvable in Polynomial Time?” Proceedings of the 14th Southeastern Conference on Combinatorics, Graph Theory, and Computing, 1983. 254. E.F. Brickell, “Solving Low Density Knapsacks,” Advances in Cryptology: Proceedings of Crypto 83, Plenum Press, 1984, pp. 25–37. 255. E.F. Brickell, “Breaking Iterated Knapsacks,” Advances in Cryptology: Proceedings of Crypto 84, Springer–Verlag, 1985, pp. 342–358. 256. E.F. Brickell, “Cryptanalysis of the Uagisawa Public Key Cryptosystem,” Abstracts of Papers, EUROCRYPT ’86, 20–22 May 1986. 257. E.F. Brickell, “The Cryptanalysis of Knapsack Cryptosystems,” Applications of Discrete Math...
View Full Document

{[ snackBarMessage ]}