| 2013 | ||
|---|---|---|
| j45 | Sanjay Bhattacherjee, Palash Sarkar: Complete tree subset difference broadcast encryption scheme and its analysis. Des. Codes Cryptography 66(1-3): 335-362 (2013) | |
| j44 | Sanjit Chatterjee, Palash Sarkar: Practical hybrid (hierarchical) identity-based encryption schemes based on the decisional bilinear Diffie-Hellman assumption. IJACT 3(1): 47-83 (2013) | |
| j43 | Debrup Chakraborty, Cuauhtemoc Mancillas-López, Francisco Rodríguez-Henríquez, Palash Sarkar: Efficient Hardware Implementations of BRW Polynomials and Tweakable Enciphering Schemes. IEEE Trans. Computers 62(2): 279-294 (2013) | |
| i61 | Somindu C. Ramanna, Palash Sarkar: Functional Encryption Supporting Recursive Languages. IACR Cryptology ePrint Archive 2013: 90 (2013) | |
| 2012 | ||
| j42 | Subhamoy Maitra, Palash Sarkar: Guest editorial. Cryptography and Communications 4(3-4): 145-146 (2012) | |
| c53 | Somindu C. Ramanna, Sanjit Chatterjee, Palash Sarkar: Variants of Waters' Dual System Primitives Using Asymmetric Pairings - (Extended Abstract). Public Key Cryptography 2012: 298-315 | |
| i60 | Somindu C. Ramanna, Sanjit Chatterjee, Palash Sarkar: Variants of Waters' Dual-System Primitives Using Asymmetric Pairings. IACR Cryptology ePrint Archive 2012: 24 (2012) | |
| i59 | Somindu C. Ramanna, Palash Sarkar: Constant-Size Ciphertext HIBE From Asymmetric Pairings Using the Dual-System Technique. IACR Cryptology ePrint Archive 2012: 57 (2012) | |
| i58 | Sanjay Bhattacherjee, Palash Sarkar: Analysis and Trade-Offs for the (Complete Tree) Layered Subset Difference Broadcast Encryption Scheme. IACR Cryptology ePrint Archive 2012: 337 (2012) | |
| 2011 | ||
| j41 | Palash Sarkar: A trade-off between collision probability and key size in universal hashing using polynomials. Des. Codes Cryptography 58(3): 271-278 (2011) | |
| j40 | Palash Sarkar: Tweakable enciphering schemes using only the encryption function of a block cipher. Inf. Process. Lett. 111(19): 945-955 (2011) | |
| j39 | Somindu C. Ramanna, Palash Sarkar: On Quantifying the Resistance of Concrete Hash Functions to Generic Multicollision Attacks. IEEE Transactions on Information Theory 57(7): 4798-4816 (2011) | |
| c52 | Sanjit Chatterjee, Alfred Menezes, Palash Sarkar: Another Look at Tightness. Selected Areas in Cryptography 2011: 293-319 | |
| i57 | Debrup Chakraborty, Cuauhtemoc Mancillas-López, Francisco Rodríguez-Henríquez, Palash Sarkar: Efficient Hardware Implementations of BRW Polynomials and Tweakable Enciphering Schemes. IACR Cryptology ePrint Archive 2011: 161 (2011) | |
| i56 | Palash Sarkar: On Authenticated Encryption Using Stream Ciphers Supporting an Initialisation Vector. IACR Cryptology ePrint Archive 2011: 299 (2011) | |
| i55 | Sanjit Chatterjee, Alfred Menezes, Palash Sarkar: Another Look at Tightness. IACR Cryptology ePrint Archive 2011: 442 (2011) | |
| i54 | Sanjay Bhattacherjee, Palash Sarkar: Complete Tree Subset Difference Broadcast Encryption Scheme and its Analysis. IACR Cryptology ePrint Archive 2011: 480 (2011) | |
| 2010 | ||
| j38 | Palash Sarkar: A Simple and Generic Construction of Authenticated Encryption with Associated Data. ACM Trans. Inf. Syst. Secur. 13(4): 33 (2010) | |
| j37 | Palash Sarkar: Pseudo-random functions and parallelizable modes of operations of a block cipher. IEEE Transactions on Information Theory 56(8): 4025-4037 (2010) | |
| 2009 | ||
| j36 | Somitra Kumar Sanadhya, Palash Sarkar: A combinatorial analysis of recent attacks on step reduced SHA-2 family. Cryptography and Communications 1(2): 135-173 (2009) | |
| j35 | Sourav Mukhopadhyay, Palash Sarkar: Hardware Architecture and Cost/time/data Trade-off for Generic Inversion of One-Way Function. Computación y Sistemas 12(3) (2009) | |
| j34 | Palash Sarkar: Domain extender for collision resistant hash functions: Improving upon Merkle-Damgård iteration. Discrete Applied Mathematics 157(5): 1086-1097 (2009) | |
| j33 | Rana Barua, Satya R. Chakravarty, Palash Sarkar: Minimal-axiom characterizations of the Coleman and Banzhaf indices of voting power. Mathematical Social Sciences 58(3): 367-375 (2009) | |
| j32 | Kishan Chand Gupta, Palash Sarkar: Computing Partial Walsh Transform From the Algebraic Normal Form of a Boolean Function. IEEE Transactions on Information Theory 55(3): 1354-1359 (2009) | |
| j31 | Palash Sarkar: Efficient tweakable enciphering schemes from (block-wise) universal hash functions. IEEE Transactions on Information Theory 55(10): 4749-4760 (2009) | |
| c51 | Somitra Kumar Sanadhya, Palash Sarkar: A new hash family obtained by modifying the SHA-2 family. ASIACCS 2009: 353-363 | |
| i53 | Palash Sarkar: On Stateless Schemes for Message Authentication Using Pseudorandom Functions. IACR Cryptology ePrint Archive 2009: 4 (2009) | |
| i52 | Palash Sarkar: On Approximating Addition by Exclusive OR. IACR Cryptology ePrint Archive 2009: 47 (2009) | |
| i51 | Palash Sarkar: A Trade-Off Between Collision Probability and Key Size in Universal Hashing Using Polynomials. IACR Cryptology ePrint Archive 2009: 48 (2009) | |
| i50 | Palash Sarkar: A Simple and Generic Construction of Authenticated Encryption With Associated Data. IACR Cryptology ePrint Archive 2009: 215 (2009) | |
| i49 | Palash Sarkar: Tweakable Enciphering Schemes Using Only the Encryption Function of a Block Cipher. IACR Cryptology ePrint Archive 2009: 216 (2009) | |
| i48 | Palash Sarkar: Pseudo-Random Functions and Parallelizable Modes of Operations of a Block Cipher. IACR Cryptology ePrint Archive 2009: 217 (2009) | |
| i47 | Palash Sarkar: Tweakable Enciphering Schemes From Stream Ciphers With IV. IACR Cryptology ePrint Archive 2009: 321 (2009) | |
| i46 | Somindu C. Ramanna, Palash Sarkar: On Quantifying the Resistance of Concrete Hash Functions to Generic Multi-Collision Attacks. IACR Cryptology ePrint Archive 2009: 525 (2009) | |
| 2008 | ||
| j30 | Palash Sarkar: A general mixing strategy for the ECB-Mix-ECB mode of operation. Inf. Process. Lett. 109(2): 121-123 (2008) | |
| j29 | Debrup Chakraborty, Palash Sarkar: HCH: A New Tweakable Enciphering Scheme Using the Hash-Counter-Hash Approach. IEEE Transactions on Information Theory 54(4): 1683-1699 (2008) | |
| j28 | Debrup Chakraborty, Palash Sarkar: A General Construction of Tweakable Block Ciphers and Different Modes of Operations. IEEE Transactions on Information Theory 54(5): 1991-2006 (2008) | |
| c50 | Somitra Kumar Sanadhya, Palash Sarkar: Non-linear Reduced Round Attacks against SHA-2 Hash Family. ACISP 2008: 254-266 | |
| c49 | ||
| c48 | Somitra Kumar Sanadhya, Palash Sarkar: New Collision Attacks against Up to 24-Step SHA-2. INDOCRYPT 2008: 91-103 | |
| c47 | Somitra Kumar Sanadhya, Palash Sarkar: Deterministic Constructions of 21-Step Collisions for the SHA-2 Hash Family. ISC 2008: 244-259 | |
| c46 | M. Prem Laxman Das, Palash Sarkar: Pairing Computation on Twisted Edwards Form Elliptic Curves. Pairing 2008: 192-210 | |
| i45 | ||
| i44 | Somitra Kumar Sanadhya, Palash Sarkar: Colliding Message Pairs for 23 and 24-step SHA-512. CoRR abs/0809.0216 (2008) | |
| i43 | Palash Sarkar: Efficient Tweakable Enciphering Schemes from (Block-Wise) Universal Hash Functions. IACR Cryptology ePrint Archive 2008: 4 (2008) | |
| i42 | Somitra Kumar Sanadhya, Palash Sarkar: Attacking Reduced Round SHA-256. IACR Cryptology ePrint Archive 2008: 142 (2008) | |
| i41 | Somitra Kumar Sanadhya, Palash Sarkar: Non-Linear Reduced Round Attacks Against SHA-2 Hash family. IACR Cryptology ePrint Archive 2008: 174 (2008) | |
| i40 | Palash Sarkar: A New Multi-Linear Universal Hash Family. IACR Cryptology ePrint Archive 2008: 216 (2008) | |
| i39 | Somitra Kumar Sanadhya, Palash Sarkar: Searching for Low Weight Codewords in Linear Binary Codes. IACR Cryptology ePrint Archive 2008: 269 (2008) | |
| i38 | Somitra Kumar Sanadhya, Palash Sarkar: New Collision attacks Against Up To 24-step SHA-2. IACR Cryptology ePrint Archive 2008: 270 (2008) | |
| i37 | Somitra Kumar Sanadhya, Palash Sarkar: A Combinatorial Analysis of Recent Attacks on Step Reduced SHA-2 Family. IACR Cryptology ePrint Archive 2008: 271 (2008) | |
| i36 | Somitra Kumar Sanadhya, Palash Sarkar: A New Hash Family Obtained by Modifying the SHA-2 Family. IACR Cryptology ePrint Archive 2008: 272 (2008) | |
| 2007 | ||
| j27 | Palash Sarkar: Construction of universal one-way hash functions: Tree hashing revisited. Discrete Applied Mathematics 155(16): 2174-2180 (2007) | |
| j26 | Palash Sarkar, Subhamoy Maitra: Balancedness and correlation immunity of symmetric Boolean functions. Discrete Mathematics 307(19-20): 2351-2358 (2007) | |
| j25 | Sanjit Chatterjee, Palash Sarkar: Constant Size Ciphertext HIBE in the Augmented Selective-ID Model and its Extensions. J. UCS 13(10): 1367-1395 (2007) | |
| c45 | ||
| c44 | Somitra Kumar Sanadhya, Palash Sarkar: New Local Collisions for the SHA-2 Hash Family. ICISC 2007: 193-205 | |
| c43 | Pradeep Kumar Mishra, Pinakpani Pal, Palash Sarkar: Towards Minimizing Memory Requirement for Implementation of Hyperelliptic Curve Cryptosystems. ISPEC 2007: 269-283 | |
| c42 | Palash Sarkar, Sanjit Chatterjee: Construction of a Hybrid HIBE Protocol Secure Against Adaptive Attacks. ProvSec 2007: 51-67 | |
| i35 | Debrup Chakraborty, Palash Sarkar: HCH: A New Tweakable Enciphering Scheme Using the Hash-Counter-Hash Approach. IACR Cryptology ePrint Archive 2007: 28 (2007) | |
| i34 | Debrup Chakraborty, Palash Sarkar: A General Construction of Tweakable Block Ciphers and Different Modes of Operations. IACR Cryptology ePrint Archive 2007: 29 (2007) | |
| i33 | Sanjit Chatterjee, Palash Sarkar: Constant Size Ciphertext HIBE in the Augmented Selective-ID Model and its Extensions. IACR Cryptology ePrint Archive 2007: 84 (2007) | |
| i32 | Palash Sarkar: Improving Upon the TET Mode of Operation. IACR Cryptology ePrint Archive 2007: 317 (2007) | |
| i31 | Somitra Kumar Sanadhya, Palash Sarkar: New Local Collisions for the SHA-2 Hash Family. IACR Cryptology ePrint Archive 2007: 352 (2007) | |
| 2006 | ||
| c41 | Sanjit Chatterjee, Palash Sarkar: HIBE With Short Public Parameters Without Random Oracle. ASIACRYPT 2006: 145-160 | |
| c40 | Debrup Chakraborty, Palash Sarkar: A General Construction of Tweakable Block Ciphers and Different Modes of Operations. Inscrypt 2006: 88-102 | |
| c39 | Debrup Chakraborty, Palash Sarkar: A New Mode of Encryption Providing a Tweakable Strong Pseudo-random Permutation. FSE 2006: 293-309 | |
| c38 | Sourav Mukhopadhyay, Palash Sarkar: Application of LFSRs for Parallel Sequence Generation in Cryptologic Algorithms. ICCSA (3) 2006: 436-445 | |
| c37 | ||
| c36 | Sanjit Chatterjee, Palash Sarkar: New Constructions of Constant Size Ciphertext HIBE Without Random Oracle. ICISC 2006: 310-327 | |
| c35 | Debrup Chakraborty, Palash Sarkar: HCH: A New Tweakable Enciphering Scheme Using the Hash-Encrypt-Hash Approach. INDOCRYPT 2006: 287-302 | |
| c34 | Sanjit Chatterjee, Palash Sarkar: Multi-receiver Identity-Based Key Encapsulation with Shortened Ciphertext. INDOCRYPT 2006: 394-408 | |
| c33 | Sourav Mukhopadhyay, Palash Sarkar: Hardware architecture and trade-offs for generic inversion of one-way functions. ISCAS 2006 | |
| c32 | Sourav Mukhopadhyay, Palash Sarkar: On the Effectiveness of TMTO and Exhaustive Search Attacks. IWSEC 2006: 337-352 | |
| c31 | Sanjit Chatterjee, Palash Sarkar: Generalization of the Selective-ID Security Model for HIBE Protocols. Public Key Cryptography 2006: 241-256 | |
| i30 | Sourav Mukhopadhyay, Palash Sarkar: Application of LFSRs for Parallel Sequence Generation in Cryptologic Algorithms. IACR Cryptology ePrint Archive 2006: 42 (2006) | |
| i29 | Debrup Chakraborty, Palash Sarkar: A New Mode of Encryption Secure Against Symmetric Nonce Respecting Adversaries. IACR Cryptology ePrint Archive 2006: 62 (2006) | |
| i28 | Sourav Mukhopadhyay, Palash Sarkar: A New Cryptanalytic Time/Memory/Data Trade-off Algorithm. IACR Cryptology ePrint Archive 2006: 127 (2006) | |
| i27 | Sanjit Chatterjee, Palash Sarkar: Generalization of the Selective-ID Security Model for HIBE Protocols. IACR Cryptology ePrint Archive 2006: 203 (2006) | |
| i26 | Pradeep Kumar Mishra, Pinakpani Pal, Palash Sarkar: Towards Minimizing Memory Requirement for Implementation of Hyperelliptic Curve Crytosystems. IACR Cryptology ePrint Archive 2006: 204 (2006) | |
| i25 | Debrup Chakraborty, Palash Sarkar: A New Mode of Encryption Providing A Tweakable Strong Pseudo-Random. IACR Cryptology ePrint Archive 2006: 275 (2006) | |
| i24 | Sanjit Chatterjee, Palash Sarkar: On (Hierarchical) Identity Based Encryption Protocols with Short Public Parameters (With an Exposition of Waters' Artificial Abort Technique). IACR Cryptology ePrint Archive 2006: 279 (2006) | |
| i23 | Palash Sarkar, Sanjit Chatterjee: Construction of a Hybrid (Hierarchical) Identity-Based Encryption Protocol Secure Against Adaptive Attacks. IACR Cryptology ePrint Archive 2006: 362 (2006) | |
| 2005 | ||
| j24 | Wonil Lee, Mridul Nandi, Palash Sarkar, Donghoon Chang, Sangjin Lee, Kouichi Sakurai: PGV-Style Block-Cipher-Based Hash Families and Black-Box Analysis. IEICE Transactions 88-A(1): 39-48 (2005) | |
| j23 | Kishan Chand Gupta, Palash Sarkar: Construction of high degree resilient S-boxes with improved nonlinearity. Inf. Process. Lett. 95(3): 413-417 (2005) | |
| j22 | Palash Sarkar: Domain Extenders for UOWHF: A Finite Binary Tree Algorithm. J. UCS 11(6): 1040-1053 (2005) | |
| j21 | Kishan Chand Gupta, Palash Sarkar: Improved construction of nonlinear resilient S-boxes. IEEE Transactions on Information Theory 51(1): 339-348 (2005) | |
| j20 | Kishan Chand Gupta, Palash Sarkar: Toward a General Correlation Theorem. IEEE Transactions on Information Theory 51(9): 3297-3302 (2005) | |
| j19 | Palash Sarkar: Masking-based domain extenders for UOWHFs: bounds and constructions. IEEE Transactions on Information Theory 51(12): 4299-4311 (2005) | |
| c30 | ||
| c29 | Sanjit Chatterjee, Palash Sarkar: Trading Time for Space: Towards an Efficient IBE Scheme with Short(er) Public Parameters in the Standard Model. ICISC 2005: 424-440 | |
| c28 | Alex Biryukov, Sourav Mukhopadhyay, Palash Sarkar: Improved Time-Memory Trade-Offs with Multiple Data. Selected Areas in Cryptography 2005: 110-127 | |
| c27 | Sourav Mukhopadhyay, Palash Sarkar: Application of LFSRs in Time/Memory Trade-Off Cryptanalysis. WISA 2005: 25-37 | |
| i22 | Jin Hong, Palash Sarkar: Rediscovery of Time Memory Tradeoffs. IACR Cryptology ePrint Archive 2005: 90 (2005) | |
| i21 | Sourav Mukhopadhyay, Palash Sarkar: TMTO With Multiple Data: Analysis and New Single Table Trade-offs. IACR Cryptology ePrint Archive 2005: 214 (2005) | |
| 2004 | ||
| j18 | Sanjay Burman, Palash Sarkar: An Efficient Algorithm for Software Generation of Binary Linear Recurrences. Appl. Algebra Eng. Commun. Comput. 15(3-4): 201-203 (2004) | |
| j17 | Rana Barua, Satya R. Chakravarty, Sonali Roy, Palash Sarkar: A characterization and some properties of the Banzhaf-Coleman-Dubey-Shapley sensitivity index. Games and Economic Behavior 49(1): 31-48 (2004) | |
| j16 | Palash Sarkar, Subhamoy Maitra: Construction of Nonlinear Resilient Boolean Functions Using "Small" Affine Functions. IEEE Transactions on Information Theory 50(9): 2185-2193 (2004) | |
| j15 | Kishan Chand Gupta, Palash Sarkar: Construction of Perfect Nonlinear and Maximally Nonlinear Multiple-Output Boolean Functions Satisfying Higher Order Strict Avalanche Criteria. IEEE Transactions on Information Theory 50(11): 2886-2893 (2004) | |
| c26 | Wonil Lee, Mridul Nandi, Palash Sarkar, Donghoon Chang, Sangjin Lee, Kouichi Sakurai: Pseudorandomness of SPN-Type Transformations. ACISP 2004: 212-223 | |
| c25 | Palash Sarkar, Pradeep Kumar Mishra, Rana Barua: New Table Look-Up Methods for Faster Frobenius Map Based Scalar Multiplication Over GF(pn). ACNS 2004: 479-493 | |
| c24 | Palash Sarkar: Masking Based Domain Extenders for UOWHFs: Bounds and Constructions. ASIACRYPT 2004: 187-200 | |
| c23 | Joydip Mitra, Palash Sarkar: Time-Memory Trade-Off Attacks on Multiplications and T-Functions. ASIACRYPT 2004: 468-482 | |
| c22 | Jin Hong, Dong Hoon Lee, Seongtaek Chee, Palash Sarkar: Vulnerability of Nonlinear Filter Generators Based on Linear Finite State Machines. FSE 2004: 193-209 | |
| c21 | Ratna Dutta, Rana Barua, Palash Sarkar: Provably Secure Authenticated Tree Based Group Key Agreement. ICICS 2004: 92-104 | |
| c20 | Sanjit Chatterjee, Palash Sarkar, Rana Barua: Efficient Computation of Tate Pairing in Projective Coordinate over General Characteristic Fields. ICISC 2004: 168-181 | |
| c19 | Palash Sarkar: HEAD: Hybrid Encryption with Delegated Decryption Capability. INDOCRYPT 2004: 230-244 | |
| c18 | Pradeep Kumar Mishra, Palash Sarkar: Application of Montgomery's Trick to Scalar Multiplication for Elliptic and Hyperelliptic Curves Using a Fixed Base Point. Public Key Cryptography 2004: 41-54 | |
| c17 | Kishan Chand Gupta, Palash Sarkar: Efficient Representation and Software Implementation of Resilient Maiorana-McFarland S-boxes. WISA 2004: 317-331 | |
| i20 | Ratna Dutta, Rana Barua, Palash Sarkar: Pairing-Based Cryptographic Protocols : A Survey. IACR Cryptology ePrint Archive 2004: 64 (2004) | |
| i19 | Wonil Lee, Mridul Nandi, Palash Sarkar, Donghoon Chang, Sangjin Lee, Kouichi Sakurai: A Generalization of PGV-Hash Functions and Security Analysis in Black-Box Model. IACR Cryptology ePrint Archive 2004: 69 (2004) | |
| i18 | Ratna Dutta, Rana Barua, Palash Sarkar: Provably Secure Authenticated Tree Based Group Key Agreement Protocol. IACR Cryptology ePrint Archive 2004: 90 (2004) | |
| 2003 | ||
| j14 | Palash Sarkar, Paul J. Schellenberg: Construction of Symmetric Balanced Squares with Blocksize More than One. Des. Codes Cryptography 30(3): 235-280 (2003) | |
| j13 | Kishan Chand Gupta, Palash Sarkar: Computing Walsh Transform from the Algebraic Normal Form of a Boolean Function. Electronic Notes in Discrete Mathematics 15: 92-96 (2003) | |
| j12 | Palash Sarkar, Subhamoy Maitra: Balancedness and Correlation Immunity of Symmetric Boolean Functions. Electronic Notes in Discrete Mathematics 15: 176-181 (2003) | |
| j11 | Palash Sarkar, Subhamoy Maitra: Efficient Implementation of Cryptographically Useful 'Large' Boolean Functions. IEEE Trans. Computers 52(4): 410-417 (2003) | |
| c16 | Pradeep Kumar Mishra, Palash Sarkar: Parallelizing Explicit Formula for Arithmetic in the Jacobian of Hyperelliptic Curves. ASIACRYPT 2003: 93-110 | |
| c15 | Pinakpani Pal, Palash Sarkar: PARSHA-256- - A New Parallelizable Hash Function and a Multithreaded Implementation. FSE 2003: 347-361 | |
| c14 | Palash Sarkar: Hiji-bij-bij: A New Stream Cipher with a Self-synchronizing Mode of Operation. INDOCRYPT 2003: 36-51 | |
| c13 | Kishan Chand Gupta, Palash Sarkar: Construction of Perfect Nonlinear and Maximally Nonlinear Multi-output Boolean Functions Satisfying Higher Order Strict Avalanche Criteria (Extended Abstract). INDOCRYPT 2003: 107-120 | |
| c12 | Rana Barua, Ratna Dutta, Palash Sarkar: Extending Joux's Protocol to Multi Party Key Agreement (Extended Abstract). INDOCRYPT 2003: 205-217 | |
| i17 | Palash Sarkar: Domain Extenders for UOWHF: A Finite Binary Tree Algorithm. IACR Cryptology ePrint Archive 2003: 9 (2003) | |
| i16 | Palash Sarkar: Hiji-bij-bij: A New Stream Cipher with a Self-Synchronizing Mode of Operation. IACR Cryptology ePrint Archive 2003: 14 (2003) | |
| i15 | Kishan Chand Gupta, Palash Sarkar: Computing Partial Walsh Transform from the Algebraic Normal Form of a Boolean Function. IACR Cryptology ePrint Archive 2003: 40 (2003) | |
| i14 | Rana Barua, Ratna Dutta, Palash Sarkar: Extending Joux's Protocol to Multi Party Key Agreement. IACR Cryptology ePrint Archive 2003: 62 (2003) | |
| i13 | Kishan Chand Gupta, Palash Sarkar: A General Correlation Theorem. IACR Cryptology ePrint Archive 2003: 124 (2003) | |
| i12 | Palash Sarkar: Domain Extender for Collision Resistant Hash Functions: Improving Upon Merkle-Damgaard Iteration. IACR Cryptology ePrint Archive 2003: 173 (2003) | |
| i11 | Pradeep Kumar Mishra, Palash Sarkar: Parallelizing Explicit Formula for Arithmetic in the Jacobian of Hyperelliptic Curves. IACR Cryptology ePrint Archive 2003: 180 (2003) | |
| i10 | Rana Barua, Ratna Dutta, Palash Sarkar: Extending Joux's Protocol to Multi Party Key Agreement. IACR Cryptology ePrint Archive 2003: 190 (2003) | |
| i9 | Kishan Chand Gupta, Palash Sarkar: Construction of Perfect Nonlinear and Maximally Nonlinear Multi-Output Boolean Functions Satisfying Higher Order Strict Avalanche Criteria. IACR Cryptology ePrint Archive 2003: 198 (2003) | |
| i8 | Palash Sarkar: Masking Based Domain Extenders for UOWHFs: Bounds and Constructions. IACR Cryptology ePrint Archive 2003: 225 (2003) | |
| i7 | Pradeep Kumar Mishra, Palash Sarkar: Inversion of Several Field Elements: A New Parallel Algorithm. IACR Cryptology ePrint Archive 2003: 264 (2003) | |
| 2002 | ||
| j10 | Palash Sarkar, Subhamoy Maitra: Cross-Correlation Analysis of Cryptographically Useful Boolean Functions and S-Boxes. Theory Comput. Syst. 35(1): 39-57 (2002) | |
| j9 | Subhamoy Maitra, Palash Sarkar: Cryptographically significant Boolean functions with five valued Walsh spectra. Theor. Comput. Sci. 276(1-2): 133-146 (2002) | |
| j8 | Subhamoy Maitra, Palash Sarkar: Modifications of Patterson-Wiedemann functions for cryptographic applications. IEEE Transactions on Information Theory 48(1): 278-284 (2002) | |
| j7 | Subhamoy Maitra, Palash Sarkar: Maximum nonlinearity of symmetric Boolean functions on odd number of variables. IEEE Transactions on Information Theory 48(9): 2626-2630 (2002) | |
| c11 | Kishan Chand Gupta, Palash Sarkar: Improved Construction of Nonlinear Resilient S-Boxes. ASIACRYPT 2002: 466-483 | |
| c10 | Palash Sarkar: The Filter-Combiner Model for Memoryless Synchronous Stream Ciphers. CRYPTO 2002: 533-548 | |
| e1 | Alfred Menezes, Palash Sarkar (Eds.): Progress in Cryptology - INDOCRYPT 2002, Third International Conference on Cryptology in India, Hyderabad, India, December 16-18, 2002. Lecture Notes in Computer Science 2551, Springer 2002, isbn 3-540-00263-4 | |
| i6 | Palash Sarkar, Paul J. Schellenberg: A Parallelizable Design Principle for Cryptographic Hash Functions. IACR Cryptology ePrint Archive 2002: 31 (2002) | |
| i5 | Palash Sarkar: Construction of UOWHF: Tree Hashing Revisited. IACR Cryptology ePrint Archive 2002: 58 (2002) | |
| 2001 | ||
| j6 | Emir Pasalic, Subhamoy Maitra, Thomas Johansson, Palash Sarkar: New Constructions of Resilient and Correlation Immune Boolean Functions Achieving Upper Bound on Nonlinearity. Electronic Notes in Discrete Mathematics 6: 158-167 (2001) | |
| c9 | Palash Sarkar, Subhamoy Maitra: Efficient Implementation of "Large" Stream Cipher Systems. CHES 2001: 319-332 | |
| c8 | Palash Sarkar, Paul J. Schellenberg: A Parallel Algorithm for Extending Cryptographic Hash Functions. INDOCRYPT 2001: 40-49 | |
| c7 | ||
| i4 | Palash Sarkar: Pushdown Automaton with the Ability to Flip its Stack. Electronic Colloquium on Computational Complexity (ECCC)(081) (2001) | |
| 2000 | ||
| j5 | ||
| j4 | Palash Sarkar: A note on the spectral characterization of correlation immune Boolean functions. Inf. Process. Lett. 74(5-6): 191-195 (2000) | |
| c6 | Palash Sarkar, Subhamoy Maitra: Nonlinearity Bounds and Constructions of Resilient Boolean Functions. CRYPTO 2000: 515-532 | |
| c5 | Palash Sarkar, Subhamoy Maitra: Construction of Nonlinear Boolean Functions with Important Cryptographic Properties. EUROCRYPT 2000: 485-506 | |
| c4 | Sanjeev Kumar Mishra, Palash Sarkar: Symmetrically Private Information Retrieval. INDOCRYPT 2000: 225-236 | |
| i3 | Palash Sarkar, Subhamoy Maitra: New Directions in Design of Resilient Boolean Functions. IACR Cryptology ePrint Archive 2000: 9 (2000) | |
| i2 | Enes Pasalic, Thomas Johansson, Subhamoy Maitra, Palash Sarkar: New Constructions of Resilent and Correlation Immune Boolean Functions achieving Upper Bounds on Nonlinearity. IACR Cryptology ePrint Archive 2000: 48 (2000) | |
| i1 | Palash Sarkar: Spectral Domain Analysis of Correlation Immune and Resilient Boolean Functions. IACR Cryptology ePrint Archive 2000: 49 (2000) | |
| 1999 | ||
| j3 | Subhamoy Maitra, Palash Sarkar: Hamming Weights of Correlation Immune Boolean Functions. Inf. Process. Lett. 71(3-4): 149-153 (1999) | |
| c3 | Subhamoy Maitra, Palash Sarkar: Enumeration of Correlation Immune Boolean Functions. ACISP 1999: 12-25 | |
| c2 | Subhamoy Maitra, Palash Sarkar: Highly Nonlinear Resilient Functions Optimizing Siegenthaler's Inequality. CRYPTO 1999: 198-215 | |
| 1998 | ||
| j2 | Palash Sarkar, Rana Barua: The Set of Reversible 90/150 Cellular Automata Is Regular. Discrete Applied Mathematics 84(1-3): 199-213 (1998) | |
| j1 | Palash Sarkar, Rana Barua: Multidimenstional Sigma-Automata, Pi-Polynomials and Generalised S-Matrices. Theor. Comput. Sci. 197(1-2): 111-138 (1998) | |
| 1997 | ||
| c1 | Palash Sarkar, Bimal K. Roy, Pabitra Pal Choudhury: VLSI Implementation of Modulo Multiplication Using Carry Free Addition. VLSI Design 1997: 457-460 | |
Data released under the ODC-BY 1.0 license — See also our legal information page