Cryptography Reference
In-Depth Information
191. Talbot, J., & Wells, D. (2006). Complexity and cryptography: An introduction. Cambridge:
Cambridge University Press.
192. Tao, T., Croot III, E. & Helfgott, H. (2011). Deterministic methods to find primes.
Mathematics of Computation. Retrieved from http://www.ams.org/journals/mcom/0000-
000-00/S0025-5718-2011-02542-1/S0025-5718-2011-02542-1.pdf
193. Vaudenay,
S.
(2006).
A
classical
introduction
to
cryptography:
Applications
for
communications security. New York: Springer.
194. Wagstaff, S. S. Jr. (2003). Cryptanalysis of number theoretic ciphers. Boca Raton: Chapman
& Hall/CRC.
195. Wang, X., Yin, Y. L., & Yu, H. (2005). Finding collisions in the full SHA-1. In Advances in
Cryptology, CRYPTO 2005, Lecture Notes in Computer Science (Vol. 3621, pp. 17-36).
Springer.
196. Wang, X., & Yu, H. (2005). How to break MD5 and other hash functions. In Advances in
Cryptology, Proceedings of EUROCRYPT 2005, Lecture Notes in Computer Science (Vol.
3494, pp. 19-35). Heidelberg: Springer.
197. Washington, L. C. (2008). Elliptic curves: Number theory and cryptography (2nd ed.). Boca
Raton: Chapman& Hall/CRC.
198. de Weger, B. (2002). Cryptanalysis of RSA with small prime difference. Applicable Algebra
in Engineering, Communication and Computing,13, 17-28.
199. Wright, E. V., Gadsby. Retrieved from http://www.holybooks.com/wp-content/uploads/
Gadsby-by-Ernest-Vincent-Wright.pdf
200. Wu, H., The misuse of RC4 in Microsoft Word and Excel. Retrieved from http://eprint.
iacr.org/2005/007
201. Yan, S. Y. (2008). Cryptanalytic attacks on RSA. New York: Springer.
202. Yan, S. Y. (2009). Primality testing and integer factorization in public-key cryptography
(2nd ed.). New York: Springer.
203. Yao, A. C. (1982). Theory and applications of trapdoor functions. In Proceedings 23rd
IEEE Symposium on Foundations of Computer Science (pp. 80-91).
Search WWH ::




Custom Search