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

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.
Tags: brute force, cost, Crypto, GnuPG, green food, Jason Rogers, keys, keysigning party, Moore's Law, pgp, University of Waterloo
Posted in PGP/GPG | 1 Comment »
Posted by Bob Jonkman on 9th October 2013
The months of October and November are shaping up to have some great lectures and presentations on cryptography, security and privacy.

Keysigning materials
Yesterday started off with an informal keysigning at the KWLUG meeting. The presentation was on the Scratch programming environment, nothing to do with GnuPG/PGP or cryptography. But a few of us exchanged little slips of paper with our key fingerprints, verified that the name with the fingerprint matched the person we knew, signed the keys, and so improved our standing in the Web of Trust. I hope that this becomes a regular part of all KWLUG meetings. The more people that participate, the more confident we can be about the validity of keys we may not have verified ourselves.
Today I attended the first UofW CSClub lecture on Security and Privacy by Sarah Harvey. If you’ve been following the news about the Snowden revelations you’ll know why security and privacy is important. The room was full of computer science, math and cryptography students, so the discussions were deep and technical.
Sarah Harvey shows a slide of Edward Snowden
There was a vacancy in the November KWLUG meeting so I asked Sarah if she would repeat her lecture. Let’s see what the KWLUG bosses have to say…
There are more CSClub lectures scheduled, check the schedule on the CSClub site.

KWCrypto logo, the M-209 cipher machine
I’ve volunteered to do a presentation on Encrypting E-mail with GnuPG, Thunderbird and Enigmail, followed by a formal keysigning. I’m developing the presentation notes and keysigning procedure on the KWCrypto Interest Group Wiki that was set up after the Kwartzlab keysigning party last year. Please join me on the Wiki and the mailing list — I’d appreciate the help.
–Bob.
Tags: computer science, Computer Science Club, Crypto, cryptography, CSClub, Enigmail, GNU Privacy Guard, GnuPG, keysigning, Kitchener, KWCrypto, KWLUG, Linux, mailing list, math, pgp, Pretty Good Privacy, privacy, Sarah Harvey, security, Thunderbird, University of Waterloo, Waterloo, wiki
Posted in PGP/GPG, privacy, security | Comments Off on Cryptography and Security Events in Kitchener-Waterloo
Posted by Bob Jonkman on 19th March 2013
Alan Marshall, known online as the
Elmira Advocate, recently
blogged about the lack of data transparency:
What I do know is this. Environmental data is not shared with the public. What I do know about Waterloo’s water scares me but perhaps not as much as what I don’t know.
The Region of Waterloo is gradually making its collected data available to the public in Open Data sets. This means that citizens can use and re-use the data for mapping, tracking trends, and correlating it with other data sources. The data is licensed specifically to encourage its re-use, not restrict it.
The Region of Waterloo data sets are available at http://www.regionofwaterloo.ca/en/regionalGovernment/OpenDataHome.asp
There is a citizens’ group called OpenDataWR that encourages governments to make their collected data available in standardized, re-usable formats. They meet occasionally to work on new applications utilizing Open Data resources.
OpenDataWR recently held a hackathon, where groups of people worked on new projects that makes uses of Open Data. It was mostly computer programmers at the hackathon, but we need advocates like Alan with deep knowledge of the data, science, and the meaning of the data so that the programmers can write better applications. We also need publicists to make the existence of Open Data more widely known, as well as the applications that make use of it. We need lobbyists to advocate for more Open Data from governments, and from commercial organizations such as Conestoga Rovers. For instance, the University of Waterloo has an Open Data project as well.
As far as I know, Woolwich Township doesn’t have an Open Data project, or even a policy about making its data available in open formats. For example, even something so fundamental as the Woolwich Council meeting calendar is not made available in a standard calendar format, so you can’t easily add Council meetings to your own iPad or Outlook calendar.
It would be nice to have an Open Data advocacy group in Woolwich Township. There’s certainly enough data, just no good way to get at it.
Call to arms!
If anyone is interested in setting up an Open Data Woolwich Township citizens’ group to encourage and guide the Township into opening its data, please leave a comment below or contact me at bjonkman@sobac.com.
–Bob.
Tags: advocacy, Alan Marshall, application, calendar, citizens group, Conestoga Rovers, correlate, council meeting, data, data set, Elmira Advocate, format, government, hackathon, lobbyist, mapping, Open Data, Open Data Woolwich Township, OpenDataWR, programmer, project, publicist, Region of Waterloo, standards, tracking, transparency, trends, University of Waterloo
Posted in FLOSS, Open Data | 1 Comment »