default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShibam Ghosh
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j4]Sahiba Suryawanshi, Shibam Ghosh, Dhiman Saha, Prathamesh Ram:
Simple vs. vectorial: exploiting structural symmetry to beat the ZeroSum distinguisher. Des. Codes Cryptogr. 93(1): 133-174 (2025)- [i16]Marcel Nageler, Shibam Ghosh, Marlene Jüttler, Maria Eichlseder:
AutoDiVer: Automatically Verifying Differential Characteristics and Learning Key Conditions. IACR Cryptol. ePrint Arch. 2025: 185 (2025) - [i15]Yanis Belkheyar, Patrick Derbez, Shibam Ghosh, Gregor Leander, Silvia Mella, Léo Perrin, Shahram Rasoolzadeh, Lukas Stennes, Siwei Sun, Gilles Van Assche, Damian Vizár:
ChiLow and ChiChi: New Constructions for Code Encryption. IACR Cryptol. ePrint Arch. 2025: 308 (2025) - [i14]Roberto Avanzi, Orr Dunkelman, Shibam Ghosh:
Differential Cryptanalysis of the Reduced Pointer Authentication Code Function used in Arm's FEAT_PACQARMA3 Feature. IACR Cryptol. ePrint Arch. 2025: 321 (2025) - 2024
- [c7]Orr Dunkelman, Shibam Ghosh, Nathan Keller, Gaëtan Leurent, Avichai Marmor, Victor Mollimard:
Partial Sums Meet FFT: Improved Attack on 6-Round AES. EUROCRYPT (1) 2024: 128-157 - [c6]Shibam Ghosh, Anup Kumar Kundu, Mostafizar Rahman, Dhiman Saha:
BIZness: Bit Invariant Zero-Sum Property Based on Division Trail. INDOCRYPT (2) 2024: 134-155 - [c5]Ravi Anand, Shibam Ghosh, Takanori Isobe, Rentaro Shiba:
Quantum Key Recovery Attacks on 4-Round Iterated Even-Mansour with Two Keys. ISC (1) 2024: 87-103 - [i13]Sahiba Suryawanshi, Shibam Ghosh, Dhiman Saha, Prathamesh Ram:
Simple Vs Vectorial: Exploiting Structural Symmetry to Beat the ZeroSum Distinguisher Applications to SHA3, Xoodyak and Bash. IACR Cryptol. ePrint Arch. 2024: 52 (2024) - [i12]Ravi Anand, Shibam Ghosh, Takanori Isobe, Rentaro Shiba:
Quantum Key Recovery Attacks on 4-round Iterated Even-Mansour with Two Keys. IACR Cryptol. ePrint Arch. 2024: 1278 (2024) - [i11]Roberto Avanzi, Orr Dunkelman, Shibam Ghosh:
A Note on ARADI and LLAMA. IACR Cryptol. ePrint Arch. 2024: 1328 (2024) - [i10]Anup Kumar Kundu, Shibam Ghosh, Aikata, Dhiman Saha:
ToFA: Towards Fault Analysis of GIFT and GIFT-like Ciphers Leveraging Truncated Impossible Differentials. IACR Cryptol. ePrint Arch. 2024: 1927 (2024) - [i9]Nilanjan Datta, Avijit Dutta, Shibam Ghosh, Hrithik Nandi:
Optimally Secure TBC Based Accordion Mode. IACR Cryptol. ePrint Arch. 2024: 2053 (2024) - 2023
- [j3]Orr Dunkelman, Shibam Ghosh, Eran Lambooij:
Attacking the IETF/ISO Standard for Internal Re-keying CTR-ACPKM. IACR Trans. Symmetric Cryptol. 2023(1): 41-66 (2023) - [j2]Orr Dunkelman, Shibam Ghosh, Eran Lambooij:
Practical Related-Key Forgery Attacks on Full-Round TinyJAMBU-192/256. IACR Trans. Symmetric Cryptol. 2023(2): 176-188 (2023) - [j1]Roberto Avanzi, Subhadeep Banik
, Orr Dunkelman, Maria Eichlseder, Shibam Ghosh, Marcel Nageler, Francesco Regazzoni:
The QARMAv2 Family of Tweakable Block Ciphers. IACR Trans. Symmetric Cryptol. 2023(3): 25-73 (2023) - [c4]Anup Kumar Kundu, Shibam Ghosh, Dhiman Saha, Mostafizar Rahman:
Divide and Rule: DiFA - Division Property Based Fault Attacks on PRESENT and GIFT. ACNS (1) 2023: 89-116 - [i8]Orr Dunkelman, Shibam Ghosh, Eran Lambooij:
Attacking the IETF/ISO Standard for Internal Re-keying CTR-ACPKM. IACR Cryptol. ePrint Arch. 2023: 230 (2023) - [i7]Anup Kumar Kundu, Shibam Ghosh, Dhiman Saha, Mostafizar Rahman:
Divide and Rule: DiFA - Division Property Based Fault Attacks on PRESENT and GIFT. IACR Cryptol. ePrint Arch. 2023: 682 (2023) - [i6]Roberto Avanzi, Subhadeep Banik, Orr Dunkelman, Maria Eichlseder, Shibam Ghosh, Marcel Nageler, Francesco Regazzoni:
The tweakable block cipher family QARMAv2. IACR Cryptol. ePrint Arch. 2023: 929 (2023) - [i5]Orr Dunkelman, Shibam Ghosh, Nathan Keller, Gaëtan Leurent, Avichai Marmor, Victor Mollimard:
Partial Sums Meet FFT: Improved Attack on 6-Round AES. IACR Cryptol. ePrint Arch. 2023: 1659 (2023) - 2022
- [c3]Nilanjan Datta, Avijit Dutta, Shibam Ghosh:
INT-RUP Security of SAEB and TinyJAMBU. INDOCRYPT 2022: 146-170 - [c2]Orr Dunkelman, Shibam Ghosh, Eran Lambooij:
Full Round Zero-Sum Distinguishers on TinyJAMBU-128 and TinyJAMBU-192 Keyed-Permutation in the Known-Key Setting. INDOCRYPT 2022: 349-372 - [i4]Orr Dunkelman, Eran Lambooij, Shibam Ghosh:
Practical Related-Key Forgery Attacks on the Full TinyJAMBU-192/256. IACR Cryptol. ePrint Arch. 2022: 1122 (2022) - [i3]Nilanjan Datta, Avijit Dutta, Shibam Ghosh:
INT-RUP Security of SAEB and TinyJAMBU. IACR Cryptol. ePrint Arch. 2022: 1414 (2022) - [i2]Orr Dunkelman, Shibam Ghosh, Eran Lambooij:
Full Round Zero-sum Distinguishers on TinyJAMBU-128 and TinyJAMBU-192 Keyed-permutation in the Known-key setting. IACR Cryptol. ePrint Arch. 2022: 1567 (2022) - 2021
- [c1]Shibam Ghosh, Orr Dunkelman:
Automatic Search for Bit-Based Division Property. LATINCRYPT 2021: 254-274 - [i1]Shibam Ghosh, Orr Dunkelman:
Automatic Search for Bit-based Division Property. IACR Cryptol. ePrint Arch. 2021: 965 (2021)
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 2025-03-18 21:44 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:
