[dnsext] draft-hoffman-dnssec-ecdsa-04

[Miek Gieben <[e-mail]>]

Hello,

I've (re)read and implemented dnssec-ecdsa-04 in some code. During that
process I got some questions about it:

* Section 1: It says ECDSA is 20 times faster than RSA for signing
    and 5 times slower for validating. Shouldn't that require a reference?

* Section 4: How should I know that, x and y are of equal length?

* Section 4: Same question for r and s?

* Section 6: In the examples the privatekey file is shown. I haven't seen
    (or can't remember) this in any previous RFC specifing new algorithms
    for DNSKEYs. Also all other (DSA/RSA) .priv key files (as generated by BIND) 
    put the public key info in the .priv file, this one is an exception. Why?

    (My local elliptic curve documentation tells me the the private key consists
    out of the public key and a bigInt called D)

 Kind regards,

-- 
    Miek Gieben

_______________________________________________
dnsext mailing list
[e-mail]
https://www.ietf.org/mailman/listinfo/dnsext