H. Gopalkrishna Gadiyar

According to our database, H. Gopalkrishna Gadiyar authored at least 6 papers between 2002 and 2017.

Collaborative distances:

• Dijkstra number of seven.
• Erdős number of seven.

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

IACR Cryptol. ePrint Arch., 2017

2016

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

H. Gopalakrishna Gadiyar, R. Padma

IACR Cryptol. ePrint Arch., 2016

2014

Hamming's Original Paper Rewritten in Symbolic Form: A Preamble to Coding Theory.

H. Gopalkrishna Gadiyar, R. Padma

CoRR, 2014

2006

What is the Inverse of Repeated Square and Multiply Algorithm?

H. Gopalkrishna Gadiyar, K. M. Sangeeta Maini, R. Padma, Mario Romsy

CoRR, 2006

2004

Cryptography, Connections, Cocycles and Crystals: A p-Adic Exploration of the Discrete Logarithm Problem.

H. Gopalkrishna Gadiyar, K. M. Sangeeta Maini, R. Padma

Proceedings of the Progress in Cryptology, 2004

2002

Entropy and Hadamard matrices.

H. Gopalkrishna Gadiyar, K. M. Sangeeta Maini, R. Padma, H. S. Sharatchandra

Proceedings of the 2002 IEEE Information Theory Workshop, 2002