e/Kochanski multiplication

Information
has gloss	eng: Kochanski multiplication is an algorithm that allows modular arithmetic (multiplication or operations based on it, such as exponentiation) to be performed efficiently when the modulus is large (typically several hundred bits). This has particular application in number theory and in cryptography: for example, in the RSA cryptosystem and Diffie-Hellman key exchange.
lexicalization	eng: Kochanski multiplication
instance of	e/Encryption