Referenced Items are not available for this document.
L. Harn (1994) proposed a digital signature scheme which was claimed to be unbreakable if the factorisation and the discrete logarithms are simultaneously unsolvable. The paper shows that `hackers' can forge the signatures of Harn schemes with high probabilities, if they can solve the discrete logarithms modulo α large prime number. The Harn signature scheme is modified to give it the same degree of security as was originally claimed
Published in:
Computers and Digital Techniques, IEE Proceedings -
(Volume:143
,
Issue:
3
)
Date of Publication: May 1996
- Page(s):
- 196 - 198
- ISSN :
- 1350-2387
- INSPEC Accession Number:
- 5298394
- Digital Object Identifier :
- 10.1049/ip-cdt:19960335
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- May 1996
- Sponsored by :
- IET
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
