default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMridul Nandi
- > Home > Persons > Mridul Nandi
Publications
- 2024
[j56]Elena Andreeva
, Andrey Bogdanov, Nilanjan Datta, Atul Luykx, Bart Mennink, Mridul Nandi, Elmar Tischhauser, Kan Yasuda:
The COLM Authenticated Encryption Scheme. J. Cryptol. 37(2): 15 (2024)- 2023
- [j54]Nilanjan Datta, Avijit Dutta, Mridul Nandi, Suprita Talnikar:
Tight Multi-User Security Bound of DbHtS. IACR Trans. Symmetric Cryptol. 2023(1): 192-223 (2023) - [c66]Bishwajit Chakraborty, Nilanjan Datta, Mridul Nandi:
Designing Full-Rate Sponge Based AEAD Modes. INDOCRYPT (1) 2023: 89-110 - [i92]Bishwajit Chakraborty, Nilanjan Datta, Mridul Nandi:
Designing Full-Rate Sponge based AEAD modes. IACR Cryptol. ePrint Arch. 2023: 1673 (2023) - 2022
- [c62]Arghya Bhattacharjee, Avik Chakraborti, Nilanjan Datta, Cuauhtemoc Mancillas-López, Mridul Nandi:
sf ISAP+: sf ISAP with Fast Authentication. INDOCRYPT 2022: 195-219 - [i89]Nilanjan Datta, Avijit Dutta, Mridul Nandi, Suprita Talnikar:
Tight Multi-User Security Bound of sfDbHtS. IACR Cryptol. ePrint Arch. 2022: 689 (2022) - [i84]Arghya Bhattacharjee, Avik Chakraborti, Nilanjan Datta, Cuauhtemoc Mancillas-López, Mridul Nandi:
ISAP+: ISAP with Fast Authentication. IACR Cryptol. ePrint Arch. 2022: 1591 (2022) - 2021
- [c55]Avik Chakraborti, Nilanjan Datta, Ashwin Jha, Cuauhtemoc Mancillas-López, Mridul Nandi:
tHyENA: Making HyENA Even Smaller. INDOCRYPT 2021: 26-48 - [c53]Avik Chakraborti, Nilanjan Datta, Ashwin Jha, Cuauhtemoc Mancillas-López, Mridul Nandi, Yu Sasaki:
Elastic-Tweak: A Framework for Short Tweak Tweakable Block Cipher. INDOCRYPT 2021: 114-137 - [c52]Avik Chakraborti, Nilanjan Datta, Ashwin Jha, Cuauhtemoc Mancillas-López, Mridul Nandi:
Light-OCB: Parallel Lightweight Authenticated Cipher with Full Security. SPACE 2021: 22-41 - [i77]Avik Chakraborti, Nilanjan Datta, Ashwin Jha, Cuauhtemoc Mancillas López, Mridul Nandi:
Light-OCB: Parallel Lightweight Authenticated Cipher with Full Security. IACR Cryptol. ePrint Arch. 2021: 1535 (2021) - 2020
- [j37]Avik Chakraborti, Nilanjan Datta, Ashwin Jha, Cuauhtemoc Mancillas-López, Mridul Nandi, Yu Sasaki:
ESTATE: A Lightweight and Low Energy Authenticated Encryption Mode. IACR Trans. Symmetric Cryptol. 2020(S1): 350-389 (2020) - [j36]Avik Chakraborti, Nilanjan Datta, Ashwin Jha, Snehal Mitragotri, Mridul Nandi:
From Combined to Hybrid: Making Feedback-based AE even Smaller. IACR Trans. Symmetric Cryptol. 2020(S1): 417-445 (2020) - 2019
- [j35]Nilanjan Datta, Avijit Dutta, Mridul Nandi, Kan Yasuda:
sfDWCDM+: A BBB secure nonce based MAC. Adv. Math. Commun. 13(4): 705-732 (2019) - [j31]Avik Chakraborti, Nilanjan Datta, Ashwin Jha, Cuauhtemoc Mancillas-López, Mridul Nandi, Yu Sasaki:
INT-RUP Secure Lightweight Parallel AE Modes. IACR Trans. Symmetric Cryptol. 2019(4): 81-118 (2019) - [j30]Donghoon Chang, Nilanjan Datta, Avijit Dutta, Bart Mennink, Mridul Nandi, Somitra Sanadhya, Ferdinand Sibleyras:
Release of Unverified Plaintext: Tight Unified Model and Application to ANYDAE. IACR Trans. Symmetric Cryptol. 2019(4): 119-146 (2019) - [i66]Avik Chakraborti, Nilanjan Datta, Ashwin Jha, Cuauhtemoc Mancillas López, Mridul Nandi, Yu Sasaki:
Elastic-Tweak: A Framework for Short Tweak Tweakable Block Cipher. IACR Cryptol. ePrint Arch. 2019: 440 (2019) - [i63]Donghoon Chang, Nilanjan Datta, Avijit Dutta, Bart Mennink, Mridul Nandi, Somitra Sanadhya, Ferdinand Sibleyras:
Release of Unverified Plaintext: Tight Unified Model and Application to ANYDAE. IACR Cryptol. ePrint Arch. 2019: 1326 (2019) - 2018
- [j25]Avik Chakraborti, Nilanjan Datta, Mridul Nandi:
On the optimality of non-linear computations for symmetric key primitives. J. Math. Cryptol. 12(4): 241-259 (2018) - [j24]Avik Chakraborti, Nilanjan Datta, Mridul Nandi, Kan Yasuda:
Beetle Family of Lightweight and Secure Authenticated Encryption Ciphers. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2018(2): 218-241 (2018) - [j22]Nilanjan Datta, Avijit Dutta, Mridul Nandi, Goutam Paul:
Double-block Hash-then-Sum: A Paradigm for Constructing BBB Secure PRF. IACR Trans. Symmetric Cryptol. 2018(3): 36-92 (2018) - [c43]Nilanjan Datta, Avijit Dutta, Mridul Nandi, Kan Yasuda:
Encrypt or Decrypt? To Make a Single-Key Beyond Birthday Secure Nonce-Based MAC. CRYPTO (1) 2018: 631-661 - [i59]Nilanjan Datta, Avijit Dutta, Mridul Nandi, Kan Yasuda:
Encrypt or Decrypt? To Make a Single-Key Beyond Birthday Secure Nonce-Based MAC. IACR Cryptol. ePrint Arch. 2018: 500 (2018) - [i55]Nilanjan Datta, Avijit Dutta, Mridul Nandi, Goutam Paul:
Double-block Hash-then-Sum: A Paradigm for Constructing BBB Secure PRF. IACR Cryptol. ePrint Arch. 2018: 804 (2018) - [i54]Avik Chakraborti, Nilanjan Datta, Mridul Nandi, Kan Yasuda:
Beetle Family of Lightweight and Secure Authenticated Encryption Ciphers. IACR Cryptol. ePrint Arch. 2018: 805 (2018) - 2017
- [j16]Nilanjan Datta, Atul Luykx, Bart Mennink, Mridul Nandi:
Understanding RUP Integrity of COLM. IACR Trans. Symmetric Cryptol. 2017(2): 143-161 (2017) - [j14]Nilanjan Datta, Avijit Dutta, Mridul Nandi, Goutam Paul, Liting Zhang:
Single Key Variant of PMAC_Plus. IACR Trans. Symmetric Cryptol. 2017(4): 268-305 (2017) - [c39]Ritam Bhaumik, Nilanjan Datta, Avijit Dutta, Nicky Mouha, Mridul Nandi:
The Iterated Random Function Problem. ASIACRYPT (2) 2017: 667-697 - [c35]Avik Chakraborti, Nilanjan Datta, Mridul Nandi:
Practical Fault Attacks on Minalpher: How to Recover Key with Minimum Faults? SPACE 2017: 111-132 - [i50]Nilanjan Datta, Atul Luykx, Bart Mennink, Mridul Nandi:
Understanding RUP Integrity of COLM. IACR Cryptol. ePrint Arch. 2017: 431 (2017) - [i45]Nilanjan Datta, Avijit Dutta, Mridul Nandi, Goutam Paul, Liting Zhang:
Single Key Variant of PMAC_Plus. IACR Cryptol. ePrint Arch. 2017: 848 (2017) - [i44]Ritam Bhaumik, Nilanjan Datta, Avijit Dutta, Nicky Mouha, Mridul Nandi:
The Iterated Random Function Problem. IACR Cryptol. ePrint Arch. 2017: 892 (2017) - 2016
- [j10]Lilian Bossuet, Nilanjan Datta, Cuauhtemoc Mancillas-López, Mridul Nandi:
ELmD: A Pipelineable Authenticated Encryption and Its Hardware Implementation. IEEE Trans. Computers 65(11): 3318-3331 (2016) - [c33]Avik Chakraborti, Nilanjan Datta, Mridul Nandi:
INT-RUP Analysis of Block-cipher Based Authenticated Encryption Schemes. CT-RSA 2016: 39-54 - 2014
- [c28]Nilanjan Datta, Mridul Nandi:
ELmE: A Misuse Resistant Parallel Authenticated Encryption. ACISP 2014: 306-321 - [c24]Nilanjan Datta, Mridul Nandi:
Characterization of EME with Linear Mixing. IWSEC 2014: 221-239 - [c23]Nilanjan Datta, Mridul Nandi:
Equivalence between MAC, WCR and PRF for Blockcipher Based Constructions. ProvSec 2014: 300-308 - [i28]Nilanjan Datta, Mridul Nandi:
Characterization of EME with Linear Mixing. IACR Cryptol. ePrint Arch. 2014: 9 (2014) - 2013
- [i25]Nilanjan Datta, Mridul Nandi:
Equivalence between MAC and PRF for Blockcipher based Constructions. IACR Cryptol. ePrint Arch. 2013: 575 (2013) - [i24]Nilanjan Datta, Mridul Nandi:
Misuse Resistant Parallel Authenticated Encryptions. IACR Cryptol. ePrint Arch. 2013: 767 (2013)
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-09-19 00:33 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:
