default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSubhabrata Samajder
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j8]Debrup Chakraborty, Avishek Majumder, Subhabrata Samajder:
Making searchable symmetric encryption schemes smaller and faster. Int. J. Inf. Sec. 24(1): 10 (2025)- 2024
- [j7]Neal Koblitz, Subhabrata Samajder, Palash Sarkar, Subhadip Singha:
Concrete analysis of approximate ideal-SIVP to decision ring-LWE reduction. Int. J. Appl. Math. Comput. Sci. 18(5): 1216-1258 (2024) - [i13]Debrup Chakraborty, Avishek Majumder, Subhabrata Samajder:
Making Searchable Symmetric Encryption Schemes Smaller and Faster. IACR Cryptol. ePrint Arch. 2024: 1483 (2024) - 2023
- [j6]Subhabrata Samajder
, Palash Sarkar:
Another look at key randomisation hypotheses. Des. Codes Cryptogr. 91(12): 3837-3855 (2023) - [c4]Subhabrata Samajder, Palash Sarkar:
Correlations Between (Nonlinear) Combiners of Input and Output of Random Functions and Permutations. CSCML 2023: 181-187 - 2022
- [c3]Subhabrata Samajder, Palash Sarkar:
Distinguishing Error of Nonlinear Invariant Attacks. INDOCRYPT 2022: 319-335 - [i12]Neal Koblitz, Subhabrata Samajder, Palash Sarkar, Subhadip Singha:
Concrete Analysis of Approximate Ideal-SIVP to Decision Ring-LWE Reduction. IACR Cryptol. ePrint Arch. 2022: 275 (2022)
2010 – 2019
- 2019
- [j5]Subhabrata Samajder, Palash Sarkar:
Another look at success probability of linear cryptanalysis. Adv. Math. Commun. 13(4): 645-688 (2019) - [i11]Subhabrata Samajder, Palash Sarkar:
Another Look at Key Randomisation Hypotheses. IACR Cryptol. ePrint Arch. 2019: 960 (2019) - 2018
- [j4]Subhabrata Samajder, Palash Sarkar:
Success probability of multiple/multidimensional linear cryptanalysis under general key randomisation hypotheses. Cryptogr. Commun. 10(5): 835-879 (2018) - [j3]Subhabrata Samajder, Palash Sarkar:
Multiple (Truncated) Differential Cryptanalysis: Explicit Upper Bounds on Data Complexity. Cryptogr. Commun. 10(6): 1137-1163 (2018) - [i10]Subhabrata Samajder, Palash Sarkar:
Distinguishing Error of Nonlinear Invariant Attacks. IACR Cryptol. ePrint Arch. 2018: 935 (2018) - 2017
- [j2]Subhabrata Samajder, Palash Sarkar:
Rigorous upper bounds on data complexities of block cipher cryptanalysis. J. Math. Cryptol. 11(3): 147-175 (2017) - [i9]Subhabrata Samajder, Palash Sarkar:
Another Look at Success Probability in Linear Cryptanalysis. IACR Cryptol. ePrint Arch. 2017: 391 (2017) - [i8]Subhabrata Samajder, Palash Sarkar:
Success Probability of Multiple/Multidimensional Linear Cryptanalysis Under General Key Randomisation Hypotheses. IACR Cryptol. ePrint Arch. 2017: 729 (2017) - [i7]Subhabrata Samajder, Palash Sarkar:
Correlations Between (Nonlinear) Combiners of Input and Output of Random Functions and Permutations. IACR Cryptol. ePrint Arch. 2017: 1219 (2017) - 2016
- [j1]Subhabrata Samajder, Palash Sarkar:
Another look at normal approximations in cryptanalysis. J. Math. Cryptol. 10(2): 69-99 (2016) - [c2]Subhabrata Samajder, Palash Sarkar:
A New Test Statistic for Key Recovery Attacks Using Multiple Linear Approximations. Mycrypt 2016: 277-293 - [i6]Subhabrata Samajder, Palash Sarkar:
A New Test Statistic for Key Recovery Attacks Using Multiple Linear Approximations. IACR Cryptol. ePrint Arch. 2016: 404 (2016) - [i5]Subhabrata Samajder, Palash Sarkar:
Multiple Differential Cryptanalysis: A Rigorous Analysis. IACR Cryptol. ePrint Arch. 2016: 405 (2016) - [i4]Subhabrata Samajder, Palash Sarkar:
Can Large Deviation Theory be Used for Estimating Data Complexity? IACR Cryptol. ePrint Arch. 2016: 465 (2016) - 2015
- [i3]Subhabrata Samajder, Palash Sarkar:
Another Look at Normal Approximations in Cryptanalysis. IACR Cryptol. ePrint Arch. 2015: 679 (2015) - [i2]Subhabrata Samajder, Palash Sarkar:
Rigorous Upper Bounds on Data Complexities of Block Cipher Cryptanalysis. IACR Cryptol. ePrint Arch. 2015: 916 (2015) - 2014
- [c1]Subhabrata Samajder, Palash Sarkar:
Some Randomness Experiments on TRIVIUM. SPACE 2014: 219-236 - [i1]Subhabrata Samajder, Palash Sarkar:
Some Randomness Experiments on TRIVIUM. IACR Cryptol. ePrint Arch. 2014: 211 (2014)
Coauthor Index
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-11-22 20:39 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
