Design and Analysis of a Non-deterministic Digital Signature Protocol

Provided by: Science & Engineering Research Support soCiety (SERSC)
Topic: Security
Format: PDF
In this paper, the authors describe a modular arithmetic-based signing scheme called NDSP which combines essentially optimal efficiency with attractive security properties. Signing takes one RSA decryption plus some hashing, verification takes one RSA encryption plus some hashing and the size of the signature is the size of the modulus. Assuming the underlying hash functions are ideal, their schemes are not only provably secure, but are so in a tight way an ability to forge signatures with a certain amount of computational resources implies the ability to invert RSA (on the same size modulus) with about the same computational effort.

Find By Topic