Being based on super elliptic curved line cryptography parameter generation algorithm the super elliptic curved line cryptography

摘要

PROBLEM TO BE SOLVED: To determine rational coefficient of a class polynomial in a sort operation time by finding and using a prime factor of the denominator of a class polynomial coefficient having the minimum denominator absolute value out of class polynomial coefficients.;SOLUTION: The method for generating a hyperelliptic curve cryptographic algorithm by using a computer is provided with a step S102 where a denominator prime factor group of conversion s1k to rational numbers of a primary fundamental symmetric function s-1k of Igusa invariants constituting a hyperelliptic curve is obtained, a step S104 where the denominator prime factor group of s1k is noticed to obtain candidates of rational coefficients of the class polynomial having higher frequencies in appearance by fundamental symmetric functions s-1,k of Igusa invariants and continued fraction development and approximation of the sum of their prime factor groups, and a step S106 where the reducibility as K*0 (a partial real quadratic field f a reflex CM field) coefficient polynomial of the class polynomial is taken as a discrimination condition to determine a class polynomial coefficient from these rational coefficient candidates having higher frequencies in appearance.;COPYRIGHT: (C)2002,JPO