摘要 |
PROBLEM TO BE SOLVED: To improve a conventional ESIGN signature to prove security. SOLUTION: On the assumption of private keys (p) and (q) and a public key n=p<SP>2</SP>q, when preparing a signature with respect to a message (m), a random number (r) is generated, a hash function H is applied upon (m) and (r) and a random number (t) is generated to find w=[(H(m, r)-(h(t) mod n))/pq], to find u=h'(t)<SP>-1</SP>w mod p, to find s=t+upq and to send (m, s, r) to a verifier. The verifier investigates whether or not a condition of H(m, r)≤h(s) mod n<H(m, r)+2<SP>2</SP>|n|/3 is fulfilled and when the condition is fulfilled, the signature is decided as a success. COPYRIGHT: (C)2004,JPO
|