Entropy and Hadamard matrices. - H. Gopalkrishna Gadiyar; K. M. Sangeeta Maini; R. Padma; H. S. Sharatchandra (ITW, 2002)

Cryptography, Connections, Cocycles and Crystals: A p-Adic Exploration of the Discrete Logarithm Problem. - H. Gopalkrishna Gadiyar; K. M. Sangeeta Maini; R. Padma (INDOCRYPT, 2004)

What is the Inverse of Repeated Square and Multiply Algorithm? - H. Gopalkrishna Gadiyar; K. M. Sangeeta Maini; R. Padma; Mario Romsy (CoRR, 2006)

Hamming's Original Paper Rewritten in Symbolic Form: A Preamble to Coding Theory. - H. Gopalkrishna Gadiyar; R. Padma (CoRR, 2014)

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)

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)