H. Gopalakrishna Gadiyar

2papers

2 Papers

NTFeb 23, 2017

The discrete logarithm problem over prime fields: the safe prime case. The Smart attack, non-canonical lifts and logarithmic derivatives

H. Gopalakrishna Gadiyar, R. Padma

In this brief note we connect the discrete logarithm problem over prime fields in the safe prime case to the logarithmic derivative.

NTAug 25, 2016

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

H. Gopalakrishna Gadiyar, R. Padma

We show that the classical discrete logarithm problem over prime fields can be reduced to that of solving a system of linear modular equations.