Improved digital signature protocol using iterated function systems

Abstract

In this paper, a novel digital signature protocol is proposed. It is based on the iterated function system attractor, which is regarded as an emerging method. The idea behind our proposed method is based on selecting a known fractal set and then finding the attractor of the affine transformation functions. The attractor is then used in the encryption and decryption of a hash function to ensure the protection of the document from eavesdropping and integrity during the transmission. The properties and software implementation of the proposed protocol are discussed in detail. A comparison is made with the Rivest, Shamir, and Adleman cryptosystems, which shows that it performs better.

Keywords:

• fractal
• iterated function systems (IFS)
• attractor
• digital signature
• Hutchinson operator W

2010 AMS Subject Classifications :

• 11T71
• 14G50
• 68P25
• 94A60
• 28A80

Acknowledgements

This study was supported by the Institute for Mathematical Research (INSPEM), University Putra Malaysia, and the Ministry of Higher Education, Malaysia, under the fundamental Research Grant Scheme (Grant no. Vot.5523760). The authors thank UPM for their cooperation and assistance rendered.