This Blog Is Not For Reading

A blog, just like any blog, only more so

  • Subscribe

  • Categories

  • RSS Bob Jonkman’s Microblog

    • New note by bobjonkman 8 November 2019
      Elois and Morlocks, from another work of fiction co-opted into a user manual for the 1%
    • Favorite 8 November 2019
      bobjonkman favorited something by inkslinger: The fan theory that the Jetsons and the Flintstones are actually contemporaneous to one another -- the Jetsons' sky cities being the land of the wealthy (or formerly wealthy, perhaps, since capitalist wage relations still exist, even in a world with literal robot servants) and the Flintstones being the descendants […]
    • bobjonkman repeated a notice by inkslinger 8 November 2019
      RT @inkslinger The fan theory that the Jetsons and the Flintstones are actually contemporaneous to one another -- the Jetsons' sky cities being the land of the wealthy (or formerly wealthy, perhaps, since capitalist wage relations still exist, even in a world with literal robot servants) and the Flintstones being the descendants of the poor […]
    • Favorite 1 November 2019
      bobjonkman favorited something by ericxdu23: Hi. I'm still here.
    • Favorite 1 November 2019
      bobjonkman favorited something by hubert: ♲ @cryptpad@social.weho.st: Exactly 5 years ago at 16:42, was the first CryptPad commit by @cjdelisle, the start of a very ambitious project to restore privacy in collaboration tools. We believed in it 5 years ago and we thank the 200 supporters and 10000 weekly users from 150 countries that have […]
    • New note by bobjonkman 24 October 2019
      Best thread in a long time! nEVILle Park's ( @nev ) #Arachtober: https://social.coop/@nev/102887815460533048
    • Favorite 24 October 2019
      bobjonkman favorited something by phooky: Borough Pluralization Chart:ManhattaBrooklynsBronxiiQuinoaStatins Island
    • Favorite 20 October 2019
      bobjonkman favorited something by banjofox: Middle Earth actually had a second set of well-known rings. Although not as powerful at the main set, these were certainly nothing to shake a finger at. Silver in color, they, like their gold counterparts were usable by anyone. Their only real power was the ability to provide near instant […]
    • Favorite 14 October 2019
      bobjonkman favorited something by thj: Cool teardown video from Applied Science that reveals how analog era snapshot cameras printed the date on the film negative:https://www.youtube.com/watch?v=ezME4_xMMnkWith the segmented digits, you'd think it's a tiny fluorescent display, but it's actually more interesting that that.
    • New note by bobjonkman 6 October 2019
      And now I've discovered your website, and I'll be rabbitholing for the rest of the afternoon... @mattskala

Archive for March, 2014

The cost of long GnuPG/PGP keys

Posted by Bob Jonkman on 25th March 2014

Never Eat That Green Food At The Back Of The Fridge

Never Trust Anyone Over Thirty

and

Never Sign A GnuPG/PGP Key That’s Older Than You Are

Face peeking into fridge

Looking for green food at the back of the fridge

OK, only one of those is true, and it’s not the last one. At the University of Waterloo Keysigning Party last fall, some of the people signing my key were younger than the key they were signing!

At the keysigning I was having a discussion with someone about key lengths. In particular, choosing 4096 bits instead of 2048. I was reading that GnuPG has a limit of 4096 bits, but that 4096 should be enough for all time to come.

I’ve read online that GnuPG does actually support larger key sizes but that there is a const in the source code limiting it to 4096. The reasons for doing so are supposedly speed, 4096 would be very slow to generate and use, and comparability with other implementations that may not support larger keys. Personally I think it’s an inevitability that this will be increased in time but we’re not there yet.

In 1996 when I started with PGP a 1024 bit key was considered adequate, by 1999 a 2048 bit key was still considered large.

Consider Moore’s Law: every 18 months computing capacity doubles and costs halve. I’m not sure if that means that over 18 months x flops increases to 2x flops at the same price, or that in 18 months the cost of x flops is half of today’s cost, or if it means that in 18 months the cost of 2x flops will be half the cost of x flops today. If the latter, then today’s x flops/$ is x/4 flops/$ in 18 months. That factor of four is an increase of two bits every 18 months, or four bits every 3 years.

So, the cost in 1996 to brute-force crack a 1024 bit key is the same as the cost in 1999 to crack a 1028 bit key. And in 2014, 18 years later, it’s the same cost as cracking a 1048 bit key (an additional 24 bits).

An increase in key size from 1024 bits to 2048 bits buys an additional 768 years of Moore’s Law. And going from 2048 bits to 4096 bits buys an additional 1536 years of Moore’s Law.

Is Moore’s Law overestimating the cost of cracking keys? Are there fundamental advances in math that have dropped the cost of cracking 1024 bit keys to near-zero? What’s the economic justification for crippling keysizes in GnuPG, anyway?

–Bob, who is not trolling but really wants to know.

Day 57 / 365 – refrigerator by Jason Rogers is used under a CC BYCC BY license.

This post is based on a message to the KWCrypto Mailing List.

Tags: , , , , , , , , ,
Posted in Crypto, PGP/GPG | 1 Comment »

 
Better Tag Cloud