This Blog Is Not For Reading

A blog, just like any blog, only more so

  • Subscribe

  • Categories

  • RSS Bob Jonkman’s Microblog

    • Delete 27 August 2023
      Bob Jonkman deleted notice {{tag:gs.jonkman.ca,2023-08-27:noticeId=1114720:objectType=note}}.
    • New note by bobjonkman 3 August 2023
      From a few years ago... All gone now, and I promised $SPOUSE it would never come back. https://gs.jonkman.ca/attachment/221480
    • Favorite 3 August 2023
      bobjonkman favorited something by clacke: I tried for over four decades to grow an impressive personality, but it was a lot of effort and not much payoff, so now I'm just trying to grow an impressive beard instead.
    • bobjonkman repeated a notice by clacke 3 August 2023
      RT @clacke I tried for over four decades to grow an impressive personality, but it was a lot of effort and not much payoff, so now I'm just trying to grow an impressive beard instead.
    • bobjonkman repeated a notice by clacke 27 July 2023
      RT @clacke did you watch Oppenheimer, the film about the moral implications of the things we create, starring an actor who also played a Gotham City psychiatrist who went insaneordid you watch Barbie, the film about the moral implications of the things we create, starring an actress who also played a Gotham City psychiatrist who […]
    • Favorite 27 July 2023
      bobjonkman favorited something by clacke: did you watch Oppenheimer, the film about the moral implications of the things we create, starring an actor who also played a Gotham City psychiatrist who went insaneordid you watch Barbie, the film about the moral implications of the things we create, starring an actress who also played a Gotham […]
    • New comment by bobjonkman 29 June 2023
      @steve Wait, you or Dr. Cooley are at Perimeter? Giving any public lectures? If so, I'll hop on my bike to attend! @Perimeter
    • bobjonkman repeated a notice by steve 29 June 2023
      RT @steve From jodi on Mastodon: I’m looking forward to meeting students at TRISEP 2023 being held @Perimeter!
    • New note by bobjonkman 8 June 2023
      Several other authors of software that accesses the Twitter API have come to that conclusion as well. When #Twidere, my phone app to access Twitter stopped accessing Twitter back in January I pretty much abandoned Twitter. I still check Twitter with its WebUI, less than once a week, but I no longer post or engage […]
    • Favorite 8 June 2023
      bobjonkman favorited something by steve: I finally had a chance to figure out why my social bridging software was no longer able to talk to Twitter. Indeed, it's because under Twitter's new leadership, python-twitter has been deemed as violating something in their terms of service. It says I can submit a ticket, but they make […]

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 PGP/GPG | 1 Comment »

 
Better Tag Cloud