The Discrete Logarithm Problem over Prime Fields can be transformed to a Linear Multivariable Chinese Remainder Theorem
H. Gopalakrishna Gadiyar, R. Padma
·
2016-08-25
·
via cs.CR updates on arXiv.org
We show that the classical discrete logarithm problem over prime fields can be reduced to that of solving a system of linear modular equations.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。