New Complexity Trade-Offs for the (Multiple) Number Field Sieve Algorithm in Non-Prime Fields. - Palash Sarkar 001; Shashank Singh 001 (IACR Cryptol. ePrint Arch., 2015)

Challenges with Assessing the Impact of NFS Advances on the Security of Pairing-based Cryptography. - Alfred Menezes; Palash Sarkar 001; Shashank Singh 001 (IACR Cryptol. ePrint Arch., 2016)

Tower Number Field Sieve Variant of a Recent Polynomial Selection Method. - Palash Sarkar 001; Shashank Singh 001 (IACR Cryptol. ePrint Arch., 2016)

A General Polynomial Selection Method and New Asymptotic Complexities for the Tower Number Field Sieve Algorithm. - Palash Sarkar 001; Shashank Singh 001 (IACR Cryptol. ePrint Arch., 2016)

A Generalisation of the Conjugation Method for Polynomial Selection for the Extended Tower Number Field Sieve Algorithm. - Palash Sarkar 001; Shashank Singh 001 (IACR Cryptol. ePrint Arch., 2016)

Fine Tuning the Function Field Sieve Algorithm for the Medium Prime Case. - Palash Sarkar 001; Shashank Singh 001 (IEEE Trans. Inf. Theory, 2016)

A simple method for obtaining relations among factor basis elements for special hyperelliptic curves. - Palash Sarkar 001; Shashank Singh 001 (Appl. Algebra Eng. Commun. Comput., 2017)

A new method for decomposition in the Jacobian of small genus hyperelliptic curves. - Palash Sarkar 001; Shashank Singh 001 (Des. Codes Cryptogr., 2017)

Cryptanalysis of 2-round KECCAK-384. - Rajendra Kumar 002; Nikhil Mittal; Shashank Singh 001 (IACR Cryptol. ePrint Arch., 2018)

A unified polynomial selection method for the (tower) number field sieve algorithm. - Palash Sarkar 001; Shashank Singh 001 (Adv. Math. Commun., 2019)

On the alpha value of polynomials in the tower number field sieve algorithm. - Aurore Guillevic; Shashank Singh 001 (IACR Cryptol. ePrint Arch., 2019)

New discrete logarithm computation for the medium prime case using the function field sieve. - Madhurima Mukhopadhyay; Palash Sarkar 001; Shashank Singh 001; Emmanuel Thomé (Adv. Math. Commun., 2022)