W3C home > Mailing lists > Public > public-xmlsec@w3.org > June 2012

RE: Encryption 1.1 interop Qs

From: Pratik Datta <pratik.datta@oracle.com>
Date: Fri, 8 Jun 2012 23:21:24 -0700 (PDT)
Message-ID: <1e8e48a6-7165-429f-80dc-9c21f605d1f3@default>
To: "Cantor, Scott" <cantor.2@osu.edu>, public-xmlsec@w3.org
I had created those samples with our implementation, so they should work.

Are you using the correct parameters for RSA-OAEP ?   There is a DigestMethod parameter and a MGF parameter.

If you want I can generate a different algorithm combination and you can see if it works for you.

I hadn't realized that the AES-192 GCM algorithm was missing from the spec. I think it must be an oversight.


-----Original Message-----
From: Cantor, Scott [mailto:cantor.2@osu.edu] 
Sent: Friday, June 08, 2012 8:23 PM
To: public-xmlsec@w3.org
Subject: Encryption 1.1 interop Qs

Referring to: 

The GCM samples have a test case for AES192 GCM, but I don't see that algorithm defined in the draft. It's logical that there would be one, but with no URI for that in the spec, it's a little fishy.

The other issue I had is that I'm not able so far to even decrypt the key used in the 2048-bit sample:


The XML points to the certificate in the 2048 bit RSA key file, but using that private key against the EncryptedKey in that sample is giving me a padding error. I would chalk it up to a bug on my part, but I haven't had any interop issues in the past with RSA-OAEP in the code I'm testing.

So I thought I'd ask if anybody else has tested that sample successfully before I go digging.

-- Scott
Received on Saturday, 9 June 2012 06:21:58 UTC

This archive was generated by hypermail 2.3.1 : Tuesday, 6 January 2015 20:55:18 UTC