DLP in semigroups: algorithms and lower bounds

DOI10.1515/JMC-2021-0049MaRDI QIDQ2099245zbMATH OpenOpenAlexFDO

Authors Jiao Han, Jincheng Zhuang

Publication date 23 November 2022

Published in Journal of Mathematical Cryptology (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1515/jmc-2021-0049

zbMATH Keywords

lower boundsdiscrete logarithm problemsemigroupscycle lengthtorsion elements

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• A reduction of semigroup DLP to classic DLP
• Improved lower bounds for the complexity of finite semigroups
• A deterministic algorithm for the discrete logarithm problem in a semigroup
• Algorithmic problems in varieties of semigroups
• scientific article; zbMATH DE number 4051899
• scientific article; zbMATH DE number 1303114
• scientific article; zbMATH DE number 4189228
• Algorithms for computing finite semigroups
• Sublinear time algorithms in the theory of groups and semigroups.

Cites work

• scientific article; zbMATH DE number 1178976 (Why is no real title available?)
• scientific article; zbMATH DE number 2085207 (Why is no real title available?)
• scientific article; zbMATH DE number 2114217 (Why is no real title available?)
• scientific article; zbMATH DE number 3353398 (Why is no real title available?)
• scientific article; zbMATH DE number 2230905 (Why is no real title available?)
• A reduction of semigroup DLP to classic DLP
• Generic Hardness of the Multiple Discrete Logarithm Problem
• Monte Carlo Methods for Index Computation (mod p)
• New directions in cryptography
• Public key cryptography based on semigroup actions
• Public key exchange using matrices over group rings
• Public key exchange using semidirect product of (semi)groups
• Quantum computation of discrete logarithms in semigroups
• Survey on SAP and its application in public-key cryptography

Cited in

(7)

• A deterministic algorithm for the discrete logarithm problem in a semigroup
• Survey on SAP and its application in public-key cryptography
• A reduction of semigroup DLP to classic DLP
• Reduction of the semigroup-action problem on a module to the hidden-subgroup problem
• SPDH-Sign: Towards Efficient, Post-quantum Group-Based Signatures
• Tighter bound for generalized multiple discrete logarithm problem via MDS matrix method
• On the security of DLCSP over \(\mathrm{GL}_n (\mathbb{F}_q [S_r])\)

This page was built for publication: DLP in semigroups: algorithms and lower bounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2099245)