Digital Signature Schemes Based on Two Hard Problems-Reference-Cited by-同舟云学术

Digital Signature Schemes Based on Two Hard Problems

Published:2017 Issue: Volume: Page:98-125
ISSN:1948-9730
Container-title:Detecting and Mitigating Robotic Cyber Security Risks
language:
Short-container-title:

Author:

Nimbalkar A. B.¹,Desai C. G.²

Affiliation:

1. Annasaheb Magar Mahavidyalaya, India

2. NDA, India

Abstract

This chapter takes a critical review of the digital signature schemes which are based on two hard problems. The analytical study begins with the Harn (1994) scheme and He-Kiesler (1994) scheme. Shao's 1998 and 2002 schemes have been studied. Wei-Hua He (2001) and Shimin Wei (2004, 2007) schemes are analyzed further in the research work. Attacks on Shimin Wei's (2004, 2007) schemes are critically studied and drawbacks have been noted so as to design better schemes than these. Then we continue our analysis work by studying Ismail, Thate, and Ahmad's (2008) scheme and Swati Verma's (2012) signature scheme.

Publisher

IGI Global

Reference38 articles.

1. A Method of Factoring and The Factorization Of F 7.;M. M.Brillhart;Mathematics of Computation,1975

2. Chen, L. G. (2009). Comment On Wei’s Digital Signature Scheme Based On Two Hard Problems. Academic Press.

3. New directions in cryptography

4. A Public Key Cryptosystem And A Signature Scheme Based On Discrete Logarithms. IEEE Trans. Inform.;T.Elgamal;Theory,,1985

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Digital Watermarking for Enriched Video Streams in Edge Computing Architectures Using Chaotic Mixtures and Physical Unclonable Functions;Communications in Computer and Information Science;2020