I study these terms in
1- Elliptic Curve Cryptography (ECC)
2- Discrete Logarithmic Problem (DLP)
3- Diffie-Hellman Technique
But I don't know the procedure for a protocol that could verifiably protect in the random oracle model against the hardness assumptions of the aforesaid 3 techniques.
hi @ Saeed Ullah Jan
your protocol depended on the strong of DLP.
thank.
Dear Salah, still not understand. I know formal security analysis using BAN/GYN logics, ProVerif/AVESPA
but how to verify a protocol using random aricle model aginat hadness asumptions.
Dear Jan,
Your question about the " hardness assumptions ", ECC, DLP, and DH Technique , not about authentication, but BAN logic for analysis authentication.
best regards.
Ok Salah
But tell me some network security experts claim that their protocol will verifiably protect in the random oracle model against the hardness assumptions of the Elliptic Curve Discrete Logarithm Problem and Elliptic Curve Computational Diffie-Hellman problem.
What this mean?