Paper 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.
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Preprint. MINOR revision.
- Keywords
- Discrete logarithmHensel liftMultivaraible Chinese Remainder theorem
- Contact author(s)
- rpadma @ vit ac in
- History
- 2016-09-03: received
- Short URL
- https://ia.cr/2016/836
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2016/836,
author = {H. Gopalakrishna Gadiyar and R. Padma},
title = {The Discrete Logarithm Problem over Prime Fields can be transformed to a Linear Multivariable Chinese Remainder Theorem},
howpublished = {Cryptology {ePrint} Archive, Paper 2016/836},
year = {2016},
url = {https://eprint.iacr.org/2016/836}
}
