Scholarly open access journals, Peer-reviewed, and Refereed Journals, Impact factor 8.14 (Calculate by google scholar and Semantic Scholar | AI-Powered Research Tool) , Multidisciplinary, Monthly, Indexing in all major database & Metadata, Citation Generator, Digital Object Identifier(DOI)
According to public key cryptosystems on integers, Discrete Logarithm Problem (DLP) is hard to break was the important assumption. These computational assumptions were tested by developing improved algorithms to decipher them. DLP for elliptic curves defined over certain finite fields is trusted to be difficult. For these types of problems, Pollard rho is the most suitable algorithm. The most effective and efficient idea to attack DLP over elliptical curves is index calculus algorithm, because it solves DLP for finite fields in sub-exponential time. It is essential to comprehend these algorithms.
"Algorithms for Solving Discrete Logarithm Problem", International Journal of Science & Engineering Development Research (www.ijrti.org), ISSN:2455-2631, Vol.3, Issue 7, page no.279 - 283, July-2018, Available :http://www.ijrti.org/papers/IJRTI1807045.pdf
Downloads:
000204750
ISSN:
2456-3315 | IMPACT FACTOR: 8.14 Calculated By Google Scholar| ESTD YEAR: 2016
An International Scholarly Open Access Journal, Peer-Reviewed, Refereed Journal Impact Factor 8.14 Calculate by Google Scholar and Semantic Scholar | AI-Powered Research Tool, Multidisciplinary, Monthly, Multilanguage Journal Indexing in All Major Database & Metadata, Citation Generator