Somitra Kumar Sanadhya
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
Somitra Kumar Sanadhya has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
- Arpan Jati
Nanyang Technological University
5 shared publications - Donghoon Chang
Indraprastha Institute of Information Technology, Delhi (IIIT-D)
4 shared publications - Anupam Chattopadhyay
Nanyang Technological University, Singapore, Singapore, Singapore
3 shared publications - Dip Sankar Banerjee
Indian Institute of Technology Jodhpur, Jodhpur, Rajasthan, INDIA
3 shared publications - Naina Gupta
Nanyang Technological University
3 shared publications - Sweta Mishra
Shiv Nadar University
3 shared publications
Latest Publications
- 1 October 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. 34 (10) , 3106-3115
Sparse-Aware Hardware Acceleration for CRYSTALS-Dilithium: Exploiting Challenge Polynomial Sparsity
- 1 October 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Very Large Scale Integration (VLSI) Systems
- Vol. 34 (10) , 3106-3115
Sparse-Aware Hardware Acceleration for CRYSTALS-Dilithium: Exploiting Challenge Polynomial Sparsity
- 2 July 2026
- Published by Springer Nature
- p. 27-41
PACE: A Power-Aware Clock Enhancement Technique for CRYSTALS-Kyber on FPGA
- 2 July 2026
- Published by Springer Nature
- p. 27-41
PACE: A Power-Aware Clock Enhancement Technique for CRYSTALS-Kyber on FPGA
- 9 December 2024
- Published by Springer Nature
- p. 6-15
SideLink: Exposing NVLink to Covert and Side-Channel Attacks Official Work-in-Progress Paper
- 9 December 2024
- Published by Springer Nature
- p. 6-15
SideLink: Exposing NVLink to Covert and Side-Channel Attacks Official Work-in-Progress Paper
- 3 April 2024
- Published by Springer Nature
- p. 38-56
EFFLUX-F2: A High Performance Hardware Security Evaluation Board
- 3 April 2024
- Published by Springer Nature
- p. 38-56
EFFLUX-F2: A High Performance Hardware Security Evaluation Board
- Open Access
- 27 March 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
- Vol. 23 (2) , 1-25
A Configurable CRYSTALS-Kyber Hardware Implementation with Side-Channel Protection
In this work, we present a configurable and side channel resistant implementation of the post-quantum key-exchange algorithm CRYSTALS-Kyber . The implemented design can be configured for different performance and area requirements leading to different trade-offs for different applications. A low area implementation can be achieved in 5,269 LUTs and 2,422 FFs, whereas a high performance implementation required 7,151 LUTs and 3,730 FFs. Due to a deeply pipelined architecture, a high operating speed of more than 250 MHz could be achieved on 28nm Xilinx FPGAs. The side channel resistance is implemented using a carefully chosen set of novel and known techniques such as Fault Detection Hashes, Instruction Randomization, FSM Protection and so on. resulting in a low overhead of less than 5% while being highly configurable. To the best of our knowledge, this work presents the first side-channel and fault attack protected configurable accelerator for CRYSTALS-Kyber . Using TVLA (test vector leakage assessment), we validate the implemented protection techniques and demonstrate that the design does not leak information even after 200 K traces. Furthermore, one of the configuration choices results in the smallest hardware implementation of CRYSTALS-Kyber known in the literature.
- 27 March 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
- Vol. 23 (2) , 1-25
Open AccessA Configurable CRYSTALS-Kyber Hardware Implementation with Side-Channel Protection
In this work, we present a configurable and side channel resistant implementation of the post-quantum key-exchange algorithm CRYSTALS-Kyber . The implemented design can be configured for different performance and area requirements leading to different trade-offs for different applications. A low area implementation can be achieved in 5,269 LUTs and 2,422 FFs, whereas a high performance implementation required 7,151 LUTs and 3,730 FFs. Due to a deeply pipelined architecture, a high operating speed of more than 250 MHz could be achieved on 28nm Xilinx FPGAs. The side channel resistance is implemented using a carefully chosen set of novel and known techniques such as Fault Detection Hashes, Instruction Randomization, FSM Protection and so on. resulting in a low overhead of less than 5% while being highly configurable. To the best of our knowledge, this work presents the first side-channel and fault attack protected configurable accelerator for CRYSTALS-Kyber . Using TVLA (test vector leakage assessment), we validate the implemented protection techniques and demonstrate that the design does not leak information even after 200 K traces. Furthermore, one of the configuration choices results in the smallest hardware implementation of CRYSTALS-Kyber known in the literature.
- 30 September 2023
- Published by Springer Nature
- p. 583-597
Square Attacks on Reduced-Round FEA-1 and FEA-2
- 30 September 2023
- Published by Springer Nature
- p. 583-597
Square Attacks on Reduced-Round FEA-1 and FEA-2
- 29 November 2022
- Published by Springer Nature
- p. 85-105
Implementing Grover Oracle for Lightweight Block Ciphers Under Depth Constraints
- 29 November 2022
- Published by Springer Nature
- p. 85-105
Implementing Grover Oracle for Lightweight Block Ciphers Under Depth Constraints
- 30 June 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 68 (12) , 8268-8279
On the Structure of Format Preserving Sets in the Diffusion Layer of Block Ciphers
In 2016, Chang et al. proposed a Format Preserving Encryption (FPE) scheme over a finite field and used an MDS matrix in the diffusion layer of the scheme for optimal diffusion. Later that year, Gupta et al. defined an algebraic structure named Format Preserving Set (FPS) is the diffusion layer of an FPE scheme. In 2018, Barua et al. showed that it is not possible to construct an FPS over a finite field in the diffusion layer of an FPE scheme if the cardinality of the set is not a power of prime. They extended the search of FPS over a finite commutative ring R and showed that if an FPS S ⊆ R is closed under addition then it gets module structure over some subring of R. Moreover, in this case, the only possible cardinalities of FPS are some power of the cardinalities of subrings when the module is free. The purpose of this article is twofold. Firstly, we show that it is possible to construct format preserving sets over a finite commutative ring which are not closed under addition. Secondly, we search for format preserving sets and MDS matrices over torsion modules. We provide examples of format preserving sets of cardinalities 26 and 52 over torsion modules and rings. These cardinalities are interesting because they correspond to the set of English alphabets, without and with capitalization. By considering a finite Abelian group as a torsion module over a PID, we show that a matrix M with entries from the PID is MDS if and only if M is MDS under the projection map on the same Abelian group.
- 30 June 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 68 (12) , 8268-8279
On the Structure of Format Preserving Sets in the Diffusion Layer of Block Ciphers
In 2016, Chang et al. proposed a Format Preserving Encryption (FPE) scheme over a finite field and used an MDS matrix in the diffusion layer of the scheme for optimal diffusion. Later that year, Gupta et al. defined an algebraic structure named Format Preserving Set (FPS) is the diffusion layer of an FPE scheme. In 2018, Barua et al. showed that it is not possible to construct an FPS over a finite field in the diffusion layer of an FPE scheme if the cardinality of the set is not a power of prime. They extended the search of FPS over a finite commutative ring R and showed that if an FPS S ⊆ R is closed under addition then it gets module structure over some subring of R. Moreover, in this case, the only possible cardinalities of FPS are some power of the cardinalities of subrings when the module is free. The purpose of this article is twofold. Firstly, we show that it is possible to construct format preserving sets over a finite commutative ring which are not closed under addition. Secondly, we search for format preserving sets and MDS matrices over torsion modules. We provide examples of format preserving sets of cardinalities 26 and 52 over torsion modules and rings. These cardinalities are interesting because they correspond to the set of English alphabets, without and with capitalization. By considering a finite Abelian group as a torsion module over a PID, we show that a matrix M with entries from the PID is MDS if and only if M is MDS under the projection map on the same Abelian group.
- 12 April 2022
- Published by Elsevier in Forensic Science International: Digital Investigation
- Vol. 41
FbHash-E: A time and memory efficient version of FbHash similarity hashing algorithm
- 12 April 2022
- Published by Elsevier in Forensic Science International: Digital Investigation
- Vol. 41
FbHash-E: A time and memory efficient version of FbHash similarity hashing algorithm
- Open Access
- 9 February 2022
- Published by Institution of Engineering and Technology (IET) in IET Circuits, Devices & Systems
- Vol. 16 (5) , 382-398
Field Programmable Gate Array based elliptic curve Menezes‐Qu‐Vanstone key agreement protocol realization using Physical Unclonable Function and true random number generator primitives
The trust, authenticity and integrity of Internet‐of‐Things (IoT) systems are heavily reliant on Physical Unclonable Functions (PUFs) and True random number generators (TRNGs). The PUF and TRNG produce device intrinsic digital signatures and random binary sequences, which are used for cryptographic key generation, key agreement/exchange, device authentication, cloning prevention etc. This article reports an efficient Field Programmable Gate Array (FPGA)‐based realization of elliptic curve Menezes‐Qu‐Vanstone (ECMQV)‐authenticated key agreement protocol using PUF and TRNG with very competitive area‐throughput trade‐offs. The key agreement protocols, which establish a shared secret key between two IoT devices, make use of PUF and TRNG primitives for the long‐ and short‐term secret keys generation while the elliptic curve is employed for public key generated from the corresponding secret key. The performance of the protocol is investigated on FPGAs. The authors' implementation of the ECMQV protocol takes 1.802 ms using 18852 slices on Artix‐7 FPGA.
- 9 February 2022
- Published by Institution of Engineering and Technology (IET) in IET Circuits, Devices & Systems
- Vol. 16 (5) , 382-398
Open AccessField Programmable Gate Array based elliptic curve Menezes‐Qu‐Vanstone key agreement protocol realization using Physical Unclonable Function and true random number generator primitives
The trust, authenticity and integrity of Internet‐of‐Things (IoT) systems are heavily reliant on Physical Unclonable Functions (PUFs) and True random number generators (TRNGs). The PUF and TRNG produce device intrinsic digital signatures and random binary sequences, which are used for cryptographic key generation, key agreement/exchange, device authentication, cloning prevention etc. This article reports an efficient Field Programmable Gate Array (FPGA)‐based realization of elliptic curve Menezes‐Qu‐Vanstone (ECMQV)‐authenticated key agreement protocol using PUF and TRNG with very competitive area‐throughput trade‐offs. The key agreement protocols, which establish a shared secret key between two IoT devices, make use of PUF and TRNG primitives for the long‐ and short‐term secret keys generation while the elliptic curve is employed for public key generated from the corresponding secret key. The performance of the protocol is investigated on FPGAs. The authors' implementation of the ECMQV protocol takes 1.802 ms using 18852 slices on Artix‐7 FPGA.