RUS
ENG
Full version
JOURNALS
// Prikladnaya Diskretnaya Matematika
// Archive
Prikl. Diskr. Mat.,
2011
supplement № 4,
Pages
31–32
(Mi pdm290)
This article is cited in
2
papers
Mathematical Methods of Cryptography
Discrete logarithm diophantiness
S. Y. Erofeev
Omsk State University, Omsk
Abstract:
The paper proposes a new representation of discrete logarithm in
$Z_p$
by constructing a diophantine equation, such that finding solution to this equation and finding discrete logarithm are equivalent problems.
UDC:
512.62
Fulltext:
PDF file (375 kB)
References
Cited by
©
Steklov Math. Inst. of RAS
, 2025