Cryptology ePrint Archive: Report 2006/381

Cryptanalysis on an Algorithm for Efficient Digital Signatures

Fuw-Yi Yang

Abstract: The total computation of the generation and verification of personnel identification or digital signature is heavy. For many schemes of them, the total computation is not less than hundreds of modular multiplications. Efficient schemes of personnel identification and digital signature were proposed, which require no more than 10 modular multiplications on generation and verification of challenge-response or digital signature. However, the schemes are weak in security. The paper will show that by interception of a transcript of communications between the prover and verifier, the private key of the prover is revealed.

Category / Keywords: public-key cryptography / digital signatures

Date: received 1 Nov 2006

Contact author: yangfy at ms7 hinet net

Available formats: PDF | BibTeX Citation

Version: 20061103:163554 (All versions of this report)

Discussion forum: Show discussion | Start new discussion