default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDebasmita Chakraborty
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2025
[j5]Debasmita Chakraborty
, Mridul Nandi:
COLM under attack: A cryptanalytic exploration of COLM variants. J. Inf. Secur. Appl. 89: 103936 (2025)- [j4]Soumya Sahoo, Debasmita Chakraborty, Santanu Sarkar:
Unleashing the Power of Differential Fault Attacks on QARMAv2. IEEE Trans. Computers 74(11): 3792-3804 (2025) - [j3]Soumya Sahoo, Debasmita Chakraborty, Santanu Sarkar:
Chasing Shadows: Advancements in Differential-Linear Cryptanalysis for ChaCha. IEEE Trans. Inf. Theory 71(8): 6451-6469 (2025) - [c3]Debasmita Chakraborty, Hosein Hadipour, Anup Kumar Kundu, Mostafizar Rahman, Prathamesh Ram, Yu Sasaki, Dilip Sau, Aman Sinha:
Breaking the Twinkle Authenticated Encryption Scheme and Analyzing Its Underlying Permutation. SAC 2025: 79-109 - [i7]Debasmita Chakraborty, Soumya Sahoo, Phuong Hoa Nguyen, Santanu Sarkar:
An Automated Model to Search For Differential Meet-In-The-Middle Attack: Applications to AndRX Ciphers. IACR Cryptol. ePrint Arch. 2025: 1249 (2025) - [i6]Debasmita Chakraborty, Hosein Hadipour, Anup Kumar Kundu, Mostafizar Rahman, Prathamesh Ram, Yu Sasaki, Dilip Sau, Aman Sinha:
Breaking the Twinkle Authenticated Encryption Scheme and Analyzing Its Underlying Permutation. IACR Cryptol. ePrint Arch. 2025: 1339 (2025) - [i5]Marcel Nageler, Debasmita Chakraborty, Simon Scherer, Maria Eichlseder:
Key Recovery Attacks on ZIP Ciphers: Application to ZIP-AES and ZIP-GIFT. IACR Cryptol. ePrint Arch. 2025: 2291 (2025) - 2024
- [j2]Debasmita Chakraborty, Mridul Nandi:
Lower Bound on Number of Compression Calls of a Collision-Resistance Preserving Hash. IACR Commun. Cryptol. 1(3): 22 (2024) - [j1]Debasmita Chakraborty, Hosein Hadipour, Phuong Hoa Nguyen, Maria Eichlseder:
Finding Complete Impossible Differential Attacks on AndRX Ciphers and Efficient Distinguishers for ARX Designs. IACR Trans. Symmetric Cryptol. 2024(3): 84-176 (2024) - [i4]Debasmita Chakraborty, Mridul Nandi:
Lower Bound on Number of Compression Calls of a Collision-Resistance Preserving Hash. IACR Cryptol. ePrint Arch. 2024: 1095 (2024) - [i3]Debasmita Chakraborty, Hosein Hadipour, Phuong Hoa Nguyen, Maria Eichlseder:
Finding Complete Impossible Differential Attacks on AndRX Ciphers and Efficient Distinguishers for ARX Designs. IACR Cryptol. ePrint Arch. 2024: 1359 (2024) - 2023
- [i2]Soumya Sahoo, Debasmita Chakraborty, Santanu Sarkar:
Unleashing the Power of Differential Fault Attacks on QARMAv2. IACR Cryptol. ePrint Arch. 2023: 1667 (2023) - 2022
- [c2]Debasmita Chakraborty:
Finding Three-Subset Division Property for Ciphers with Complex Linear Layers. INDOCRYPT 2022: 398-421 - [c1]Debasmita Chakraborty, Santu Pal:
Superpoly Recovery of Grain-128AEAD Using Division Property. SecITC 2022: 65-80 - [i1]Debasmita Chakraborty:
Finding Three-Subset Division Property for Ciphers with Complex Linear Layers (Full Version). IACR Cryptol. ePrint Arch. 2022: 1444 (2022)
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 2026-04-23 00:06 CEST 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:
