The hashing algorithm operation is depending on byte order of the machine and the way values are treated as signed or unsigned.
Expand the description of the algorithm to cover byte order and signedness so the description can be platform independent.
Part 4, Section 2.15.1.28
te
Proposed Disposition of DIS 29500 Comment IR-0014 (Modified: 2008-01-13) Agreed; to ensure this process is described in a platform-independent manner, the following changes will be made in Part 4, ยง2.15.1.28, page 1,158, line 15: The following steps assume that all words are unsigned, the word size is two bytes, and that bit-level SHL/SHR operations shift in the direction of the highest-order and lowest-order bit, respectively. [Example: 0x61 SHR 1 is 0xC2, as 01100001 shifted one position in the direction of its highest-order bit is 11000010. end example] First, t T he password shall be hashed using the following algorithm: Similar Comments: BR-0005 , CA-0017 , DK-0158 , GB-0222 , KE-0022 , PT-0041 , US-0054
Dupe of Ecma 46