Efficient Inversion In (Pseudo-)Mersenne Prime Order Fields. - Kaushik Nath 001; Palash Sarkar 001 (IACR Cryptol. ePrint Arch., 2018)

"Nice" Curves. - Kaushik Nath 001; Palash Sarkar 001 (IACR Cryptol. ePrint Arch., 2019)

Reduction Modulo 2448-2224-1. - Kaushik Nath 001; Palash Sarkar 001 (IACR Cryptol. ePrint Arch., 2019)

Constant Time Montgomery Ladder. - Kaushik Nath 001; Palash Sarkar 001 (IACR Cryptol. ePrint Arch., 2020)

Efficient elliptic curve Diffie-Hellman computation at the 256-bit security level. - Kaushik Nath 001; Palash Sarkar 001 (IET Inf. Secur., 2020)

Efficient arithmetic in (pseudo-)mersenne prime order fields. - Kaushik Nath 001; Palash Sarkar 001 (Adv. Math. Commun., 2022)

Security and efficiency trade-offs for elliptic curve Diffie-Hellman at the 128-bit and 224-bit security levels. - Kaushik Nath 001; Palash Sarkar 001 (J. Cryptogr. Eng., 2022)

Efficient 4-Way Vectorizations of the Montgomery Ladder. - Kaushik Nath 001; Palash Sarkar 001 (IEEE Trans. Computers, 2022)

Kummer versus Montgomery Face-off over Prime Order Fields. - Kaushik Nath 001; Palash Sarkar 001 (ACM Trans. Math. Softw., 2022)

Polynomial hashing over prime order fields. - Sreyosi Bhattacharyya; Kaushik Nath 001; Palash Sarkar 001 (Adv. Math. Commun., 2025)

An Update to "Polynomial Hashing over Prime Order Fields". - Kaushik Nath 001; Palash Sarkar 001 (IACR Cryptol. ePrint Arch., 2025)

Vectorised Hashing Based on Bernstein-Rabin-Winograd Polynomials over Prime Order Fields. - Kaushik Nath 001; Palash Sarkar 001 (IACR Cryptol. ePrint Arch., 2025)