Welcome to the resource topic for 2012/574
Title:
Quantum algorithm for the discrete logarithm problem for matrices over finite group rings
Authors: A. D. Myasnikov, A. Ushakov
Abstract:We propose a polynomial time quantum algorithm for solving the discrete logarithm problem in matrices over finite group rings. The hardness of this problem was recently employed in the design of a key-exchange protocol proposed by D. Kahrobaei, C. Koupparis, and V. Shpilrain. Our result implies that the Kahrobaei et al. protocol does not belong to the realm of post-quantum cryptography.
ePrint: https://eprint.iacr.org/2012/574
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .