RE: Poll: RSA structure

Don/Joseph:

For the record, we (Brian and I) vote for #2.

--Barb

-----Original Message-----
From: Donald E. Eastlake 3rd [mailto:dee3@torque.pothole.com]
Sent: Monday, September 11, 2000 5:03 AM
To: Joseph M. Reagle Jr.
Cc: IETF/W3C XML-DSig WG
Subject: Re: Poll: RSA structure 



The discussion on the teleconference indicated that those on the call
were somewhat more inclined to B64 (C(P(ASN1(OID, D(data))))) except
that you then had the digest algorithm specified both inside the RSA
encipherment and in the algorithm name outside leading to additional
complexities and error cases.  So I think the consensus is for 2 which
I also favor given the current structure.

Donald

From:  "Joseph M. Reagle Jr." <reagle@w3.org>
Resent-Date:  Thu, 7 Sep 2000 16:44:04 -0400 (EDT)
Resent-Message-Id:  <200009072044.QAA08140@www19.w3.org>
Message-Id:  <4.3.2.7.2.20000907163806.00ba7170@rpcp.mit.edu>
Date:  Thu, 07 Sep 2000 16:43:48 -0400
To:  "IETF/W3C XML-DSig WG" <w3c-ietf-xmldsig@w3.org>

>http://www.w3.org/Signature/Minutes/000907-tele.html
>>* ACTION: Reagle, email poll of which option people want.
>>* ACTION: Reagle, get Brian/Barb to tweak text once resolved..
>
>Based on the summary of options provided by Merlin [1] it is presently
clear 
>that 2 OR 4 (everyone seems to agree supporting both is not good) are
the 
>preferred methods. My present tally is as follows:
>
>2) B64 (C(P(ASN1(D(data))))) (PKCS#1 wrapped digest)
>a. Merlin Hugues
>b. Mark Bartel
>
>4) B64 (OID . C(P(ASN1(D(data)))))
>a. Philip Hallam-Baker
>
>If you have an opinion on this matter (or need to correct the above
tally), 
>please make it known by close of business (eastern time) Monday.
>
>[1]
http://lists.w3.org/Archives/Public/w3c-ietf-xmldsig/2000JulSep/0398.htm
l
>
>
>_________________________________________________________
>Joseph Reagle Jr.
>W3C Policy Analyst                mailto:reagle@w3.org
>IETF/W3C XML-Signature Co-Chair   http://www.w3.org/People/Reagle/
>