CHENCHUAES
Computation, Quantum Theory, and You Scott Aaronson, UC Berkeley Qualifying Exam May 13, 2002.
Quantum Lower Bound for the Collision Problem Scott Aaronson 1/10/2002 quant-ph/0111102 I was born at the Big Bang. Cool! We have the same birthday.
The Future (and Past) of Quantum Lower Bounds by Polynomials Scott Aaronson UC Berkeley.
Applications of SAT Solvers to Cryptanalysis of Hash Functions Ilya Mironov Lintao Zhang Microsoft Research Silicon Valley Campus.
Copyright © 2002 Nominum, Inc.1 Information Document 17-E ITU-T Study Group 2 May 2002 QUESTION:Q.1/2 SOURCE:TSB TITLE:INTRODUCTION TO SECURE DNS (by Jim.
Cryptography and Message Authentication NS3
Securing Low-cost RFID Systems: an Unconditionally Secure ...
Plan9 from Bell Labs meets TinyCore Linux
Uncloaking IP Addresses on IRC
How to Use Cryptography Properly: The Common Mistakes People Make When Using Cryptographic Functions
Crypto basics
