Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Mario Romsy"'
Publikováno v:
Colloquium Mathematicum. 116:1-14
It is well known that the repeated square and multiply algorithm is an efficient way of modular exponentiation. The obvious question to ask is if this algorithm has an inverse which would calculate the discrete logarithm efficiently. The technical hi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::120796675b697c275b08fbb4994939f2
https://doi.org/10.4064/cm116-1-1
https://doi.org/10.4064/cm116-1-1
