Page "Multiplicative inverse" Paragraph 5

# Use the extended Euclidean algorithm to compute k < sup >− 1 </ sup >, the modular multiplicative inverse of k mod 2 < sup > w </ sup >, where w is the number of bits in a word.

This inverse will exist since the numbers are odd and the modulus has no odd factors.