Sunday, August 15, 2010

Short cryptography lecture from Scott Aaronson

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.

image

3 comments:

士文婷文婷松 said...

教育的目的,不在應該思考什麼,而是教吾人怎樣思考......................................................................

Anonymous said...

缺少智慧,就是缺少一切..................................................

Jhon mac said...

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