The Crypto Gardening Guide and Planting Tips
ncostigan writes "Peter Gutmann of cryptlib fame has written a very readable paper on real-world constraints for cryptographers, and points out problems that their designs will run into when attempts are made
to deploy them. Also included is a motivational list of extremely uncool problems that implementors have been building ad-hoc solutions for since no
formal ones exist."
Well - actually, I only laughed - over this passage
(Note: If you're in the media or telecoms industry this becomes "Get there
first with something patented, proprietary, and broken, then send lawyers
after anyone who points out problems", but this is a special case).
Heh! What a wag!
A little planning goes a long way...
If you're reading about crypto, and you have not heard of Peter Gutmann, then you are either just *starting* to read about crypto, or you have missed out some of the most important *practical* parts of your reading!
Check also the X509 Style Guide. Outstanding and insightful. Trust no one claiming to know about PKI unless they have read and understood this :-)
The problem I face every day has bugger all to do with the vague under the hood stuff that I see everyday about the inside or crypto engines but the problem of getting my clients to understand that the extra clicks when they send an email, the remebering a pass phrase, and the extra clicks to read incoming email is not only advisable but absolutly necessary. everyday I see lawyers send priviliged material over the internet and getting them to see both that it is going on a electronic post card and there is a solution is a task that has proved beyond me.
Suggestions from the floor?
the article says:
Crypto designs are often described as mathematical abstractions that, while easy to work with mathematically, require a significant amount of work to translate into an actual implementation.
i'm surprised by this, why can't the crypto whizzes put together a few lines of math.h and networking code to be a proof of concept? crypto is very much an applied field, so the theorists should include example source in their papers.
Message Authentication Code
Hashed Message Authentication Code
Pseudo Random Function
Initialization Vector
Hey! Aren't you Peter G., that famous cryptlib guy???
uh...no, sorry, you have me mixed up with some other cryto guy. My name is, uh, Chuck...Chuck Laylow. I don't know squat about anything dealing with secrets, really...now, please go away before someone sees you talking to me, and don't tell anyone you talked to me...ever...thanks.
bruce schneier: secrets and lies - digital security in a networked world
0 47 1253111/qid=1044455851/sr=8-2/ref=sr_8_2/102-63475 44-3715317?v=glance&s=books&n=507846)
(http://www.amazon.com/exec/obidos/tg/detail/-/
excellent book on crypto and security basics. also contains basic concepts of avoiding general security issues.
nico
We are all individualists!
5 -- At least your mom will think you're 1337
4 -- You need a BFS (Big Fucking pgp Sig) for all those blogs you waste your time on
3 -- To avoid letting the FBI know that Dear Matt, I you thought the last comp sci lab was hard and will probably just wait until Punjab Moltisontorilho hands his in and then we can steal his answers From Peter
2 -- Its geek factor will offset the fact that you still run Windows 95
... and the number 1 reason to use cryptography
1 -- Get that "terrorist feel" without all the violence
Copyright Eric Krout, Editor of *nix.org
Reply or e-mail; don't vaguely moderate. Ex-O'Reilly/MIT employee, now a full-time Google employee.
Damn ... I read the title and I thought "Whoa, someone has come up with a way to hide secret messages in their garden."
Kinda like steganography, but with flowers.
Now *that* would be news for nerds.
Tuus crepidae innexilis sunt.
>But I wonder if some of those suggestions decrease the strength of encryption?
:P
Most modern cryptography is based on a variety of problems which are believed -- NOT known -- to be hard in certain contexts. Factoring, RSA, CDH, DDH, bilinear maps over CDH/DDH gap groups, braid factoring, CVP, etc. There are people who believe that factoring (and thus RSA) may be poly-time solvable, and thus cryptosystems based on it may be insecure. Cryptosystems based on different hard problems are important for that reason. It's a hedge bet.
There are also interesting things which come "for free" with certain types of hard problems, which may be very expensive to add on to more common cryptosystems. These properties, for example committment, are used in protocols like Deniable Ring Authentication. This sort of thing follows your suggestion of "a variety of rules", but it's really not possible to list every single cryptosystem in existance and how well it fits in. The authors simply say "(E,D) is a cryptosystem with the following properties", and leave anyone who wants to use it to find the best such cryptosystem, as it may change over time. (They usually do provide a trivial example or a reference, though)
Of course, if one-way functions don't exist, we'll all be back to information-theoretically secure stuff, and some of these problems will go away
Lea