DLP in semigroups: algorithms and lower bounds

DOI10.1515/jmc-2021-0049OpenAlexW4312979216MaRDI QIDQ2099245

Jiao Han, Jincheng Zhuang

Publication date: 23 November 2022

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

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

zbMATH Keywords

semigroupsdiscrete logarithm problemcycle lengthlower boundstorsion elements

Mathematics Subject Classification ID

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

Cites Work

• A reduction of semigroup DLP to classic DLP
• Quantum computation of discrete logarithms in semigroups
• 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
• Public Key Exchange Using Semidirect Product of (Semi)Groups
• Generic Hardness of the Multiple Discrete Logarithm Problem
• New directions in cryptography
• Monte Carlo Methods for Index Computation (mod p)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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