Journal of Advances in Mathematics and Computer Science

In recent years, the rapid growth of wireless technologies and the widespread use of mobile devices have drawn people toward diverse web applications. Today, users can conveniently access a variety of online services anytime and anywhere through their mobile devices. With wireless communication becoming the dominant medium, security has emerged as a major challenge, since networks are widely exposed. To address this, numerous authentication protocols have been proposed. However, most existing protocols rely on integer factorization or discrete logarithm problems, which are vulnerable to polynomial-time quantum algorithms. This makes them unsuitable for a post-quantum era. To ensure secure wireless communications for mobile devices, there is a critical need for authenticated key agreement (AKA) protocols that withstand quantum attacks. In this work, we propose a two-party AKA protocol for mobile devices built upon the ring learning with errors (RLWE) problem, whose security is grounded in hard lattice assumptions. We analyze the security of our protocol using formal and informal security methods and assess its performance through comparative evaluation of computational and communication costs against related schemes. Our findings demonstrate that the proposed protocol achieves the necessary security requirements while providing efficient and reliable communication.