( en | de | ru )

 

Disambiguation of "Sarkar, Palash"

Author of the publication

copydeleteadd this publication to your clipboard
Domain Extenders for UOWHF: A Finite Binary Tree Algorithm.

. IACR Cryptology ePrint Archive, (2003)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Anindita Sarkar

Abhijit Sarkar

Tapabrato Sarkar

Abhishek Sarkar

Abhijit Sarkar

 

Other publications of authors with the same name

Breaking Tweakable Enciphering Schemes using Simon's Algorithm., and . IACR Cryptology ePrint Archive, (2019)Faster initial splitting for small characteristic composite extension degree fields., and . Finite Fields Their Appl., (2020)A New Test Statistic for Key Recovery Attacks Using Multiple Linear Approximations., and . Mycrypt, volume 10311 of Lecture Notes in Computer Science, page 277-293. Springer, (2016)Efficient (Anonymous) Compact HIBE from Standard Assumptions., and . ProvSec, volume 8782 of Lecture Notes in Computer Science, page 243-258. Springer, (2014)Improved Time-Memory Trade-Offs with Multiple Data., , and . Selected Areas in Cryptography, volume 3897 of Lecture Notes in Computer Science, page 110-127. Springer, (2005)PARSHA-256- - A New Parallelizable Hash Function and a Multithreaded Implementation., and . FSE, volume 2887 of Lecture Notes in Computer Science, page 347-361. Springer, (2003)Construction of Perfect Nonlinear and Maximally Nonlinear Multi-output Boolean Functions Satisfying Higher Order Strict Avalanche Criteria (Extended Abstract)., and . INDOCRYPT, volume 2904 of Lecture Notes in Computer Science, page 107-120. Springer, (2003)Multi-receiver Identity-Based Key Encapsulation with Shortened Ciphertext., and . INDOCRYPT, volume 4329 of Lecture Notes in Computer Science, page 394-408. Springer, (2006)Masking Based Domain Extenders for UOWHFs: Bounds and Constructions.. ASIACRYPT, volume 3329 of Lecture Notes in Computer Science, page 187-200. Springer, (2004)A new multi-linear universal hash family.. Des. Codes Cryptogr., 69 (3): 351-367 (2013)