Zobrazeno 1 - 3
of 3
pro vyhledávání: '"K. M. Sangeeta Maini"'
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
Publikováno v:
ITW
We define the entropy of an orthogonal matrix O/sup i//sub j./ The entropy of the i/sup th/ row can have the maximum value ln n, which is attained when each element of the row is /spl plusmn/1//spl radic/n. This gives the bound, H{O/sup i//sub j/} /s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b3d514b8aff360ce6f1e5eceae4e15ba
https://doi.org/10.1088/0305-4470/36/7/103
https://doi.org/10.1088/0305-4470/36/7/103
Publikováno v:
Progress in Cryptology-INDOCRYPT 2004 ISBN: 9783540241300
INDOCRYPT
INDOCRYPT
Applying Hensel’s lemma to the discrete logarithm problem over prime fields reveals the rich geometric and algebraic structure underlying the problem. It is shown that the problem has links to cocycles, connections, group extensions and crystalline
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6e72aed6094e81db1f3f21f831dcaf83
https://doi.org/10.1007/978-3-540-30556-9_24
https://doi.org/10.1007/978-3-540-30556-9_24
