RFC Errata


Errata Search

 
Source of RFC  
Summary Table Full Records

RFC 6090, "Fundamental Elliptic Curve Cryptography Algorithms", February 2011

Source of RFC: IETF - NON WORKING GROUP
Area Assignment: sec

Errata ID: 2775
Status: Held for Document Update
Type: Editorial
Publication Format(s) : TEXT

Reported By: Annie Yousar
Date Reported: 2011-04-11
Held for Document Update by: Sean Turner

Section 2.2 says:

Note that a^M is equal to g^(M modulo R) for any non-negative integer M.

It should say:

Note that a^M is equal to a^(M mod R) for any non-negative integer M.

Notes:

g is a typo. The result of the modulo operation is always denoted in the text by "mod". The notation "modulo" identifies the operation and not the result.

Report New Errata



Advanced Search