Kochanski multiplication
id:
kochanski-multiplication-241-17136853
title:
Kochanski multiplication
text:
Kochanski multiplication is an algorithm that allows modular arithmetic to be performed efficiently when the modulus is large. This has particular application in number theory and in cryptography: for example, in the RSA cryptosystem and Diffie–Hellman key exchange. The most common way of implementing large-integer multiplication in hardware is to express the multiplier in binary and enumerate its bits, one bit at a time, starting with the most significant bit, perform the following operations o
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Kochanski_multiplication
date created:
date modified:
2023-10-29T14:32:17Z
main entity:
{"identifier":"Q6424798","url":"https://www.wikidata.org/entity/Q6424798"}
image:
fields total:
13
integrity:
13