Kaushik Nath

According to our database, Kaushik Nath authored at least 10 papers between 2018 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2023

Polynomial Hashing over Prime Order Fields.

Sreyosi Bhattacharyya, Kaushik Nath, Palash Sarkar

IACR Cryptol. ePrint Arch., 2023

2022

Kummer versus Montgomery Face-off over Prime Order Fields.

Kaushik Nath, Palash Sarkar

ACM Trans. Math. Softw., 2022

Efficient 4-Way Vectorizations of the Montgomery Ladder.

Kaushik Nath, Palash Sarkar

IEEE Trans. Computers, 2022

Security and efficiency trade-offs for elliptic curve Diffie-Hellman at the 128-bit and 224-bit security levels.

Kaushik Nath, Palash Sarkar

J. Cryptogr. Eng., 2022

Efficient arithmetic in (pseudo-)mersenne prime order fields.

Kaushik Nath, Palash Sarkar

Adv. Math. Commun., 2022

2020

Efficient elliptic curve Diffie-Hellman computation at the 256-bit security level.

Kaushik Nath, Palash Sarkar

IET Inf. Secur., 2020

Constant Time Montgomery Ladder.

Kaushik Nath, Palash Sarkar

IACR Cryptol. ePrint Arch., 2020

2019

Reduction Modulo 2⁴⁴⁸-2²²⁴-1.

Kaushik Nath, Palash Sarkar

IACR Cryptol. ePrint Arch., 2019

"Nice" Curves.

Kaushik Nath, Palash Sarkar

IACR Cryptol. ePrint Arch., 2019

2018

Efficient Inversion In (Pseudo-)Mersenne Prime Order Fields.

Kaushik Nath, Palash Sarkar

IACR Cryptol. ePrint Arch., 2018