Answer Posted / Ganesh Pratap Singh
Discrete logarithm problems are generally considered harder than factoring large composite numbers. The difficulty of solving either problem is a crucial part of the security of many cryptographic systems based on RSA (factoring) and elliptic curve cryptography (discrete log).
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
Please Help Members By Posting Answers For Below Questions
No New Questions to Answer in this Category !! You can
Post New Questions
Answer Questions in Different Category
