Theory and Practice of Cryptography

Google Tech Talks


Topics include: Introduction to Modern Cryptography, Using Cryptography in Practice and at Google, Proofs of Security and Security Definitions and A Special Topic in Cryptography

This talk is one in a series hosted by Google University: Wednesdays, 11/28/07 - 12/19/07 from 1-2pm

Speaker: Steve Weis
Steve Weis received his PhD from the Cryptography and Information Security group at MIT, where he was advised by Ron Rivest. He is a member of Google's Applied Security (AppSec) team and is the technical lead for Google's internal cryptographic library, KeyMaster.

• Category

  People & Blogs

[mklvebu]

is that guy a hologram?

[youko11]

Very interesting. ;]

[Liz McLean Knight]

That girl's cache-flush trick was clever.

[assadd1]

The predominant form of education system in the U.S. does not reward kids following their natural talents. The reason is that talents are considered "extra-curricular." Strict and rigid curricular legislation is at fault.

[alexwhb122]

what is H Max?

[shillbert]

I suppose it's easy to implement in COBOL.

[b1naryd1g1t5]

3DES is still secure (it has an effective key length of 112 bits, which cannot be brute forced). The problem is it's slow -- much slower than any of the NIST finalists.

[NerdInHisShoe]

you're referring to password hashing, where the security has nothing to do with collision resistance of the hash function. He can do the same thing with SHA512, for example.

[YouDoober]

Either way, its not secure and hasn't been for a while. There was some news about it recently... some guy was using Amazon EC2, he cracked liked 14 hashes in under an hour.

[NerdInHisShoe]

No they didn't. They found a collision in SHA-0.

[YouDoober]

In February 2005, a group at Shandong University in China found collisions in the full version of SHA-1.