Discrete logarithm for nilpotent groups and cryptanalysis of polylinear cryptographic system
Prikladnaya Diskretnaya Matematika. Supplement, no. 12 (2019), pp. 154-160
Voir la notice de l'article provenant de la source Math-Net.Ru
We present an efficient algorithm to compute a discrete logarithm in a finite nilpotent group, or more generally, in a finitely generated nilpotent group. Special cases of a finite $p$-group ($p$ is a prime) and a finitely generated torsion free nilpotent group are considered. Then we show how the derived algorithm can be generalized to an arbitrary finite or finitely generated nilpotent group respectively. We suppose that group is presented by generating elements and defining relators or like a subgroup of a triangular matrix group over a prime finite field (in finite case) or over the ring of integers (in torsion-free case). On the base of the derived algorithm we give a cryptanalysis of some schemes of polylinear cryptography known in the literature.
Keywords:
discrete logarithm, nilpotent group, polylinear system
Mots-clés : cryptanalysis.
Mots-clés : cryptanalysis.
@article{PDMA_2019_12_a43,
author = {V. A. Roman'kov},
title = {Discrete logarithm for nilpotent groups and cryptanalysis of polylinear cryptographic system},
journal = {Prikladnaya Diskretnaya Matematika. Supplement},
pages = {154--160},
publisher = {mathdoc},
number = {12},
year = {2019},
language = {en},
url = {http://geodesic.mathdoc.fr/item/PDMA_2019_12_a43/}
}
TY - JOUR AU - V. A. Roman'kov TI - Discrete logarithm for nilpotent groups and cryptanalysis of polylinear cryptographic system JO - Prikladnaya Diskretnaya Matematika. Supplement PY - 2019 SP - 154 EP - 160 IS - 12 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/PDMA_2019_12_a43/ LA - en ID - PDMA_2019_12_a43 ER -
V. A. Roman'kov. Discrete logarithm for nilpotent groups and cryptanalysis of polylinear cryptographic system. Prikladnaya Diskretnaya Matematika. Supplement, no. 12 (2019), pp. 154-160. http://geodesic.mathdoc.fr/item/PDMA_2019_12_a43/