Paper 2006/381 Original: eprint.iacr.org/2006/381 ↗
Cryptanalysis on an Algorithm for Efficient Digital Signatures
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
- Preprint.
- History
- 2006-11-03: last updated
- 2006-11-03: published
- Short URL
- https://ia.cr/2006/381
- License
- https://creativecommons.org/licenses/by/4.0/
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}
}