This multiplier network for the multiplication, modulo a binary number n, of two binary numbers x and y

摘要

The process of multiplying modulo a binary number n, of two binary numbers x and y according to the invention consists in carrying out a first multiplier, 1984, the multiplication of a signal representing the number x by a signal, 1984, multiplicand representing the number y, with the aid of a first multiplier circuit 16, to carry out a second multiplication of the result obtained at the output of the first multiplier circuit by a signal, 1984, representing the inverse of the number n by means of a second multiplier circuit 18, to take on the part entire of the result obtained at the output of the second multiplier circuit 18, in order to carry out a multiplication of the third part entire obtained by a signal, 1984, representing a number n by means of a third multiplier circuit 22 and to subtract the result obtained at the output of the third multiplier circuit 22 of the result obtained at the output of the first multiplier circuit in order to obtain a signal r corresponding to the product, 1984, modulo the number n of the number x by multiplying the number multiplicand y. / p & & p & application: enciphering devices and