On Thu, Aug 18, 2016 at 09:23:01AM -0400, Kathleen Moriarty wrote:
> Ilari,
>
> Thanks for your response. Could you propose text to address the last question?
>
> Thanks,
> Kathleen
>
> On Thu, Aug 18, 2016 at 9:20 AM, Ilari Liusvaara
> <ilariliusvaara@xxxxxxxxx> wrote:
> > On Thu, Aug 18, 2016 at 02:21:27PM +0200, Jari Arkko wrote:
> >> Thanks for your review, Roni!
> >>
> >> Authors, did you observe the editorial suggestions?
> >
> > Did the changes to Editor's Copy.
> >
> > The comment about corner-cases I just deleted[1].
> >
I'm not quite sure what question you mean. The changes due to editorial
suggestions?
Anyway, I grabbed the diff of the changes since -05:
-----------------------------------------------------------------------
diff --git a/draft-liusvaara-jose-cfrg-curves.xml b/draft-liusvaara-jose-cfrg-curves.xml
index a0dcf22..c737ac0 100644
--- a/draft-liusvaara-jose-cfrg-curves.xml
+++ b/draft-liusvaara-jose-cfrg-curves.xml
@@ -49,17 +49,16 @@
Diffie-Hellman algorithms ("X25519" and "X448"; <xref target="RFC7748"/>) and
signature algorithms ("Ed25519" and "Ed448";
<xref target="I-D.irtf-cfrg-eddsa"/>) for asymmetric key cryptography. This document
- defines how those algorithms are to be used in JOSE in interoperable manner.</t>
+ defines how to use those algorithms in JOSE in interoperable manner.</t>
- <t>This document defines the conventions to be used in the context of
+ <t>This document defines the conventions to use in the context of
<xref target="RFC7515" />, <xref target="RFC7516" />, and <xref target="RFC7517" />.</t>
<t>While the CFRG also defined two pairs of isogenous elliptic curves that underlie these
algorithms, these curves are not directly exposed, as the algorithms laid on top are
- sufficient for the purposes of JOSE and are much easier to use. (Trying to apply ECDSA
- to those curves leads to nasty corner-cases and produces odd results.)</t>
+ sufficient for the purposes of JOSE and are much easier to use.</t>
- <t>All inputs to and outputs from the the ECDH and signature functions are defined to
+ <t>All inputs to and outputs from the ECDH and signature functions are defined to
be octet strings, with the exception of outputs of verification functions, which are
booleans.</t>
-----------------------------------------------------------------------
-Ilari