[Resource Topic] 2006/381: Cryptanalysis on an Algorithm for Efficient Digital Signatures

Welcome to the resource topic for 2006/381

Cryptanalysis on an Algorithm for Efficient Digital Signatures

Authors: Fuw-Yi Yang


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.

ePrint: https://eprint.iacr.org/2006/381

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .