Using the method in order to do modular multiplication, and the number of 2N bits method in order to do Euclid multiplication

摘要

This invention, using the number of 2n bits, regards the method of doing modular multiplication. Method of this invention, number (A and B) the step which is disassembled in the U cardinal number which is 2ⁿ cardinal numbers, or suitable integer and, after that, MultModDiv and/or consists of with the step which calculates MultModDivInit type basically vis-a-vis the front numeration of the n bit from 1st step. As for this invention, in addition, it regards also the method of calculating Euclid multiplication/division. As for this invention, it can use for also cryptographic calculation.