Cryptography is hard.

What it says on the tin.

Tricky.

What it says on the tin.

Like how Google does it for mere mortals.

How Google does it.

Here's the one-minute introduction: "Imagine that it's fifteen years from now. Somebody announces that he's built a large quantum computer. RSA is dead. DSA is dead. Elliptic curves, hyperelliptic curves, class groups, whatever, dead, dead, dead. So users are going to run around screaming and say 'Oh my God, what do we do?' Well, we still have secret-key cryptography, and we still have some public-key systems. There's hash trees. There's NTRU. There's McEliece. There's multivariate-quadratic systems. But we need more experience with these. We need algorithms. We need paddings, like OAEP. We need protocols. We need software, working software for these systems. We need speedups. We need to know what kind of key sizes to use. So come to PQCrypto and figure these things out before somebody builds a quantum computer."

Cryptography is hard. Let's go phreaking!

Via James, this is lots and lots of reading for later.

whirlpool.py - pure Python implementation of the Whirlpool algorithm.

The paper on Skein was pretty readable. Either that or I know more about cryptography than I thought I did. I love that Skein performs insanely fast on 64 bit processors, acceptably fast on 32 bit processors and runs at all on 8-bit AVR chips.

Nice to see this see the light of day. i remember reading (or watching) about this several months back.

Covers what not to do and why.

How strong do you need to go?

A pretty impressive use of FPGA.

This is the answer to a problem that I've been grasping with on my qrbg erlang project.

Secure timestamping. neat idea.

Wow, that's a lot of hashes.

I used a previous version to break in to a box at work with a forgotten password.

Prime crime.

Clean and simple.

A well written piece on hashing.

Pure python crypto

Javascript crypto, baby!