In the modern era, devices require cryptography to protect information against malicious behavior that could exploit and damage the user. To address this, various algorithms have been developed for different purposes. These algorithms leverage complex mathematical problems to make it computationally infeasible to break a system within a reasonable timeframe, even for powerful computers. However, the advent of quantum computers has the potential to significantly impact cryptography by rendering many traditional algorithms vulnerable to attacks. For example, Shor's Algorithm can break the factoring problem of RSA in polynomial time. In response, NIST initiated a process to solicit, evaluate, and standardize one or more quantum-resistant public-key cryptography algorithms.