摘要 |
PROBLEM TO BE SOLVED: To enhance the security against attacks from a third party while keeping the convenience in the key delivery system, the public key encryption system, and the digital signature system. SOLUTION: A security unit 20 uses a common polynomial a(x) with integer coefficients and r-sets of integers (s, q) to calculate a polynomial b(x)=Σ<SB>n=0</SB><SP>deg a(x)</SP>Σ<SB>m=0</SB><SP>r</SP>(q<SB>m</SB>s<SB>m</SB><SP>n</SP>[partial differentiation operator]<SP>n</SP>a(x)/n!)modI and transmits the arithmetic result to a security unit 30. The security unit 30 uses a common polynomial a(x) with integer coefficients and t-sets of integers (u,v) to calculate a polynomial c(x)=Σ<SB>n=0</SB><SP>deg a(x)</SP>Σ<SB>m=0</SB><SP>t</SP>(v<SB>m</SB>u<SB>m</SB><SP>n</SP>[partial differentiation operator]<SP>n</SP>a(x)/n!)modI and transmits the arithmetic result to the security unit 20. Then the security unit 20 calculates a common key by using an expression of k(x)=Σ<SB>n=0</SB><SP>deg c(x)</SP>Σ<SB>m=0</SB><SP>r</SP>(q<SB>m</SB>s<SB>m</SB><SP>n</SP>[partial differentiation operator]<SP>n</SP>c(x)/n!)modI, and the security unit 30 calculates the common key by using an expression of k(x)=Σ<SB>n=0</SB><SP>deg b(x)</SP>Σ<SB>m=0</SB><SP>t</SP>(v<SB>m</SB>u<SB>m</SB><SP>n</SP>[partial differentiation operator]<SP>n</SP>b(x)/n!)modI. COPYRIGHT: (C)2004,JPO
|