Improvement of signature scheme based on factoring and chaotic maps
by Nedal Tahat; Eddie Shahril Ismail
International Journal of Electronic Security and Digital Forensics (IJESDF), Vol. 10, No. 2, 2018

Abstract: Chain and Kuo (2013) proposed an efficient signature scheme based on chaotic maps and factorisation. Their scheme is secure but requires many keys for signing documents. In this article, we shall propose an improvement of Chain and Kuo's signature scheme. The improved scheme will outperform their scheme in the number of keys.

Online publication date: Wed, 04-Apr-2018

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Electronic Security and Digital Forensics (IJESDF):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com