Cryptanalysis on an Algorithm for Efficient Digital Signatures

Fuw-Yi Yang

Paper 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.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Published elsewhere. Unknown where it was published
Keywords: digital signatures
Contact author(s): yangfy @ ms7 hinet net
History: 2006-11-03: received
Short URL: https://ia.cr/2006/381
License: CC BY

BibTeX

@misc{cryptoeprint:2006/381,
      author = {Fuw-Yi Yang},
      title = {Cryptanalysis on an Algorithm for Efficient Digital Signatures},
      howpublished = {Cryptology {ePrint} Archive, Paper 2006/381},
      year = {2006},
      url = {https://eprint.iacr.org/2006/381}
}