Abstract:
Digital signature is used in message transmission to verify the identity of the sender and to ensure that a message has not been modified after signing. It is one of the most important applications and technique for cryptography and of achieving security in digital transactions. Its importance increases continuously in the age of computing and informatics. This research investigates the digital signature algorithms RSA and DSS in order to compare their performance in carrying these requirements, types and schemes. These algorithms are intensively discussed. There is a comparison between two algorithms with different mathematical background; nevertheless, both algorithms have public key variants. One of these algorithms was built using discrete logarithm while the other was built using factoring of large numbers.
The performance of the two public key (RSA and DSS) has been implemented and compared and the results show that signing and verification operations in the RSA and DSS.
A experiment was conducted to measure performance of that algorithms and the computational overhead in term of time and space complexity, cryptanalysis methods of those algorithms, are highlighted lists and record of time carried by breaker algorithm are given.
