Cryptology ePrint Archive: Report 2016/836

The Discrete Logarithm Problem over Prime Fields can be transformed to a Linear Multivariable Chinese Remainder Theorem

H. Gopalakrishna Gadiyar and R. Padma

Abstract: The Discrete Logarithm Problem over Prime Fields can be transformed to a Linear Multivariable Chinese Remainder Theorem.

Category / Keywords: public-key cryptography / Discrete logarithm, Hensel lift, Multivaraible Chinese Remainder theorem

Date: received 26 Aug 2016, last revised 3 Sep 2016

Contact author: rpadma at vit ac in

Available format(s): PDF | BibTeX Citation

Version: 20160903:191733 (All versions of this report)

Short URL: ia.cr/2016/836

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]