At 11:49 AM 6/2/98 +0100, Adam Back wrote:
There is a conflict no matter what: the minimal subset of common
algorithms is the empty set. What you do to fix this is either as you
suggest if the implementation's architecture allows send separate
messages to resolve the problem; or failing that perhaps minimise the
damage by finding the subset which results in unreadable messages to
the minimum number of recipients.
And that's precisely what we've done. For OpenPGP, the there's a solution
-- 3DES. For 2.x compatibilty, the real solution is to generate separate
messages. If you can't, then there's a problem, and the implementation can
cope.
I can't see how this will help: you are either going to render the
message unreadable to the 2.x user, or to the minimal OpenPGP user.
Take your pick. Unless you like 2) above.
Exactly. We're in violent agreement.
Jon
-----
Jon Callas jon(_at_)pgp(_dot_)com
CTO, Total Network Security 3965 Freedom Circle
Network Associates, Inc. Santa Clara, CA 95054
(408) 346-5860
Fingerprints: D1EC 3C51 FCB1 67F8 4345 4A04 7DF9 C2E6 F129 27A9 (DSS)
665B 797F 37D1 C240 53AC 6D87 3A60 4628 (RSA)