Elliptic Curve Cryptography
[Originally posted September 16, 2005]
Elliptic Curve Cryptography. So I’m still writing the glossary to my term paper, but I just had to put this up. ECC is making my head spin, since I haven’t done math in awhile. But I ran across this really cool song created by Eric Hughes about the strength of encryption. It is sung to the tune of Supercalifragilisticexpialidocious. All the more power to you if you understand what they’re talking about. Took me awhile….
Superpolynomial subexponential runtimes.
Even though in practice it would take you several lifetimes,
If you ran it long enough you’d always find those two primes.
Superpolynomial subexponential runtimes.
E to the root-log root-log-log [4X]
When I was but a naive lad first coding two’s and three’s
I thought the only “orders of” were trivialities.
But when I saw this function something opened up to me
The elegance of computational complexity.
[Chorus]
I was at a meeting when up came a man in black
Who told me that his agency had mounted an attack.
Convinciinng him was fruitless that his budget would collapse
All I know his trumpeter will soon be playing Taps.
[Chorus]
In virtual environments has grown up a debate
Of whether strong cryptography can overthrow the state.
But several such technologies including public key
Shall herald in the coming age of crypto-anarchy.
Yeah I’m a geek