Palash Sarkar

ORCID

Publication Activity (10 Years)

Years Active: 1996-2024
Publications (10 Years): 101

Top Venues

IACR Cryptol. ePrint Arch.

Adv. Math. Commun.

Cryptogr. Commun.

Des. Codes Cryptogr.

Publications

Palash Sarkar
Computing square roots faster than the Tonelli-Shanks/Bernstein algorithm. Adv. Math. Commun. 18 (1) (2024)
Debrup Chakraborty, Sebati Ghosh, Cuauhtemoc Mancillas-López, Palash Sarkar
Fast Low Level Disk Encryption Using FPGAs. IACR Cryptol. ePrint Arch. 2024 (2024)
Claude Carlet, Palash Sarkar
Constructions of Efficiently Implementable Boolean functions Possessing High Nonlinearity and Good Resistance to Algebraic Attacks. IACR Cryptol. ePrint Arch. 2024 (2024)
Subhabrata Samajder, Palash Sarkar
Correlations Between (Nonlinear) Combiners of Input and Output of Random Functions and Permutations. CSCML (2023)
Palash Sarkar, Subhadip Singha
Classical reduction of gap SVP to LWE: A concrete security analysis. Adv. Math. Commun. 17 (2) (2023)
Sreyosi Bhattacharyya, Kaushik Nath, Palash Sarkar
Polynomial Hashing over Prime Order Fields. IACR Cryptol. ePrint Arch. 2023 (2023)
Aniruddha Biswas, Palash Sarkar
Influence of a Set of Variables on a Boolean Function. SIAM J. Discret. Math. 37 (3) (2023)
Sreyosi Bhattacharyya, Palash Sarkar
Concrete Time/Memory Trade-Offs in Generalised Stern's ISD Algorithm. INDOCRYPT (1) (2023)
Satya R. Chakravarty, Palash Sarkar
New perspectives on the Gini and Bonferroni indices of inequality. Soc. Choice Welf. 60 (1) (2023)
Aniruddha Biswas, Palash Sarkar
Counting unate and balanced monotone Boolean functions. CoRR (2023)
Subhabrata Samajder, Palash Sarkar
Another look at key randomisation hypotheses. Des. Codes Cryptogr. 91 (12) (2023)
Madhurima Mukhopadhyay, Palash Sarkar
Pseudo-random Walk on Ideals: Practical Speed-Up in Relation Collection for Class Group Computation. CSCML (2023)
Sreyosi Bhattacharyya, Palash Sarkar
Concrete Time/Memory Trade-Offs in Generalised Stern's ISD Algorithm. IACR Cryptol. ePrint Arch. 2023 (2023)
Aniruddha Biswas, Palash Sarkar
On the "majority is least stable" conjecture. Inf. Process. Lett. 179 (2023)
Sanjay Bhattacherjee, Palash Sarkar
Voting Games to Model Protocol Stability and Security of Proof-of-Work Cryptocurrencies. GameSec (2022)
Aniruddha Biswas, Palash Sarkar
On The "Majority is Least Stable" Conjecture. CoRR (2022)
Subhabrata Samajder, Palash Sarkar
Distinguishing Error of Nonlinear Invariant Attacks. INDOCRYPT (2022)
Kaushik Nath, Palash Sarkar
Security and efficiency trade-offs for elliptic curve Diffie-Hellman at the 128-bit and 224-bit security levels. J. Cryptogr. Eng. 12 (1) (2022)
Madhurima Mukhopadhyay, Palash Sarkar
Combining Montgomery Multiplication with Tag Tracing for the Pollard Rho Algorithm in Prime Order Fields. SPACE (2022)
Aniruddha Biswas, Palash Sarkar
A Lower Bound on the Constant in the Fourier Min-Entropy/Influence Conjecture. Electron. Colloquium Comput. Complex. (2022)
Madhurima Mukhopadhyay, Palash Sarkar, Shashank Singh, Emmanuel Thomé
New discrete logarithm computation for the medium prime case using the function field sieve. Adv. Math. Commun. 16 (3) (2022)
Debrup Chakraborty, Sebati Ghosh, Cuauhtemoc Mancillas López, Palash Sarkar
${\sf {FAST}}$: Disk encryption and beyond. Adv. Math. Commun. 16 (1) (2022)
Neal Koblitz, Subhabrata Samajder, Palash Sarkar, Subhadip Singha
Concrete Analysis of Approximate Ideal-SIVP to Decision Ring-LWE Reduction. IACR Cryptol. ePrint Arch. 2022 (2022)
Aniruddha Biswas, Palash Sarkar
A Lower Bound on the Constant in the Fourier Min-Entropy/Influence Conjecture. CoRR (2022)
Kaushik Nath, Palash Sarkar
Efficient arithmetic in (pseudo-)mersenne prime order fields. Adv. Math. Commun. 16 (2) (2022)
Kaushik Nath, Palash Sarkar
Efficient 4-Way Vectorizations of the Montgomery Ladder. IEEE Trans. Computers 71 (3) (2022)
Aniruddha Biswas, Palash Sarkar
On The "Majority is Least Stable" Conjecture. Electron. Colloquium Comput. Complex. 29 (2022)
Kaushik Nath, Palash Sarkar
Kummer versus Montgomery Face-off over Prime Order Fields. ACM Trans. Math. Softw. 48 (2) (2022)
Kaushik Nath, Palash Sarkar
Kummer versus Montgomery Face-off over Prime Order Fields. IACR Cryptol. ePrint Arch. 2021 (2021)
Madhurima Mukhopadhyay, Palash Sarkar
Pseudo-Random Walk on Ideals: Practical Speed-Up in Relation Collection for Class Group Computation. IACR Cryptol. ePrint Arch. 2021 (2021)
Sebati Ghosh, Palash Sarkar
Breaking tweakable enciphering schemes using Simon's algorithm. Des. Codes Cryptogr. 89 (8) (2021)
Palash Sarkar, Subhadip Singha
Verifying solutions to LWE with implications for concrete security. Adv. Math. Commun. 15 (2) (2021)
Aniruddha Biswas, Palash Sarkar
Separation results for boolean function classes. Cryptogr. Commun. 13 (3) (2021)
Sanjay Bhattacherjee, Palash Sarkar
Weighted voting procedure having a unique blocker. Int. J. Game Theory 50 (1) (2021)
Aniruddha Biswas, Palash Sarkar
Influence of a Set of Variables on a Boolean Function. CoRR (2021)
Madhurima Mukhopadhyay, Palash Sarkar
Combining Montgomery Multiplication with Tag Tracing for the Pollard's Rho Algorithm in Prime Order Fields. IACR Cryptol. ePrint Arch. 2021 (2021)
Aniruddha Biswas, Palash Sarkar
Influence of a Set of Variables on a Boolean Function. Electron. Colloquium Comput. Complex. 28 (2021)
Aniruddha Biswas, Palash Sarkar
Influence of a Set of Variables on a Boolean Function. IACR Cryptol. ePrint Arch. 2021 (2021)
Sebati Ghosh, Palash Sarkar
Variants of Wegman-Carter message authentication code supporting variable tag lengths. Des. Codes Cryptogr. 89 (4) (2021)
Kaushik Nath, Palash Sarkar
Efficient elliptic curve Diffie-Hellman computation at the 256-bit security level. IET Inf. Secur. 14 (6) (2020)
Sabyasachi Karati, Palash Sarkar
Kummer for Genus One Over Prime-Order Fields. J. Cryptol. 33 (1) (2020)
Madhurima Mukhopadhyay, Palash Sarkar, Shashank Singh, Emmanuel Thomé
New Discrete Logarithm Computation for the Medium Prime Case Using the Function Field Sieve. IACR Cryptol. ePrint Arch. 2020 (2020)
Madhurima Mukhopadhyay, Palash Sarkar
Faster initial splitting for small characteristic composite extension degree fields. Finite Fields Their Appl. 62 (2020)
Palash Sarkar
Computing Square Roots Faster than the Tonelli-Shanks/Bernstein Algorithm. IACR Cryptol. ePrint Arch. 2020 (2020)
Sreyosi Bhattacharyya, Palash Sarkar
Improved SIMD implementation of Poly1305. IET Inf. Secur. 14 (5) (2020)
Palash Sarkar, Subhadip Singha
Classical Reduction of SVP to LWE: A Concrete Security Analysis. IACR Cryptol. ePrint Arch. 2020 (2020)
Aniruddha Biswas, Palash Sarkar
Separation Results for Boolean Function Classes. CoRR (2020)
Kaushik Nath, Palash Sarkar
Constant Time Montgomery Ladder. IACR Cryptol. ePrint Arch. 2020 (2020)
Aniruddha Biswas, Palash Sarkar
Separation Results for Boolean Function Classes. IACR Cryptol. ePrint Arch. 2020 (2020)
Kaushik Nath, Palash Sarkar
Efficient 4-way Vectorizations of the Montgomery Ladder. IACR Cryptol. ePrint Arch. 2020 (2020)
Kaushik Nath, Palash Sarkar
-1. IACR Cryptol. ePrint Arch. 2019 (2019)
Sabyasachi Karati, Palash Sarkar
Connecting Legendre with Kummer and Edwards. Adv. Math. Commun. 13 (1) (2019)
Sebati Ghosh, Palash Sarkar
Variable Tag Length Message Authentication Code Schemes. IACR Cryptol. ePrint Arch. 2019 (2019)
Subhabrata Samajder, Palash Sarkar
Another look at success probability of linear cryptanalysis. Adv. Math. Commun. 13 (4) (2019)
Sebati Ghosh, Palash Sarkar
Evaluating Bernstein-Rabin-Winograd polynomials. Des. Codes Cryptogr. 87 (2-3) (2019)
Palash Sarkar, Subhadip Singha
Verifying Solutions to LWE with Implications for Concrete Security. IACR Cryptol. ePrint Arch. 2019 (2019)
Kaushik Nath, Palash Sarkar
"Nice" Curves. IACR Cryptol. ePrint Arch. 2019 (2019)
Sreyosi Bhattacharyya, Palash Sarkar
Improved SIMD Implementation of Poly1305. IACR Cryptol. ePrint Arch. 2019 (2019)
Palash Sarkar, Shashank Singh
A unified polynomial selection method for the (tower) number field sieve algorithm. Adv. Math. Commun. 13 (3) (2019)
Madhurima Mukhopadhyay, Palash Sarkar
Faster Initial Splitting for Small Characteristic Composite Extension Degree Fields. IACR Cryptol. ePrint Arch. 2019 (2019)
Sebati Ghosh, Palash Sarkar
Breaking Tweakable Enciphering Schemes using Simon's Algorithm. IACR Cryptol. ePrint Arch. 2019 (2019)
Subhabrata Samajder, Palash Sarkar
Another Look at Key Randomisation Hypotheses. IACR Cryptol. ePrint Arch. 2019 (2019)
Palash Sarkar
Multi-Stage Proof-of-Work Blockchain. IACR Cryptol. ePrint Arch. 2019 (2019)
Kaushik Nath, Palash Sarkar
Efficient Elliptic Curve Diffie-Hellman Computation at the 256-bit Security Level. IACR Cryptol. ePrint Arch. 2019 (2019)
Subhabrata Samajder, Palash Sarkar
Multiple (Truncated) Differential Cryptanalysis: Explicit Upper Bounds on Data Complexity. Cryptogr. Commun. 10 (6) (2018)
Subhabrata Samajder, Palash Sarkar
Success probability of multiple/multidimensional linear cryptanalysis under general key randomisation hypotheses. Cryptogr. Commun. 10 (5) (2018)
Kaushik Nath, Palash Sarkar
Efficient Inversion In (Pseudo-)Mersenne Prime Order Fields. IACR Cryptol. ePrint Arch. 2018 (2018)
Debrup Chakraborty, Cuauhtemoc Mancillas López, Palash Sarkar
Disk encryption: do we need to preserve length? J. Cryptogr. Eng. 8 (1) (2018)
Subhabrata Samajder, Palash Sarkar
Distinguishing Error of Nonlinear Invariant Attacks. IACR Cryptol. ePrint Arch. 2018 (2018)
Subhabrata Samajder, Palash Sarkar
Correlations Between (Nonlinear) Combiners of Input and Output of Random Functions and Permutations. IACR Cryptol. ePrint Arch. 2017 (2017)
Sanjay Bhattacherjee, Palash Sarkar
Cryptocurrency Voting Games. IACR Cryptol. ePrint Arch. 2017 (2017)
Subhabrata Samajder, Palash Sarkar
Another Look at Success Probability in Linear Cryptanalysis. IACR Cryptol. ePrint Arch. 2017 (2017)
Subhabrata Samajder, Palash Sarkar
Rigorous upper bounds on data complexities of block cipher cryptanalysis. J. Math. Cryptol. 11 (3) (2017)
Sabyasachi Karati, Palash Sarkar
Connecting Legendre with Kummer and Edwards. IACR Cryptol. ePrint Arch. 2017 (2017)
Debrup Chakraborty, Sebati Ghosh, Palash Sarkar
Evaluating Bernstein-Rabin-Winograd Polynomials. IACR Cryptol. ePrint Arch. 2017 (2017)
Debrup Chakraborty, Sebati Ghosh, Palash Sarkar
A Fast Single-Key Two-Level Universal Hash Function. IACR Trans. Symmetric Cryptol. 2017 (1) (2017)
Palash Sarkar, Shashank Singh
A new method for decomposition in the Jacobian of small genus hyperelliptic curves. Des. Codes Cryptogr. 82 (3) (2017)
Subhabrata Samajder, Palash Sarkar
Success Probability of Multiple/Multidimensional Linear Cryptanalysis Under General Key Randomisation Hypotheses. IACR Cryptol. ePrint Arch. 2017 (2017)
Palash Sarkar, Shashank Singh
A simple method for obtaining relations among factor basis elements for special hyperelliptic curves. Appl. Algebra Eng. Commun. Comput. 28 (2) (2017)
Debrup Chakraborty, Sebati Ghosh, Cuauhtemoc Mancillas López, Palash Sarkar
FAST: Disk Encryption and Beyond. IACR Cryptol. ePrint Arch. 2017 (2017)
Sabyasachi Karati, Palash Sarkar
Kummer for Genus One over Prime Order Fields. ASIACRYPT (2) (2017)
Subhabrata Samajder, Palash Sarkar
A New Test Statistic for Key Recovery Attacks Using Multiple Linear Approximations. Mycrypt (2016)
Sanjit Chatterjee, Neal Koblitz, Alfred Menezes, Palash Sarkar
Another Look at Tightness II: Practical Issues in Cryptography. IACR Cryptol. ePrint Arch. 2016 (2016)
Palash Sarkar, Shashank Singh
A General Polynomial Selection Method and New Asymptotic Complexities for the Tower Number Field Sieve Algorithm. ASIACRYPT (1) (2016)
Palash Sarkar, Shashank Singh
New Complexity Trade-Offs for the (Multiple) Number Field Sieve Algorithm in Non-Prime Fields. EUROCRYPT (1) (2016)
Sanjay Bhattacherjee, Palash Sarkar
Reducing Communication Overhead of the Subset Difference Scheme. IEEE Trans. Computers 65 (8) (2016)
Debrup Chakraborty, Sebati Ghosh, Palash Sarkar
A Fast Single-Key Two-Level Universal Hash Function. IACR Cryptol. ePrint Arch. 2016 (2016)
Subhabrata Samajder, Palash Sarkar
Another look at normal approximations in cryptanalysis. J. Math. Cryptol. 10 (2) (2016)
Debrup Chakraborty, Palash Sarkar
On modes of operations of a block cipher for authentication and authenticated encryption. Cryptogr. Commun. 8 (4) (2016)
Palash Sarkar, Shashank Singh
A Generalisation of the Conjugation Method for Polynomial Selection for the Extended Tower Number Field Sieve Algorithm. IACR Cryptol. ePrint Arch. 2016 (2016)
Subhabrata Samajder, Palash Sarkar
Multiple Differential Cryptanalysis: A Rigorous Analysis. IACR Cryptol. ePrint Arch. 2016 (2016)
Subhabrata Samajder, Palash Sarkar
A New Test Statistic for Key Recovery Attacks Using Multiple Linear Approximations. IACR Cryptol. ePrint Arch. 2016 (2016)
Alfred Menezes, Palash Sarkar, Shashank Singh
Challenges with Assessing the Impact of NFS Advances on the Security of Pairing-Based Cryptography. Mycrypt (2016)
Palash Sarkar, Shashank Singh
Fine Tuning the Function Field Sieve Algorithm for the Medium Prime Case. IEEE Trans. Inf. Theory 62 (4) (2016)
Subhabrata Samajder, Palash Sarkar
Can Large Deviation Theory be Used for Estimating Data Complexity? IACR Cryptol. ePrint Arch. 2016 (2016)
Sabyasachi Karati, Palash Sarkar
Kummer for Genus One over Prime Order Fields. IACR Cryptol. ePrint Arch. 2016 (2016)
Somindu C. Ramanna, Palash Sarkar
Efficient Adaptively Secure IBBE From the SXDH Assumption. IEEE Trans. Inf. Theory 62 (10) (2016)
Palash Sarkar, Shashank Singh
Tower Number Field Sieve Variant of a Recent Polynomial Selection Method. IACR Cryptol. ePrint Arch. 2016 (2016)
Sanjit Chatterjee, Neal Koblitz, Alfred Menezes, Palash Sarkar
Another Look at Tightness II: Practical Issues in Cryptography. Mycrypt (2016)
Alfred Menezes, Palash Sarkar, Shashank Singh
Challenges with Assessing the Impact of NFS Advances on the Security of Pairing-based Cryptography. IACR Cryptol. ePrint Arch. 2016 (2016)

Palash Sarkar.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Palash Sarkar