| 摘要 |
PROBLEM TO BE SOLVED: To eliminate vulnerability resulting from a one-variable polynomial in a public key cryptosystem using an algebraic surface. SOLUTION: An encryption device 100 includes: a plaintext embedding section 104 embedding a message m as the coefficient of a three-variable plaintext polynomial m(x, y, t); an identification polynomial generating section 106 generating a three-variable identification polynomial f(x, y, t); a polynomial generating section 107 randomly generating three-variable polynomials r<SB>1</SB>(x, y, t), r<SB>2</SB>(x, y, t), s<SB>1</SB>(x, y, t), s<SB>2</SB>(x, y, t); and an encryption section 105 generating ciphertexts F<SB>1</SB>and F<SB>2</SB>by calculating these three-variable polynomials. Unlike the conventional way wherein a one-variable plaintext polynomial m(t) and a one-variable irreducible polynomial f(t) are used, a three-variable plaintext polynomial m(x, y, t) and a three-variable identification polynomial f(x, y, t) are used and the problem of vulnerability can be solved. COPYRIGHT: (C)2009,JPO&INPIT
|
