I am doing research on comparative analysis of ID based cryptographic protocols like ElGamal, RSA, DSA etc. How can compare these protocols with the properties without doing any objective experiment?
You need to choose the properties for comparing. It could be size of the keys, or size of additional data, computational and memory complexity, complexity for cryptanalysis (with different attack model), mathematical problems in the base of protocols, application of protocols in different standards.
we have to look which encryption metheod is used
RSA using DSS
RSA using RSA
SHA-1, SHA-512, MD5 or ECC, Bilinear Pairing, ElGamal Cryptosystem, Cybershavo Choatic Map or Computational Diffie-Hellmen technique.
How much space will require for a parameter to pass, Exponential Execution Time, Polynomial time complexity etc.
Using big-O notation for measuring computation complexity.
Hope you will understand, a clue has been given
https://books.google.com/books?id=Y4DEBAAAQBAJ&pg=PA176&lpg=PA176&dq=How+to+compare+ID+based+cryptographic+zero+protocols+with+properties?&source=bl&ots=dO6HlHEznx&sig=ACfU3U3eEw9ObE56x2M1usy7GG-0s0-HyA&hl=en&sa=X&ved=2ahUKEwiGwPOWsbDpAhWDC-wKHVMoDrUQ6AEwAXoECAsQAQ
- Badges
- Science topic