A deterministic algorithm for the discrete logarithm problem in a semigroup
From MaRDI portal
Publication:2154468
DOI10.1515/jmc-2021-0022OpenAlexW3125868707MaRDI QIDQ2154468
Simran Tinani, Joachim Rosenthal
Publication date: 19 July 2022
Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2101.11500
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Arithmetic theory of semigroups (20M13)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A reduction of semigroup DLP to classic DLP
- Quantum computation of discrete logarithms in semigroups
- Probabilistic algorithm for testing primality
- Riemann's hypothesis and tests for primality
- PRIMES is in P
- Survey on SAP and its application in public-key cryptography
- Public key cryptography based on semigroup actions
- Public key exchange using matrices over group rings
- A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields
- CLASSIFICATION OF FINITE CONGRUENCE-SIMPLE SEMIRINGS WITH ZERO
- New directions in cryptography
- An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
- Monte Carlo Methods for Index Computation (mod p)
- Handbook of Elliptic and Hyperelliptic Curve Cryptography
- An Introduction to Mathematical Cryptography
This page was built for publication: A deterministic algorithm for the discrete logarithm problem in a semigroup
