The following errata report has been submitted for RFC2631,
"Diffie-Hellman Key Agreement Method".
--------------------------------------
You may review the report below and at:
http://www.rfc-editor.org/errata_search.php?rfc=2631&eid=2506
--------------------------------------
Type: Technical
Reported by: Yves Legrandgerard <ylg(_at_)pps(_dot_)jussieu(_dot_)fr>
Section: 2.2.1.1
Original Text
-------------
6. For i = 0 to m' - 1
U = U + (SHA1[SEED + i] XOR SHA1[(SEED + m' + i)) * 2^(160 * i)
Note that for m=160, this reduces to the algorithm of [FIPS-186]
U = SHA1[SEED] XOR SHA1[(SEED+1) mod 2^160 ].
Corrected Text
--------------
6. For i = 0 to m' - 1
U = U + (SHA1[SEED + i] XOR SHA1[(SEED + m' + i) mod 2^(160 * (i + 1))])
Note that for m=160, this reduces to the algorithm of [FIPS-186]
U = SHA1[SEED] XOR SHA1[(SEED + 1) mod 2^160].
Notes
-----
The line:
U = U + (SHA1[SEED + i] XOR SHA1[(SEED + m' + i)) * 2^(160 * i)
is syntactically incorrect. Closing bracket of last 'SHA1[' is missing.
Moreover, when m=160 (m'=1), the loop cannot reduce to the line:
U = SHA1[SEED] XOR SHA1[(SEED + 1) mod 2^160]
as it can be easily seen.
Instructions:
-------------
This errata is currently posted as "Reported". If necessary, please
use "Reply All" to discuss whether it should be verified or
rejected. When a decision is reached, the verifying party (IESG)
can log in to change the status and edit the report, if necessary.
--------------------------------------
RFC2631 (draft-ietf-smime-x942-07)
--------------------------------------
Title : Diffie-Hellman Key Agreement Method
Publication Date : June 1999
Author(s) : E. Rescorla
Category : PROPOSED STANDARD
Source : S/MIME Mail Security
Area : Security
Stream : IETF
Verifying Party : IESG
_______________________________________________
smime mailing list
smime(_at_)ietf(_dot_)org
https://www.ietf.org/mailman/listinfo/smime