- From: <dee3@us.ibm.com>
- Date: Thu, 14 Oct 1999 21:41:54 -0400
- To: w3c-ietf-xmldsig@w3.org
G. Algorithm Granularity
1. Suites as one algorithm
i.e., compound Algorithm names, like RSA-SHA1, can occur
2. Orthogonal specification
i.e., simple Algorithm names but Algorithms occur as
Parameters to other Algorithms
NOTE: As long as we permit user defined algorithms, there is no
way to stop someone from using G.1 and as long as we allow
parameters, there is not way to stop someone from using G.2
although you can make G.2 a bit less convenient, depending on
your parameter syntax. So the question is really just for the
algorithms we specify in the WG documents.
There are arguments on both sides. This is a religious issue.
I have my own opinions but we will go with the WG consensus.
Donald E. Eastlake, 3rd
17 Skyline Drive, Hawthorne, NY 10532 USA
dee3@us.ibm.com tel: 1-914-784-7913, fax: 1-914-784-3833
home: 65 Shindegan Hill Road, RR#1, Carmel, NY 10512 USA
dee3@torque.pothole.com tel: 1-914-276-2668
Received on Thursday, 14 October 1999 22:25:52 UTC