METHOD AND DEVICE FOR PROCESSING ELLIPTIC CURVE CRYPTOGRAPHY

摘要

PROBLEM TO BE SOLVED: To solve such a problem that calculation takes a fairy long time since many times of multiplication are required for multiplication and division in cryptography processing by the OEF (optimal extension field) of an extension field proposed so far. SOLUTION: By using the extension field GP (Pm) with m original sets:ω,ω<2> ,...ω }, by the zero pointωof m-th degree irreducible polynominal f(x)=(x -1)/(x-1) on a prime field GF(P) as a base for elliptic curve cryptography processing, inverse calculation accompanying two element multiplication and division is accelerated.