| 摘要 |
PROBLEM TO BE SOLVED: To solve a discrete logarithm problem using a modulus n consisting of product of three prime numbers. SOLUTION: An ID is converted into an element ek of irreducible system of residues by a hash function and the ek is converted into ek' (ek'=ek or<SB>α</SB>ek) by whether a Jacobian symbol (ek/n) is 1 or -1. The ek' is converted into ek" (ek"=ek' or -ek') by whether a Legendre symbol (ek'/p) is 1 or -1. A discrete logarithm is calculated for ek" by considering the base as g regarding moduli p, q, r and a key Sk is calculated by a Chinese remainder theorem. COPYRIGHT: (C)2007,JPO&INPIT
|
