Research Projects

Post-quantum Cryptography Security and Performance

Cryptography is the core building block in providing security to digital communications and enabling secure internet networking. The security of cryptographic algorithms relies on the underlying computational hardness problems like integer factorization (used in RSA) and discrete logarithm (used in Elliptic Curve Cryptography) problems. Quantum computing threatens to solve integer factorization and discrete logarithm problems in polynomial time using Shor's algorithm. To prepare for the quantum era and withstand the attacks equipped with quantum computing, the security and cryptography communities are designing new quantum-resistant public-key ciphers. Digital networking protocols must transition to using these new quantum-resistant or post-quantum cryptography (PQC) ciphers for secure internet networking in the quantum era. Transitioning to the PQC cipher use in digital networking protocols without analyzing the performance overheads and memory requirements has the potential to disrupt internet networking. My research investigates the performance impacts and security vulnerabilities associated with the transition to PQC. My research focuses on developing schemes to enable secure transition to PQC and protect digital communications in the quantum era.