![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Sumanta Sarkar
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j18]Chinmoy Biswas
, Ratna Dutta, Sumanta Sarkar:
An efficient post-quantum secure dynamic EPID signature scheme using lattices. Multim. Tools Appl. 83(5): 13791-13820 (2024) - [i23]Aydin Abadi, Vishnu Asutosh Dasu, Sumanta Sarkar:
Privacy-Preserving Data Deduplication for Enhancing Federated Learning of Language Models. CoRR abs/2407.08152 (2024) - [i22]Aydin Abadi, Vishnu Asutosh Dasu, Sumanta Sarkar:
Privacy-Preserving Data Deduplication for Enhancing Federated Learning of Language Models. IACR Cryptol. ePrint Arch. 2024: 1151 (2024) - 2023
- [j17]Shih-Chun You, Markus G. Kuhn, Sumanta Sarkar, Feng Hao:
Low Trace-Count Template Attacks on 32-bit Implementations of ASCON AEAD. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2023(4): 344-366 (2023) - 2022
- [j16]Kalikinkar Mandal, Dhiman Saha, Sumanta Sarkar, Yosuke Todo
:
Sycon: a new milestone in designing ASCON-like permutations. J. Cryptogr. Eng. 12(3): 305-327 (2022) - [j15]Ayineedi Venkateswarlu, Abhishek Kesarwani, Sumanta Sarkar:
On the Lower Bound of Cost of MDS Matrices. IACR Trans. Symmetric Cryptol. 2022(4): 266-290 (2022) - [c22]Vishnu Asutosh Dasu, Sumanta Sarkar, Kalikinkar Mandal:
PROV-FL: Privacy-preserving Round Optimal Verifiable Federated Learning. AISec@CCS 2022: 33-44 - 2021
- [j14]Raghvendra Rohit, Kai Hu, Sumanta Sarkar, Siwei Sun:
Misuse-Free Key-Recovery and Distinguishing Attacks on 7-Round Ascon. IACR Trans. Symmetric Cryptol. 2021(1): 130-155 (2021) - [c21]Anubhab Baksi, Shivam Bhasin, Jakub Breier
, Mustafa Khairallah
, Thomas Peyrin
, Sumanta Sarkar, Siang Meng Sim:
DEFAULT: Cipher Level Resistance Against Differential Fault Attack. ASIACRYPT (2) 2021: 124-156 - [i21]Kalikinkar Mandal, Dhiman Saha, Sumanta Sarkar, Yosuke Todo:
Sycon: A New Milestone in Designing ASCON-like Permutations. IACR Cryptol. ePrint Arch. 2021: 157 (2021) - [i20]Raghvendra Rohit, Kai Hu, Sumanta Sarkar, Siwei Sun:
Misuse-Free Key-Recovery and Distinguishing Attacks on 7-Round Ascon. IACR Cryptol. ePrint Arch. 2021: 194 (2021) - [i19]Anubhab Baksi, Shivam Bhasin, Jakub Breier, Mustafa Khairallah, Thomas Peyrin, Sumanta Sarkar, Siang Meng Sim:
DEFAULT: Cipher Level Resistance Against Differential Fault Attack. IACR Cryptol. ePrint Arch. 2021: 712 (2021) - 2020
- [j13]Anubhab Baksi, Dhiman Saha, Sumanta Sarkar:
To infect or not to infect: a critical analysis of infective countermeasures in fault attacks. J. Cryptogr. Eng. 10(4): 355-374 (2020) - [j12]Anubhab Baksi, Sumanta Sarkar, Anupam Chattopadhyay:
A Coding Theoretic Approach towards Symmetrization in Reversible Circuit Synthesis. J. Multiple Valued Log. Soft Comput. 35(3-4): 239-262 (2020) - [c20]Sumanta Sarkar, Yu Sasaki, Siang Meng Sim:
On the Design of Bit Permutation Based Ciphers - The Interplay Among S-Box, Bit Permutation and Key-Addition. IWSEC 2020: 3-22 - [i18]Sumanta Sarkar, Yu Sasaki, Siang Meng Sim:
On the Design of Bit Permutation Based Ciphers - The Interplay Among S-box, Bit Permutation and Key-addition. IACR Cryptol. ePrint Arch. 2020: 680 (2020) - [i17]Mahabir Prasad Jhanwar, Sumanta Sarkar:
PHyCT : Privacy preserving Hybrid Contact Tracing. IACR Cryptol. ePrint Arch. 2020: 793 (2020)
2010 – 2019
- 2019
- [c19]Sumanta Sarkar, Kalikinkar Mandal, Dhiman Saha:
On the Relationship Between Resilient Boolean Functions and Linear Branch Number of S-Boxes. INDOCRYPT 2019: 361-374 - [c18]Vishnu Asutosh Dasu
, Anubhab Baksi, Sumanta Sarkar, Anupam Chattopadhyay:
LIGHTER-R: Optimized Reversible Circuit Implementation For SBoxes. SoCC 2019: 260-265 - [i16]Anubhab Baksi, Dhiman Saha, Sumanta Sarkar:
To Infect Or Not To Infect: A Critical Analysis Of Infective Countermeasures In Fault Attacks. IACR Cryptol. ePrint Arch. 2019: 355 (2019) - [i15]Sumanta Sarkar, Kalikinkar Mandal, Dhiman Saha:
On the Relationship between Resilient Boolean Functions and Linear Branch Number of S-boxes. IACR Cryptol. ePrint Arch. 2019: 1427 (2019) - 2018
- [c17]Sumanta Sarkar, Habeeb Syed:
Bounds on Differential and Linear Branch Number of Permutations. ACISP 2018: 207-224 - [c16]Nitesh Emmadi, Lakshmi Padmaja Maddali, Sumanta Sarkar:
MaRSChain: Framework for a Fair Manuscript Review System Based on Permissioned Blockchain. Euro-Par Workshops 2018: 355-366 - 2017
- [j11]Kaushik Chakraborty
, Sumanta Sarkar, Subhamoy Maitra, Bodhisatwa Mazumdar, Debdeep Mukhopadhyay, Emmanuel Prouff:
Redefining the transparency order. Des. Codes Cryptogr. 82(1-2): 95-115 (2017) - [j10]Srimanta Bhattacharya, Sumanta Sarkar:
On some permutation binomials and trinomials over $$\mathbb {F}_{2^n}$$ F 2 n. Des. Codes Cryptogr. 82(1-2): 149-160 (2017) - [c15]Sumanta Sarkar, Habeeb Syed:
Analysis of Toeplitz MDS Matrices. ACISP (2) 2017: 3-18 - [c14]Sumanta Sarkar, Habeeb Syed, Rajat Sadhukhan, Debdeep Mukhopadhyay:
Lightweight Design Choices for LED-like Block Ciphers. INDOCRYPT 2017: 267-281 - [i14]Sumanta Sarkar, Habeeb Syed:
Analysis of Toeplitz MDS Matrices. IACR Cryptol. ePrint Arch. 2017: 368 (2017) - [i13]Sumanta Sarkar, Habeeb Syed:
Bounds on the Differential Branch Number of Permutations. IACR Cryptol. ePrint Arch. 2017: 990 (2017) - [i12]Sumanta Sarkar, Habeeb Syed, Rajat Sadhukhan, Debdeep Mukhopadhyay:
Lightweight Design Choices for LED-like Block Ciphers. IACR Cryptol. ePrint Arch. 2017: 1031 (2017) - 2016
- [j9]Pascale Charpin, Sihem Mesnager, Sumanta Sarkar:
Involutions Over the Galois Field 𝔽n. IEEE Trans. Inf. Theory 62(4): 2266-2276 (2016) - [j8]Sumanta Sarkar, Habeeb Syed:
Lightweight Diffusion Layer: Importance of Toeplitz Matrices. IACR Trans. Symmetric Cryptol. 2016(1): 95-113 (2016) - [c13]Sumanta Sarkar, Siang Meng Sim
:
A Deeper Understanding of the XOR Count Distribution in the Context of Lightweight Cryptography. AFRICACRYPT 2016: 167-182 - [i11]Sumanta Sarkar, Siang Meng Sim:
A deeper understanding of the XOR count distribution in the context of lightweight cryptography. IACR Cryptol. ePrint Arch. 2016: 422 (2016) - [i10]Sumanta Sarkar, Habeeb Syed:
Lightweight Diffusion Layer: Importance of Toeplitz Matrices. IACR Cryptol. ePrint Arch. 2016: 835 (2016) - 2015
- [c12]Pascale Charpin, Sihem Mesnager, Sumanta Sarkar:
On involutions of finite fields. ISIT 2015: 186-190 - [c11]Sumanta Sarkar, Thomas W. Cusick:
Initial results on the rotation symmetric bent-negabent functions. IWSDA 2015: 80-84 - [i9]Pascale Charpin, Sihem Mesnager, Sumanta Sarkar:
Dickson Polynomials that are Involutions. IACR Cryptol. ePrint Arch. 2015: 434 (2015) - 2014
- [c10]Sumanta Sarkar, Subhamoy Maitra, Kaushik Chakraborty:
Differential Power Analysis in Hamming Weight Model: How to Choose among (Extended) Affine Equivalent S-boxes. INDOCRYPT 2014: 360-373 - [i8]Sumanta Sarkar:
Some Results on Bent-Negabent Boolean Functions over Finite Fields. CoRR abs/1406.1036 (2014) - [i7]Kaushik Chakraborty, Subhamoy Maitra, Sumanta Sarkar, Bodhisatwa Mazumdar, Debdeep Mukhopadhyay:
Redefining the Transparency Order. IACR Cryptol. ePrint Arch. 2014: 367 (2014) - 2013
- [c9]Sumanta Sarkar, Reihaneh Safavi-Naini, Liang Feng Zhang:
RAFR: remote assessment of file redundancy. SCC@ASIACCS 2013: 27-32 - 2012
- [c8]Sumanta Sarkar, Reihaneh Safavi-Naini:
Proofs of Retrievability via Fountain Code. FPS 2012: 18-32 - [c7]Sumanta Sarkar:
Characterizing Negabent Boolean Functions over Finite Fields. SETA 2012: 77-88 - [c6]Sumanta Sarkar, Srimanta Bhattacharya, Ayça Çesmelioglu
:
On Some Permutation Binomials of the Form $x^{\frac{2^n-1}{k}+1} +ax$ over $\mathbb{F}_{2^n}$ : Existence and Count. WAIFI 2012: 236-246 - 2011
- [j7]Pascale Charpin, Sumanta Sarkar:
Polynomials With Linear Structure and Maiorana-McFarland Construction. IEEE Trans. Inf. Theory 57(6): 3796-3804 (2011) - [c5]Vincent Herbert, Sumanta Sarkar:
On the Triple-Error-Correcting Cyclic Codes with Zero Set {1, 2 i + 1, 2 j + 1}. IMACC 2011: 79-96 - 2010
- [j6]Sugata Gangopadhyay, Sumanta Sarkar, Ruchi Telang:
On the lower bounds of the second order nonlinearities of some Boolean functions. Inf. Sci. 180(2): 266-273 (2010) - [c4]Pascale Charpin, Sumanta Sarkar:
Polynomials with linear structure and Maiorana-McFarland construction. ISIT 2010: 1138-1142
2000 – 2009
- 2009
- [j5]Sugata Gangopadhyay, Deepmala Sharma, Sumanta Sarkar, Subhamoy Maitra:
On affine (non)equivalence of Boolean functions. Computing 85(1-2): 37-55 (2009) - [j4]Sumanta Sarkar, Subhamoy Maitra:
Construction of Rotation Symmetric Boolean Functions with optimal Algebraic Immunity. Computación y Sistemas 12(3) (2009) - [j3]Deepak Kumar Dalai
, Subhamoy Maitra, Sumanta Sarkar:
Results on rotation symmetric bent functions. Discret. Math. 309(8): 2398-2409 (2009) - [c3]Sumanta Sarkar:
On the Symmetric Negabent Boolean Functions. INDOCRYPT 2009: 136-143 - [i6]Sugata Gangopadhyay, Sumanta Sarkar, Ruchi Telang:
On the Lower Bounds of the Second Order Nonlinearity of some Boolean Functions. IACR Cryptol. ePrint Arch. 2009: 94 (2009) - 2008
- [j2]Sumanta Sarkar, Subhamoy Maitra:
Idempotents in the neighbourhood of Patterson-Wiedemann functions having Walsh spectra zeros. Des. Codes Cryptogr. 49(1-3): 95-103 (2008) - [i5]Santanu Sarkar, Subhamoy Maitra, Sumanta Sarkar:
RSA Cryptanalysis with Increased Bounds on the Secret Exponent using Less Lattice Dimension. IACR Cryptol. ePrint Arch. 2008: 315 (2008) - 2007
- [c2]Sumanta Sarkar, Subhamoy Maitra:
Construction of Rotation Symmetric Boolean Functions on Odd Number of Variables with Maximum Algebraic Immunity. AAECC 2007: 271-280 - [i4]Sumanta Sarkar, Subhamoy Maitra:
Construction of Rotation Symmetric Boolean Functions with Maximum Algebraic Immunity on Odd Number of Variables. IACR Cryptol. ePrint Arch. 2007: 290 (2007) - [i3]Sumanta Sarkar, Subhamoy Maitra:
Idempotents in the Neighbourhood of Patterson-Wiedemann Functions having Walsh Spectra Zeros. IACR Cryptol. ePrint Arch. 2007: 427 (2007) - 2006
- [j1]Deepak Kumar Dalai
, Subhamoy Maitra, Sumanta Sarkar:
Basic Theory in Construction of Boolean Functions with Maximum Possible Annihilator Immunity. Des. Codes Cryptogr. 40(1): 41-58 (2006) - [c1]Selçuk Kavut, Subhamoy Maitra, Sumanta Sarkar, Melek D. Yücel:
Enumeration of 9-Variable Rotation Symmetric Boolean Functions Having Nonlinearity > 240. INDOCRYPT 2006: 266-279 - [i2]Selçuk Kavut, Subhamoy Maitra, Sumanta Sarkar, Melek Diker Yücel:
Enumeration of 9-variable Rotation Symmetric Boolean Functions having Nonlinearity > 240. IACR Cryptol. ePrint Arch. 2006: 249 (2006) - 2005
- [i1]Deepak Kumar Dalai, Subhamoy Maitra, Sumanta Sarkar:
Basic Theory in Construction of Boolean Functions with Maximum Possible Annihilator Immunity. IACR Cryptol. ePrint Arch. 2005: 229 (2005)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-18 00:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint