Archive for the 'academia' Category
.flickr-photo { border: solid 2px #000000; }
.flickr-yourcomment { }
.flickr-frame { text-align: left; padding: 3px; }
.flickr-caption { font-size: 0.8em; margin-top: 0px; }
RSA student group photo, originally uploaded by Rich Moffitt.
Well, this photo is of a bunch of post-grad geeks with graduate certificates in Information Security Technology. BU put on a nice graduation ceremony […]
Nice RFC - defining a “null” encryption algorithm
0 Comments Published by webmaster May 17th, 2007 in technology, academia.This RFC defines a NULL encryption algorithm for use in the IPsec ESP protocol. Since there’s not a lot of math involved, the writers got a little creative:
http://www.faqs.org/rfcs/rfc2410.html
The NULL encryption algorithm combines many of the best features of both block and stream ciphers, while still not requiring the transmission of an IV or analogous […]
A patent on TiVO encryption — using zero knowledge proofs?
0 Comments Published by webmaster May 14th, 2007 in technology, linux, academia.I was reading this post on Slashdot about TiVO’s recently filed patent application on a “password you can’t hack“. I was just thinking… isn’t this basically a zero knowledge proof?
“Eventually, systems were devised that require the host to prove that it knows the password without actually revealing the password, thus allowing the host to […]
The easiest explanation of Pollard’s p-1 method I’ve seen yet
0 Comments Published by webmaster October 16th, 2006 in technology, academia.Thank goodness for the Internet… we covered this topic in cryptography class (and it was explained quite well), but this web page seems to spell it out equally well in plain English:
This method is based on FermatĀ“s little theorem. It is well known that for any prime number you choose, p, and any […]