In this paper, we propose a new signature scheme based on factoring and discrete logarithm. This scheme is based on two hard problems and provides higher level security as compare to a single hard problem. Most of the designated signature schemes are based on a single hard problem. Although these schemes secure but in a future if an enemy manages to solve this problem, are then he can recover all secret information including secret keys and parameters of the scheme. Our scheme is protected from such four attacks which are most common attacks for signature schemes.
展开▼