The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Palash Sarkar: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Wonil Lee, Mridul Nandi, Palash Sarkar, Donghoon Chang, Sangjin Lee, Kouichi Sakurai
    Pseudorandomness of SPN-Type Transformations. [Citation Graph (0, 0)][DBLP]
    ACISP, 2004, pp:212-223 [Conf]
  2. Subhamoy Maitra, Palash Sarkar
    Enumeration of Correlation Immune Boolean Functions. [Citation Graph (0, 0)][DBLP]
    ACISP, 1999, pp:12-25 [Conf]
  3. Palash Sarkar, Pradeep Kumar Mishra, Rana Barua
    New Table Look-Up Methods for Faster Frobenius Map Based Scalar Multiplication Over GF(pn). [Citation Graph (0, 0)][DBLP]
    ACNS, 2004, pp:479-493 [Conf]
  4. Sanjit Chatterjee, Palash Sarkar
    HIBE With Short Public Parameters Without Random Oracle. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2006, pp:145-160 [Conf]
  5. Kishan Chand Gupta, Palash Sarkar
    Improved Construction of Nonlinear Resilient S-Boxes. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2002, pp:466-483 [Conf]
  6. Jin Hong, Palash Sarkar
    New Applications of Time Memory Data Tradeoffs. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2005, pp:353-372 [Conf]
  7. Pradeep Kumar Mishra, Palash Sarkar
    Parallelizing Explicit Formula for Arithmetic in the Jacobian of Hyperelliptic Curves. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2003, pp:93-110 [Conf]
  8. Joydip Mitra, Palash Sarkar
    Time-Memory Trade-Off Attacks on Multiplications and T-Functions. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2004, pp:468-482 [Conf]
  9. Palash Sarkar
    Masking Based Domain Extenders for UOWHFs: Bounds and Constructions. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 2004, pp:187-200 [Conf]
  10. Palash Sarkar, Subhamoy Maitra
    Efficient Implementation of "Large" Stream Cipher Systems. [Citation Graph (0, 0)][DBLP]
    CHES, 2001, pp:319-332 [Conf]
  11. Debrup Chakraborty, Palash Sarkar
    A General Construction of Tweakable Block Ciphers and Different Modes of Operations. [Citation Graph (0, 0)][DBLP]
    Inscrypt, 2006, pp:88-102 [Conf]
  12. Subhamoy Maitra, Palash Sarkar
    Highly Nonlinear Resilient Functions Optimizing Siegenthaler's Inequality. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1999, pp:198-215 [Conf]
  13. Palash Sarkar
    The Filter-Combiner Model for Memoryless Synchronous Stream Ciphers. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2002, pp:533-548 [Conf]
  14. Palash Sarkar, Subhamoy Maitra
    Nonlinearity Bounds and Constructions of Resilient Boolean Functions. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 2000, pp:515-532 [Conf]
  15. Palash Sarkar, Subhamoy Maitra
    Construction of Nonlinear Boolean Functions with Important Cryptographic Properties. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 2000, pp:485-506 [Conf]
  16. Jin Hong, Dong Hoon Lee, Seongtaek Chee, Palash Sarkar
    Vulnerability of Nonlinear Filter Generators Based on Linear Finite State Machines. [Citation Graph (0, 0)][DBLP]
    FSE, 2004, pp:193-209 [Conf]
  17. Pinakpani Pal, Palash Sarkar
    PARSHA-256- - A New Parallelizable Hash Function and a Multithreaded Implementation. [Citation Graph (0, 0)][DBLP]
    FSE, 2003, pp:347-361 [Conf]
  18. Debrup Chakraborty, Palash Sarkar
    A New Mode of Encryption Providing a Tweakable Strong Pseudo-random Permutation. [Citation Graph (0, 0)][DBLP]
    FSE, 2006, pp:293-309 [Conf]
  19. Sourav Mukhopadhyay, Palash Sarkar
    Application of LFSRs for Parallel Sequence Generation in Cryptologic Algorithms. [Citation Graph (0, 0)][DBLP]
    ICCSA (3), 2006, pp:436-445 [Conf]
  20. Ratna Dutta, Rana Barua, Palash Sarkar
    Provably Secure Authenticated Tree Based Group Key Agreement. [Citation Graph (0, 0)][DBLP]
    ICICS, 2004, pp:92-104 [Conf]
  21. Sanjit Chatterjee, Palash Sarkar
    Trading Time for Space: Towards an Efficient IBE Scheme with Short(er) Public Parameters in the Standard Model. [Citation Graph (0, 0)][DBLP]
    ICISC, 2005, pp:424-440 [Conf]
  22. Sanjit Chatterjee, Palash Sarkar
    New Constructions of Constant Size Ciphertext HIBE Without Random Oracle. [Citation Graph (0, 0)][DBLP]
    ICISC, 2006, pp:310-327 [Conf]
  23. Sanjit Chatterjee, Palash Sarkar, Rana Barua
    Efficient Computation of Tate Pairing in Projective Coordinate over General Characteristic Fields. [Citation Graph (0, 0)][DBLP]
    ICISC, 2004, pp:168-181 [Conf]
  24. Palash Sarkar
    Generic Attacks on Symmetric Ciphers. [Citation Graph (0, 0)][DBLP]
    ICISC, 2006, pp:7- [Conf]
  25. Rana Barua, Ratna Dutta, Palash Sarkar
    Extending Joux's Protocol to Multi Party Key Agreement (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    INDOCRYPT, 2003, pp:205-217 [Conf]
  26. Debrup Chakraborty, Palash Sarkar
    HCH: A New Tweakable Enciphering Scheme Using the Hash-Encrypt-Hash Approach. [Citation Graph (0, 0)][DBLP]
    INDOCRYPT, 2006, pp:287-302 [Conf]
  27. Sanjit Chatterjee, Palash Sarkar
    Multi-receiver Identity-Based Key Encapsulation with Shortened Ciphertext. [Citation Graph (0, 0)][DBLP]
    INDOCRYPT, 2006, pp:394-408 [Conf]
  28. Sanjeev Kumar Mishra, Palash Sarkar
    Symmetrically Private Information Retrieval. [Citation Graph (0, 0)][DBLP]
    INDOCRYPT, 2000, pp:225-236 [Conf]
  29. Kishan Chand Gupta, Palash Sarkar
    Construction of Perfect Nonlinear and Maximally Nonlinear Multi-output Boolean Functions Satisfying Higher Order Strict Avalanche Criteria (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    INDOCRYPT, 2003, pp:107-120 [Conf]
  30. Palash Sarkar
    Hiji-bij-bij: A New Stream Cipher with a Self-synchronizing Mode of Operation. [Citation Graph (0, 0)][DBLP]
    INDOCRYPT, 2003, pp:36-51 [Conf]
  31. Palash Sarkar
    HEAD: Hybrid Encryption with Delegated Decryption Capability. [Citation Graph (0, 0)][DBLP]
    INDOCRYPT, 2004, pp:230-244 [Conf]
  32. Palash Sarkar, Paul J. Schellenberg
    A Parallel Algorithm for Extending Cryptographic Hash Functions. [Citation Graph (0, 0)][DBLP]
    INDOCRYPT, 2001, pp:40-49 [Conf]
  33. Palash Sarkar, Douglas R. Stinson
    Frameproof and IPP Codes. [Citation Graph (0, 0)][DBLP]
    INDOCRYPT, 2001, pp:117-126 [Conf]
  34. Pradeep Kumar Mishra, Pinakpani Pal, Palash Sarkar
    Towards Minimizing Memory Requirement for Implementation of Hyperelliptic Curve Cryptosystems. [Citation Graph (0, 0)][DBLP]
    ISPEC, 2007, pp:269-283 [Conf]
  35. Sourav Mukhopadhyay, Palash Sarkar
    On the Effectiveness of TMTO and Exhaustive Search Attacks. [Citation Graph (0, 0)][DBLP]
    IWSEC, 2006, pp:337-352 [Conf]
  36. Sanjit Chatterjee, Palash Sarkar
    Generalization of the Selective-ID Security Model for HIBE Protocols. [Citation Graph (0, 0)][DBLP]
    Public Key Cryptography, 2006, pp:241-256 [Conf]
  37. Pradeep Kumar Mishra, Palash Sarkar
    Application of Montgomery's Trick to Scalar Multiplication for Elliptic and Hyperelliptic Curves Using a Fixed Base Point. [Citation Graph (0, 0)][DBLP]
    Public Key Cryptography, 2004, pp:41-54 [Conf]
  38. Alex Biryukov, Sourav Mukhopadhyay, Palash Sarkar
    Improved Time-Memory Trade-Offs with Multiple Data. [Citation Graph (0, 0)][DBLP]
    Selected Areas in Cryptography, 2005, pp:110-127 [Conf]
  39. Palash Sarkar, Bimal K. Roy, Pabitra Pal Choudhury
    VLSI Implementation of Modulo Multiplication Using Carry Free Addition. [Citation Graph (0, 0)][DBLP]
    VLSI Design, 1997, pp:457-460 [Conf]
  40. Sourav Mukhopadhyay, Palash Sarkar
    Application of LFSRs in Time/Memory Trade-Off Cryptanalysis. [Citation Graph (0, 0)][DBLP]
    WISA, 2005, pp:25-37 [Conf]
  41. Kishan Chand Gupta, Palash Sarkar
    Efficient Representation and Software Implementation of Resilient Maiorana-McFarland S-boxes. [Citation Graph (0, 0)][DBLP]
    WISA, 2004, pp:317-331 [Conf]
  42. Sanjay Burman, Palash Sarkar
    An Efficient Algorithm for Software Generation of Binary Linear Recurrences. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 2004, v:15, n:3-4, pp:201-203 [Journal]
  43. Palash Sarkar
    A brief history of cellular automata. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 2000, v:32, n:1, pp:80-107 [Journal]
  44. Palash Sarkar, Rana Barua
    The Set of Reversible 90/150 Cellular Automata Is Regular. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:84, n:1-3, pp:199-213 [Journal]
  45. Palash Sarkar, Paul J. Schellenberg
    Construction of Symmetric Balanced Squares with Blocksize More than One. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2003, v:30, n:3, pp:235-280 [Journal]
  46. Palash Sarkar
    Pushdown Automaton with the Ability to Flip its Stack [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:, n:081, pp:- [Journal]
  47. Wonil Lee, Mridul Nandi, Palash Sarkar, Donghoon Chang, Sangjin Lee, Kouichi Sakurai
    PGV-Style Block-Cipher-Based Hash Families and Black-Box Analysis. [Citation Graph (0, 0)][DBLP]
    IEICE Transactions, 2005, v:88, n:1, pp:39-48 [Journal]
  48. Kishan Chand Gupta, Palash Sarkar
    Construction of high degree resilient S-boxes with improved nonlinearity. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:95, n:3, pp:413-417 [Journal]
  49. Subhamoy Maitra, Palash Sarkar
    Hamming Weights of Correlation Immune Boolean Functions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:71, n:3-4, pp:149-153 [Journal]
  50. Palash Sarkar
    A note on the spectral characterization of correlation immune Boolean functions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:74, n:5-6, pp:191-195 [Journal]
  51. Palash Sarkar
    Domain Extenders for UOWHF: A Finite Binary Tree Algorithm. [Citation Graph (0, 0)][DBLP]
    J. UCS, 2005, v:11, n:6, pp:1040-1053 [Journal]
  52. Palash Sarkar, Subhamoy Maitra
    Cross-Correlation Analysis of Cryptographically Useful Boolean Functions and S-Boxes. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2002, v:35, n:1, pp:39-57 [Journal]
  53. Palash Sarkar, Subhamoy Maitra
    Efficient Implementation of Cryptographically Useful 'Large' Boolean Functions. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2003, v:52, n:4, pp:410-417 [Journal]
  54. Subhamoy Maitra, Palash Sarkar
    Cryptographically significant Boolean functions with five valued Walsh spectra. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:276, n:1-2, pp:133-146 [Journal]
  55. Palash Sarkar, Rana Barua
    Multidimenstional Sigma-Automata, Pi-Polynomials and Generalised S-Matrices. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:197, n:1-2, pp:111-138 [Journal]
  56. Kishan Chand Gupta, Palash Sarkar
    Construction of Perfect Nonlinear and Maximally Nonlinear Multiple-Output Boolean Functions Satisfying Higher Order Strict Avalanche Criteria. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:11, pp:2886-2893 [Journal]
  57. Kishan Chand Gupta, Palash Sarkar
    Improved construction of nonlinear resilient S-boxes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:339-348 [Journal]
  58. Kishan Chand Gupta, Palash Sarkar
    Toward a General Correlation Theorem. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:9, pp:3297-3302 [Journal]
  59. Subhamoy Maitra, Palash Sarkar
    Modifications of Patterson-Wiedemann functions for cryptographic applications. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:1, pp:278-284 [Journal]
  60. Subhamoy Maitra, Palash Sarkar
    Maximum nonlinearity of symmetric Boolean functions on odd number of variables. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:9, pp:2626-2630 [Journal]
  61. Palash Sarkar, Subhamoy Maitra
    Construction of Nonlinear Resilient Boolean Functions Using "Small" Affine Functions. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:9, pp:2185-2193 [Journal]
  62. Somitra Kumar Sanadhya, Palash Sarkar
    New Local Collisions for the SHA-2 Hash Family. [Citation Graph (0, 0)][DBLP]
    ICISC, 2007, pp:193-205 [Conf]
  63. Palash Sarkar
    Improving Upon the TET Mode of Operation. [Citation Graph (0, 0)][DBLP]
    ICISC, 2007, pp:180-192 [Conf]
  64. S. Mukhopadhyay, P. Sarkar
    Hardware architecture and trade-offs for generic inversion of one-way functions. [Citation Graph (0, 0)][DBLP]
    ISCAS, 2006, pp:- [Conf]
  65. Palash Sarkar, Sanjit Chatterjee
    Construction of a Hybrid HIBE Protocol Secure Against Adaptive Attacks. [Citation Graph (0, 0)][DBLP]
    ProvSec, 2007, pp:51-67 [Conf]
  66. Palash Sarkar
    Construction of universal one-way hash functions: Tree hashing revisited. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:16, pp:2174-2180 [Journal]
  67. Palash Sarkar, Subhamoy Maitra
    Balancedness and correlation immunity of symmetric Boolean functions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:19-20, pp:2351-2358 [Journal]

  68. Non-linear Reduced Round Attacks against SHA-2 Hash Family. [Citation Graph (, )][DBLP]


  69. Attacking Reduced Round SHA-256. [Citation Graph (, )][DBLP]


  70. A new hash family obtained by modifying the SHA-2 family. [Citation Graph (, )][DBLP]


  71. New Collision Attacks against Up to 24-Step SHA-2. [Citation Graph (, )][DBLP]


  72. Deterministic Constructions of 21-Step Collisions for the SHA-2 Hash Family. [Citation Graph (, )][DBLP]


  73. Pairing Computation on Twisted Edwards Form Elliptic Curves. [Citation Graph (, )][DBLP]


  74. 22-Step Collisions for SHA-2 [Citation Graph (, )][DBLP]


  75. Colliding Message Pairs for 23 and 24-step SHA-512 [Citation Graph (, )][DBLP]


  76. Domain extender for collision resistant hash functions: Improving upon Merkle-Damgård iteration. [Citation Graph (, )][DBLP]


Search in 0.702secs, Finished in 0.708secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002