most citedA Unified Hardware Accelerator for Fast Fourier Transform and Number Theoretic Transform

8 citations · 19 across the 6 of their papers we have counts for

collaborators

6 papers

cs.CR2025

Fast Plaintext-Ciphertext Matrix Multiplication from Additively Homomorphic Encryption

Krishna Sai Tarun Ramapragada, Utsav Banerjee

Plaintext-ciphertext matrix multiplication (PC-MM) is an indispensable tool in privacy-preserving computations such as secure machine learning and encrypted signal processing. Whil…

cs.CR2025★ 8 cited

A Unified Hardware Accelerator for Fast Fourier Transform and Number Theoretic Transform

Rishabh Shrivastava, Chaitanya Prasad Ratnala, Durga Manasa Puli +1

The Number Theoretic Transform (NTT) is an indispensable tool for computing efficient polynomial multiplications in post-quantum lattice-based cryptography. It has strong resemblan…

cs.CR2025★ 3 cited

A High-Performance Curve25519 and Curve448 Unified Elliptic Curve Cryptography Accelerator

Aniket Banerjee, Utsav Banerjee

In modern critical infrastructure such as power grids, it is crucial to ensure security of data communications between network-connected devices while following strict latency crit…

cs.ET2025★ 5 cited

pc-COP: An Efficient and Configurable 2048-p-Bit Fully-Connected Probabilistic Computing Accelerator for Combinatorial Optimization

Kiran Magar, Shreya Bharathan, Utsav Banerjee

Probabilistic computing is an emerging quantum-inspired computing paradigm capable of solving combinatorial optimization and various other classes of computationally hard problems.…

cs.CR2025★ 3 cited

Privacy-Preserving Edge Computing from Pairing-Based Inner Product Functional Encryption

Utsav Banerjee

Pairing-based inner product functional encryption provides an efficient theoretical construction for privacy-preserving edge computing secured by widely deployed elliptic curve cry…

cs.ET2023

QuBEC: Boosting Equivalence Checking for Quantum Circuits with QEC Embedding

Chao Lu, Navnil Choudhury, Utsav Banerjee +2

Quantum computing has proven to be capable of accelerating many algorithms by performing tasks that classical computers cannot. Currently, Noisy Intermediate Scale Quantum (NISQ) m…