Affiliation:
1. Institute of Mathematics, University of Zurich , Zürich , Switzerland
Abstract
Abstract
The discrete logarithm problem (DLP) in a finite group is the basis for many protocols in cryptography. The best general algorithms which solve this problem have a time complexity of
O
(
N
log
N
)
O\left(\sqrt{N}\log N)
and a space complexity of
O
(
N
)
O\left(\sqrt{N})
, where
N
N
is the order of the group. (If
N
N
is unknown, a simple modification would achieve a time complexity of
O
(
N
(
log
N
)
2
)
O\left(\sqrt{N}{\left(\log N)}^{2})
.) These algorithms require the inversion of some group elements or rely on finding collisions and the existence of inverses, and thus do not adapt to work in the general semigroup setting. For semigroups, probabilistic algorithms with similar time complexity have been proposed. The main result of this article is a deterministic algorithm for solving the DLP in a semigroup. Specifically, let
x
x
be an element in a semigroup having finite order
N
x
{N}_{x}
. The article provides an algorithm, which, given any element
y
∈
⟨
x
⟩
y\in \langle x\rangle
, provides all natural numbers
m
m
with
x
m
=
y
{x}^{m}=y
, and has time complexity
O
(
N
x
(
log
N
x
)
2
)
O\left(\sqrt{{N}_{x}}{\left(\log {N}_{x})}^{2})
steps. The article also gives an analysis of the success rates of the existing probabilistic algorithms, which were so far only conjectured or stated loosely.
Subject
Applied Mathematics,Computational Mathematics,Computer Science Applications
Reference20 articles.
1. Diffie W, Hellman ME. New directions in cryptography. IEEE Trans Inform Theory 1976;IT-22(6):644–54.
2. Menezes AJ, van Oorschot PC, Vanstone SA. Handbook of applied cryptography. CRC Press Series on Discrete Mathematics and its Applications. Boca Raton, FL: CRC Press; 1997.
3. Cohen H, Frey G, Avanzi R, Doche C, Lange T, Nguyen K, et al., editors. Handbook of elliptic and hyperelliptic curve cryptography. In: Discrete Mathematics and its Applications (Boca Raton). Boca Raton, FL: Chapman and Hall/CRC; 2006.
4. Cormen TH, Leiserson CE, Rivest RL, Stein C. Introduction to algorithms. Cambridge, MA: MIT Press; 2009.
5. Shanks D. Class number, a theory of factorization, and genera. In: Proc. of Symp. Math. Soc., 1971. vol. 20, 1971. pp. 41–440.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献