An authentication technique that also includes measures to counter repudiation by the source is termed Digital Signature. Most cryptographic schemes rely on some hard mathematical problem. Ong-Schnorr-Shamir is a digital signature scheme with the advantage of ease of implementation. It was believed that this was of similar difficulty to that of factoring the modulus n. In this paper, we break the OSS scheme by appealing to a famous calculus problem.
Bitte loggen Sie sich ein, um Zugang zu diesem Inhalt zu erhalten