MODULAR MULTIPLICATION AND MODULAR EXPONENTIATION USING EXTENDED NIST PRIME

摘要

PURPOSE: A modular multiplication method using an extended NIST prime number and a modular exponentiation method are provided to improve the performance of an encryption system based on the pairing of a prime number based elliptical curve encryption system. CONSTITUTION: A modular multiplier receives two integers(410). The modular multiplier multiplies the inputted integers(420). The modular multiplier executes first modular subtraction for the multiplied value(430). The modular multiplier executes second modular subtraction for the first modular subtraction(440). [Reference numerals] (410) Inputting two integers; (420) Multiplying the inputted integers; (430) Executing a first modular subtraction with q for the multiplied values; (440) Executing a second modular subtraction with prime number p for the result of the first modular subtraction; (AA) Start; (BB) End