9 citations · 20 across the 20 of their papers we have counts for
20 papers
A heuristic derivation of linear recurrence relations for and
H. Gopalakrishna Gadiyar, R. Padma
We have gone back to old methods found in the historical part of Hardy's Divergent Series well before the invention of the modern analytic continuation to use formal manipulation o…
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.
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.
Algorithmic construction of Shimura - Taniyama - Weil parametrization of elliptic curves over the rationals
H. Gopalakrishna Gadiyar, R. Padma
In this note we give an algorithm to explicitly construct the modular parametrization of an elliptic curve over the rationals given the Weierstrass function .
Hamming's Original Paper Rewritten in Symbolic Form: A Preamble to Coding Theory
H. Gopalakrishna Gadiyar, R. Padma
In this note we try to bring out the ideas of Hamming's classic paper on coding theory in a form understandable by undergraduate students of mathematics.
Hurwitz - Bernoulli Numbers, Formal Groups and the L - Functions of Elliptic Curves
H. Gopalakrishna Gadiyar, R. Padma
Classically, Euler developed the theory of the Riemann zeta - function using as his starting point the exponential and partial fraction forms of cot(z) . In this paper we wish to d…