EUVIMEDEUVIMED entdecken
Open Access · CC BY-NC 4.0

Root extraction in finite Abelian groups

Udvas Acharjee, M.S. Srinath

Journal of Computational Algebra · 2024

DOI: 10.1016/j.jaca.2024.100017 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Computational Algebra, 2024. Verfasst von Udvas Acharjee und 1 weiteren Autor:innen. Die Arbeit nennt 8 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We formulate the Root Extraction problem in finite Abelian $p$-groups and then extend it to generic finite Abelian groups. We provide algorithms to solve them. We also give the bounds on the number of group operations required for these algorithms. We observe that once a basis is computed and the discrete logarithm relative to the basis is solved, root extraction takes relatively fewer"bookkeeping"steps. Thus, we conclude that root extraction in finite Abelian groups is no harder than solving discrete logarithms and computing basis.

Zitieren

APA

Acharjee, U., & Srinath, M. (2024). Root extraction in finite Abelian groups. Journal of Computational Algebra. https://doi.org/10.1016/j.jaca.2024.100017

Vancouver

Acharjee U, Srinath M. Root extraction in finite Abelian groups. Journal of Computational Algebra. 2024. doi:10.1016/j.jaca.2024.100017

BibTeX
@article{Acharjee2024,
  author = {Acharjee, Udvas and Srinath, M.S.},
  title = {Root extraction in finite Abelian groups},
  journal = {Journal of Computational Algebra},
  year = {2024},
  doi = {10.1016/j.jaca.2024.100017}
}
Kostenlos starten →