Lifting of solutions of an exponential congruence (Q881059): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Štefan Porubský / rank | |||
Property / reviewed by | |||
Property / reviewed by: Štefan Porubský / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s11006-006-0110-y / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2069451805 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some soluble cases of the discrete logarithm problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5302599 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 18:42, 25 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Lifting of solutions of an exponential congruence |
scientific article |
Statements
Lifting of solutions of an exponential congruence (English)
0 references
21 May 2007
0 references
Let \(K\) be a finite extension of \(\mathbb Q\), \(n=[K:{\mathbb Q}]\), and \({\mathbb Z}_K\) be the ring of integers of \(K\). Let \(\mathfrak p\) be a prime ideal of \({\mathbb Z}_K\), and \(\alpha,\beta\in{\mathbb Z}\) be such that \(\alpha,\beta\in{\mathfrak p}\). In the paper a polynomial algorithm is suggested for reducing the discrete logarithm problem, i.e. of reducing the solution of the congruence \(\alpha^x\equiv \beta \bmod{{\mathfrak p}^N}\), \(N>1\) an integer, to the solution of the \(\alpha^x\equiv \beta \bmod{{\mathfrak p}}\), \(x\in {\mathbb Z}\). The solution is divided into three parts: the ``degenerate'' case in which \(\alpha\) is a root of degree \(p^f-1\) of \(1\) \(\bmod{ {\mathfrak p}^N}\), and the ``lower'' and ``higher'' cases in which \(N\) is not greater than \(\rho=\lfloor e/(p-1)\rfloor+1\) and greater that \(\rho\), with standard meaning of \(e,f\) and \(p\). In the presented explicit formulas instead of the Fermat quotients polynomially computable logarithmic functions are used, and \(\rho\) appears here because of the convergence of the series in use.
0 references
polynomial algorithm
0 references
discrete logarithm
0 references
ring of algebraic integers
0 references
Fermat quotient
0 references
p-adic logarithm
0 references