The imminent commercialization of quantum computing technologies poses significant risks to classical encryption algorithms. In response, the National Institute of Standards and Technology is spearheading efforts to standardize robust Postquantum Cryptography (PQC) algorithms. This study focuses on the Multivariate Polynomial Public Key Digital Signature Trefoil Knot (MPPK/DSTK) algorithm, a notable advancement refactored from recent PQC developments, distinguished by its integration of true random numbers generated by quantum computers. To evaluate its integrity and robustness against deep learning-based brute force attacks, we introduced semi-covariance correlation analysis — a novel assessment method in this context — to explore the algorithm’s resilience by potentially narrowing the search space. Our analysis reveals that MPPK/DSTK exhibits superior performance, with lower semi-covariance and enhanced robustness compared to the traditional Rivest–Shamir–Adleman (RSA) public-key cryptosystem, especially with selected twin seed primes. We have made our developments accessible on GitHub, inviting the research community to engage in further comparative studies and collaborative enhancements. This study underscores the MPPK/DSTK algorithm’s potential as a formidable contender in the evolution of cryptography, offering a significant leap forward in securing digital communications against the quantum computing threat. Both public and private key size are minimized to cater the connected and autonomous vehicle applications, the computation cost is also minimized for Internet of Things usage as well.
Speaker(s): Jun (Steed) Huang
Agenda:
06:00 pm – Introductions, chapter business update, social interactions (you can arrive earlier if you like)
06:05 pm – Actual Talk
06:50 pm – Q&A, open discussion
07:00 pm – Formal thanks and event end
Virtual: https://events.vtools.ieee.org/m/416253