| 摘要 |
<P>PROBLEM TO BE SOLVED: To provide a digital signature system with quantum computer-resistant properties which employs a system where security depends on the solution of high-powered multivariable simultaneous algebraic equations, which is one of NP complete problems, in consideration of the fact that conventional systems have no quantum computer-resistant properties to allow decryption in a polynomial time due to the appearance of a quantum computer. <P>SOLUTION: An encryption function F(X) on a quaternion algebra, which has, as coefficients, m arbitrary elements k<SB POS="POST">i</SB>(i=1 to m) on a finite field Fq and m mutually non-commutative elements A<SB POS="POST">i</SB>(i=1 to m) on a quaternion algebra H on the finite field Fq is taken as a public key of a user A (signer), and the user A (signer) uses an auxiliary encryption function T(X) created at each time of signature creation, the encryption function F(X), and a message E to create a digital signature S and transmits the digital signature S and the message E to a user B(verifier). The user B (verifier) uses the received digital signature S and message E, the public key F(X), and public information q,d,r,m to verify that the digital signature S is a signature of the user A. <P>COPYRIGHT: (C)2012,JPO&INPIT |
