Here is a short cryptography lecture from Scott Aaronson, delivered as part of his Quantum Computing Since Democritus course given at the University of Waterloo, Fall 2006. The lecture gives a short text-based overview of crypto from mainly a complexity point of view, and discusses some of the implications of the “P = NP?” question for crypto.
Sunday, August 15, 2010
Subscribe to:
Post Comments (Atom)
Posts
2 comments:
Thanks for sharing this great article.Great information thanks a lot for the detailed article.That is very interesting I love reading and I am always searching for informative information like this.
aaronson
Great Article
IEEE Projects on Information Security
Project Centers in Chennai
JavaScript Training in Chennai
JavaScript Training in Chennai
Post a Comment