Foundations of Quantum Resistant Cryptography

Following the NIST (National Institute of Standards and Technology) PQC proposal submissions and rounds, we have been investigating the mathematical foundations of the algorithms, real-time implementation, hardware architecture, open problems, attack vectors, and crypto-agility.

We have been examining their performance, parallelism, security under worst-case intractability assumptions, memory utilization, and latency. Our algorithmic and system work includes lightweight lattice-based cryptography, ultra-low latency, and seamless integration with the existing infrastructure.

Algorithm Design

Open-Source Hardware Implementation of PQC Primitives

We introduce a set of FPGA-based post-quantum cryptographic (PQC) primitives for the frequently used security protocols. This hardware tool has (1) FPGA-tailored implementations, (2) algorithmic optimizations to reduce area and latency costs without compromising security, and (3) open-sourcing the synthesizable and fully verifiable code. The RTL code base is fully parameterizable with an efficient, n-point Number-Theoretic Transform (NTT) module for fast polynomial multiplications.

Hardware Designs

Privacy-Perserving Computing Solutions

The rise of connected and sensor-based devices have led to cloud computing being used as a commodity technology service.

One of the key persistent challenge with cloud-based computation is data privacy. Sensitive data is stored and computed over the cloud, which at most times, is a shared resource. Currently there are more than 2,500 cloud vulnerabilities - a 150% increase just in the last five years.

Explore Solutions