New discrete logarithm computation for the medium prime case using the function field sieve M Mukhopadhyay, P Sarkar, S Singh, E Thomé Advances in Mathematics of Communications 16 (3), 449-464, 2020 | 7 | 2020 |
Faster initial splitting for small characteristic composite extension degree fields M Mukhopadhyay, P Sarkar Finite Fields and Their Applications 62, 101629, 2020 | 6 | 2020 |
Pseudo-random walk on ideals: practical speed-up in relation collection for class group computation M Mukhopadhyay, P Sarkar Cryptography and Communications, 1-21, 2024 | 3 | 2024 |
Combining Montgomery Multiplication with Tag Tracing for the Pollard Rho Algorithm in Prime Order Fields M Mukhopadhyay, P Sarkar International Conference on Security, Privacy, and Applied Cryptography …, 2022 | 3 | 2022 |
Aspects of Index Calculus Algorithms for Discrete Logarithm and Class Group Computations M Mukhopadhyay | 1 | 2022 |
Experimentally studying path-finding problem between conjugates in supersingular isogeny graphs: Optimizing primes and powers to speed-up cycle finding M Mukhopadhyay Cryptology ePrint Archive, 2025 | | 2025 |
Pseudo-random Walk on Ideals: Practical Speed-Up in Relation Collection for Class Group Computation. PS Madhurima Mukhopadhyay Cyber Security, Cryptology, and Machine Learning. CSCML 2023. 13914, 18-31, 2023 | | 2023 |
Practically optimizing multi-dimensional discrete logarithm calculations: Implementations in subgroups of relevant to electronic voting and cash schemes M Mukhopadhyay Cryptology ePrint Archive, 2023 | | 2023 |