Shirshendu Das
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Shirshendu Das has a total of 33 co-authors. Here are the top co-authors by number of shared publications:
- Jaspinder Kaur
Indian Institute of Technology Ropar, India
3 shared publications - Prabuddha Sinha
Department of CSE, Indian Institute of Technology Ropar, Bara Phool, India
3 shared publications - Venkata Kalyan Tavva
Indian Institute of Technology Ropar, Rupnagar, India
3 shared publications Atul Kumar
Department of CSE, Indian Institute of Technology Ropar, Rupnagar, India
2 shared publications- Krishna Prathik B.V.
RV College of Engineering Bangalore, Bangalore, India
2 shared publications - Palash Das
IIT Jodhpur
2 shared publications
Latest Publications
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 75 (11) , 4055-4068
Secure Hardware Accelerator for Resilience Against Adversarial Attacks in ViTs
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 75 (11) , 4055-4068
Secure Hardware Accelerator for Resilience Against Adversarial Attacks in ViTs
- 30 October 2025
- Published by Elsevier in Journal of Systems Architecture
- Vol. 170
Exploiting virtual channel allocation policies in STT-RAM buffers of NoC routers through hardware Trojan
- 30 October 2025
- Published by Elsevier in Journal of Systems Architecture
- Vol. 170
Exploiting virtual channel allocation policies in STT-RAM buffers of NoC routers through hardware Trojan
- 15 February 2025
- Published by Elsevier in Journal of Systems Architecture
- Vol. 161
SmartDeCoup: Decoupling the STT-RAM LLC for even write distribution and lifetime improvement
- 15 February 2025
- Published by Elsevier in Journal of Systems Architecture
- Vol. 161
SmartDeCoup: Decoupling the STT-RAM LLC for even write distribution and lifetime improvement
- 19 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Embedded Systems Letters
- Vol. 17 (3) , 172-175
TENDRA: Targeted Endurance Attack on STT-RAM LLC
Spin Transfer Torque RAM (STT-RAM) based Last Level Cache (LLC) offers significant benefits like high density and low refresh energy, but faces challenges like high write latency and limited endurance. Malicious attacks in a multi-core setup need access to only a single core to perform repeated attacks on specific memory locations that can lead to an accelerated lifetime degradation of the STT-RAM LLC cells. To highlight this vulnerability of STT-RAM LLC we propose two variations of TENDRA (Targeted Endurance Attack), namely, Recurring Location Attack (RLA) and Recurring Toggle Attack (RTA). Our work highlights the efficiency of these attacks on modern counter based wear leveling techniques and also the effect of wear leveling on these attacks.
- 19 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Embedded Systems Letters
- Vol. 17 (3) , 172-175
TENDRA: Targeted Endurance Attack on STT-RAM LLC
Spin Transfer Torque RAM (STT-RAM) based Last Level Cache (LLC) offers significant benefits like high density and low refresh energy, but faces challenges like high write latency and limited endurance. Malicious attacks in a multi-core setup need access to only a single core to perform repeated attacks on specific memory locations that can lead to an accelerated lifetime degradation of the STT-RAM LLC cells. To highlight this vulnerability of STT-RAM LLC we propose two variations of TENDRA (Targeted Endurance Attack), namely, Recurring Location Attack (RLA) and Recurring Toggle Attack (RTA). Our work highlights the efficiency of these attacks on modern counter based wear leveling techniques and also the effect of wear leveling on these attacks.
- Open Access
- 30 September 2024
- Published by Association for Computing Machinery (ACM)
- p. 89-103
PROLONG: Priority based Write Bypassing Technique for Longer Lifetime in STT-RAM based LLC
- 30 September 2024
- Published by Association for Computing Machinery (ACM)
- p. 89-103
Open AccessPROLONG: Priority based Write Bypassing Technique for Longer Lifetime in STT-RAM based LLC
- Open Access
- 15 January 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Design Automation of Electronic Systems
- Vol. 29 (2) , 1-22
RSPP: Restricted Static Pseudo-Partitioning for Mitigation of Cross-Core Covert Channel Attacks
Cache timing channel attacks exploit the inherent properties of cache memories: hit and miss time along with the shared nature of the cache to leak secret information. The side channel and covert channel are the two well-known cache timing channel attacks. In this article, we propose Restricted Static Pseudo-Partitioning (RSPP), an effective partition-based mitigation mechanism that restricts the cache access of only the adversaries involved in the attack. It has an insignificant impact of only 1% in performance, as the benign processes have access to the full cache and restrictions are limited only to the suspicious processes and cache sets. It can be implemented with a maximum storage overhead of 1.45% of the total Last-Level Cache (LLC) size. This article presents three variations of the proposed attack mitigation mechanism: RSPP, simplified-RSPP (S-RSPP) and corewise-RSPP (C-RSPP) with different hardware overheads. A full system simulator is used for evaluating the performance impact of RSPP. A detailed experimental analysis with different LLC and attack parameters is also discussed. RSPP is also compared with the existing defense mechanisms effective against cross-core covert channel attacks.
- 15 January 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Design Automation of Electronic Systems
- Vol. 29 (2) , 1-22
Open AccessRSPP: Restricted Static Pseudo-Partitioning for Mitigation of Cross-Core Covert Channel Attacks
Cache timing channel attacks exploit the inherent properties of cache memories: hit and miss time along with the shared nature of the cache to leak secret information. The side channel and covert channel are the two well-known cache timing channel attacks. In this article, we propose Restricted Static Pseudo-Partitioning (RSPP), an effective partition-based mitigation mechanism that restricts the cache access of only the adversaries involved in the attack. It has an insignificant impact of only 1% in performance, as the benign processes have access to the full cache and restrictions are limited only to the suspicious processes and cache sets. It can be implemented with a maximum storage overhead of 1.45% of the total Last-Level Cache (LLC) size. This article presents three variations of the proposed attack mitigation mechanism: RSPP, simplified-RSPP (S-RSPP) and corewise-RSPP (C-RSPP) with different hardware overheads. A full system simulator is used for evaluating the performance impact of RSPP. A detailed experimental analysis with different LLC and attack parameters is also discussed. RSPP is also compared with the existing defense mechanisms effective against cross-core covert channel attacks.
- 27 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Embedded Systems Letters
- Vol. 16 (3) , 263-266
HTree: Hardware Trojan Attack on Cache Resizing Policies
Modern Chipmultiprocessors (CMP) use third-party intellectual properties (IP) to reduce design costs and meet deadlines. The cores in the CMP has their own private cache memories and all the cores share a common large sized Last Level Cache (LLC). All the components of CMP including cores and cache memories are connected through a Network-on-Chip (NoC). Most of the NoC components have third-party IPs. Some of these IPs may be malicious and act as Hardware Trojan (HT). In this work, we propose an HT-base attack that targets the LLC resizing techniques. The LLC resizing techniques are used to reduce the energy consumption of the LLC by shutting down unused parts of the LLC. The proposed attack can misuse the properties of these resizing techniques to reduce their energy saving up to 58%. The proposed attack can also reduce the system performance up to 18%.
- 27 December 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Embedded Systems Letters
- Vol. 16 (3) , 263-266
HTree: Hardware Trojan Attack on Cache Resizing Policies
Modern Chipmultiprocessors (CMP) use third-party intellectual properties (IP) to reduce design costs and meet deadlines. The cores in the CMP has their own private cache memories and all the cores share a common large sized Last Level Cache (LLC). All the components of CMP including cores and cache memories are connected through a Network-on-Chip (NoC). Most of the NoC components have third-party IPs. Some of these IPs may be malicious and act as Hardware Trojan (HT). In this work, we propose an HT-base attack that targets the LLC resizing techniques. The LLC resizing techniques are used to reduce the energy consumption of the LLC by shutting down unused parts of the LLC. The proposed attack can misuse the properties of these resizing techniques to reduce their energy saving up to 58%. The proposed attack can also reduce the system performance up to 18%.
- 21 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Design & Test
- Vol. 40 (6) , 125-135
edAttack: Hardware Trojan Attack on On-Chip Packet Compression
In this article, the authors investigate the prospect of a new hardware trojan (HT) in Network-on-Chip (NoC) routers or network interfaces (NIs), targeting on-chip packet compression techniques.
- 21 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Design & Test
- Vol. 40 (6) , 125-135
edAttack: Hardware Trojan Attack on On-Chip Packet Compression
In this article, the authors investigate the prospect of a new hardware trojan (HT) in Network-on-Chip (NoC) routers or network interfaces (NIs), targeting on-chip packet compression techniques.
- 27 October 2022
- Published by Elsevier in Microprocessors and Microsystems
- Vol. 96
Variation aware power management for GPU memories
- 27 October 2022
- Published by Elsevier in Microprocessors and Microsystems
- Vol. 96
Variation aware power management for GPU memories
- 26 September 2022
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 34 (28)
WinDRAM: Weak rows as in‐DRAM cache
Summary: The primary factor responsible for increasing the refresh rate is the presence of weak rows in a DRAM. They have a shorter retention time and lose charge faster than regular rows. Recently, a technique known as in‐DRAM cache was introduced in which some DRAM rows act as a separate module. The in‐DRAM cache can be used for a variety of purposes in DRAM. We present WinDRAM, an in‐DRAM cache comprised of all the DRAM's weak rows. The most recently accessed rows are copied into the in‐DRAM cache so that when the row is accessed again, both rows (original and copy) can be activated at the same time. Such simultaneous activation reduces activation time and, as a result, DRAM access latency. Dual‐row activation is the term for this concept. Because weak rows are part of the in‐DRAM cache and are frequently accessed, WinDRAM does not perform a periodic refresh on them. Existing techniques based on in‐DRAM cache do not design the in‐DRAM cache using weak rows. WinDRAM proposes a novel idea by designing the in‐DRAM cache using weak rows. Because the weak rows do not need to be refreshed, the refresh interval of the remaining rows can be increased, resulting in a refresh rate reduction of 80% to 90%. The speedup is 15% to 25% faster than standard DRAM and 12.77% faster than previous work for high memory‐intensive workloads. Overall energy consumption is also reduced by 10% to 15%.
- 26 September 2022
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 34 (28)
WinDRAM: Weak rows as in‐DRAM cache
Summary: The primary factor responsible for increasing the refresh rate is the presence of weak rows in a DRAM. They have a shorter retention time and lose charge faster than regular rows. Recently, a technique known as in‐DRAM cache was introduced in which some DRAM rows act as a separate module. The in‐DRAM cache can be used for a variety of purposes in DRAM. We present WinDRAM, an in‐DRAM cache comprised of all the DRAM's weak rows. The most recently accessed rows are copied into the in‐DRAM cache so that when the row is accessed again, both rows (original and copy) can be activated at the same time. Such simultaneous activation reduces activation time and, as a result, DRAM access latency. Dual‐row activation is the term for this concept. Because weak rows are part of the in‐DRAM cache and are frequently accessed, WinDRAM does not perform a periodic refresh on them. Existing techniques based on in‐DRAM cache do not design the in‐DRAM cache using weak rows. WinDRAM proposes a novel idea by designing the in‐DRAM cache using weak rows. Because the weak rows do not need to be refreshed, the refresh interval of the remaining rows can be increased, resulting in a refresh rate reduction of 80% to 90%. The speedup is 15% to 25% faster than standard DRAM and 12.77% faster than previous work for high memory‐intensive workloads. Overall energy consumption is also reduced by 10% to 15%.