A reduction of semigroup DLP to classic DLP

DOI10.1007/s10623-015-0130-2zbMath1379.94029arXiv1310.7903OpenAlexW2125635884MaRDI QIDQ306053

Matan Banin, Boaz Tsaban

Publication date: 31 August 2016

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1310.7903

zbMATH Keywords

semigroupsquantum algorithmsdiscrete logarithm problem (DLP)

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (5)

A deterministic algorithm for the discrete logarithm problem in a semigroup ⋮ Quantum algorithms for typical hard problems: a perspective of cryptanalysis ⋮ An extension of the noncommutative Bergman's ring with a large number of noninvertible elements ⋮ Cryptanalysis of Some Protocols Using Matrices over Group Rings ⋮ DLP in semigroups: algorithms and lower bounds

Cites Work

• Quantum computation of discrete logarithms in semigroups
• Quantum algorithm for discrete logarithm problem for matrices over finite group rings
• Public key exchange using matrices over group rings
• Elliptic Curve Cryptosystems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A reduction of semigroup DLP to classic DLP