omplete (filled values are modulus, private exponent and
public exponent)
Thanks,
Miro
On 29. 10. 2012 18:32, Wim Lewis wrote:
On 29 Oct 2012, at 8:44 AM, Miroslav Mikluš wrote:
The xmldsig (http://www.w3.org/TR/xmldsig-core/#sec-RSAKeyValue)
use the first form of RSA representation with respec
public exponent)
Thanks,
Miro
On 29. 10. 2012 18:32, Wim Lewis wrote:
On 29 Oct 2012, at 8:44 AM, Miroslav Mikluš wrote:
The xmldsig (http://www.w3.org/TR/xmldsig-core/#sec-RSAKeyValue)
use the first form of RSA representation with respect to the :
http://tools.ietf.org/html/rfc3447#section-3.2
#x27;t find any example or documentation about what may go wrong
when the RSA
key is incomplete (filled values are modulus, private exponent and
public exponent)
Thanks,
Miro
On 29. 10. 2012 18:32, Wim Lewis wrote:
On 29 Oct 2012, at 8:44 AM, Miroslav Mikluš wrote:
The xmldsig (http://www.w3
On 29 Oct 2012, at 8:44 AM, Miroslav Mikluš wrote:
> The xmldsig (http://www.w3.org/TR/xmldsig-core/#sec-RSAKeyValue)
> use the first form of RSA representation with respect to the :
> http://tools.ietf.org/html/rfc3447#section-3.2
The RSAKeyValue element contains a public key
Hi all,
The xmldsig (http://www.w3.org/TR/xmldsig-core/#sec-RSAKeyValue)
use the first form of RSA representation with respect to the :
http://tools.ietf.org/html/rfc3447#section-3.2
It looks like rsa.h use the quintuple representation only,
is there a way how to work with the (n, d) form in
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Hi!
I want to sign XML documents.
So I am searching for a OpenSSL based XMLDSig (Digital Signatures in XML)
implementation, that would be useable from Perl scripts.
(I guess I could live with a XMLDSig compliant implementation of Digital
