PARTIALLY BLIND SIGNATURE SCHEME BASED ON CHAOTIC MAPS AND FACTORING PROBLEMS

Abstract

Due to the importance of security and efficiency of electronic signatures schemes, there is an increase in interest among scholars to develop such schemes based on mathematical problems to be more secure and efficient.  In this paper, we propose a scheme with a low computation cost based on both cryptographic and chaotic system characteristics.  The security of the scheme depends upon the intractability of the factorization problem and discrete logarithm of Chebyshev polynomials.  The performance comparison demonstrated that the proposed scheme has a lower communication cost than the existing schemes in the literature, such as the one proposed by Tahat et al.  To the best of our knowledge, this is the first time a partially blind signature scheme based on chaotic maps and factoring problem has been proposed.