CryptoDB
Cryptanalysis on an Algorithm for Efficient Digital Signatures
Authors: | |
---|---|
Download: | |
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. |
BibTeX
@misc{eprint-2006-21872, title={Cryptanalysis on an Algorithm for Efficient Digital Signatures}, booktitle={IACR Eprint archive}, keywords={public-key cryptography / digital signatures}, url={http://eprint.iacr.org/2006/381}, note={ yangfy@ms7.hinet.net 13454 received 1 Nov 2006}, author={Fuw-Yi Yang}, year=2006 }