| Efficient 4-way vectorizations of the Montgomery ladder K Nath, P Sarkar IEEE Transactions on Computers 71 (3), 712-723, 2021 | 23 | 2021 |
| Efficient arithmetic in (pseudo-) Mersenne prime order fields K Nath, P Sarkar Cryptology ePrint Archive, 2018 | 18 | 2018 |
| Security and efficiency trade-offs for elliptic curve Diffie–Hellman at the 128-bit and 224-bit security levels K Nath, P Sarkar Journal of Cryptographic Engineering 12 (1), 107-121, 2022 | 8 | 2022 |
| Reduction Modulo 2^{448}-2^{224}-1 K Nath, P Sarkar Mathematical Cryptology, 8-21, 2020 | 6 | 2020 |
| Constant time Montgomery ladder K Nath, P Sarkar Cryptology ePrint Archive, 2020 | 5 | 2020 |
| Kummer versus montgomery face-off over prime order fields K Nath, P Sarkar ACM Transactions on Mathematical Software (TOMS) 48 (2), 1-28, 2022 | 3 | 2022 |
| Efficient elliptic curve Diffie‐Hellman computation at the 256‐bit security level K Nath, P Sarkar IET Information Security 14 (6), 633-640, 2020 | 3 | 2020 |
| Efficient Inversion In (Pseudo-) Mersenne Prime Order Fields. K Nath, P Sarkar IACR Cryptol. ePrint Arch. 2018, 985, 2018 | 3 | 2018 |
| Polynomial hashing over prime order fields S Bhattacharyya, K Nath, P Sarkar Cryptology ePrint Archive, 2023 | 2 | 2023 |
| Secure and Efficient Computation of the Diffie-Hellman Protocol using Montgomery Curves over Prime Order Fields K Nath Indian Statistical Institute, Kolkata, 2021 | | 2021 |
Palash SarkarProfessor, Indian Statistical InstituteZweryfikowany adres z isical.ac.in