Security of Shao's signature schemes based on factoring and discrete logarithms
In 1998, Shao proposed two new digital signature schemes which were claimed to be unbreakable if the factorisation and the discrete logarithms are simultaneously unsolvable. However, this paper shows that, if one has the ability to solve the factorisation problem, Shao's signature schemes can be broken.