PROBLEM TO BE SOLVED: To provide a Montgomery division device capable of obtaining a divided result in a Montgomery arithmetic area at a high speed. ;SOLUTION: This Montgomery division device 200 for obtaining the divided result Y in the Montgomery arithmetic area to be Y=B.A' (-1).2 n mod N for the integer (n) of (n)≥L when a bit length at the time of binarily expressing N is defined as L for a positive integer N, the positive integer A (0≤AN and A and N are mutually prime) and the positive integer B is provided with a Montgomery inverse element calculation part 201 for inputting the integer A and a modulus N and obtaining an inverse element X=A (-1).2 (2n) mod N and a Montgomery multiplication part 202 for inputting the obtained inverse element X, the modulus N and the B and obtaining the divided result Y=B.X.2 (-n) mod N.;COPYRIGHT: (C)1998,JPO
展开▼
机译:解决的问题:提供一种能够在蒙哥马利算术区域中高速获得除法结果的蒙哥马利除法装置。 ;解决方案:该蒙哥马利除法装置200用于在蒙哥马利算术区域中获得除法结果Y为Y = BA'(-1).2 n mod N,用于当(n)≥L的整数(n)位长度时对于正整数N,将二元表达N时的L定义为L,正整数A(0≤A展开▼