Abstract

The classical public-key schemes are based on number theory, such as integer factorization and discrete logarithm. In 1994, P.W. Shor proposed an algorithm to solve these problems in polynomial time using quantum computers. Recent advancements in quantum computing open the door to the possibility of developing quantum computers sophisticated enough to solve these problems. Post-quantum cryptography (PQC) is resistant against quantum attacks. The aim of this paper is to evaluate the performance of different post-quantum public-key schemes for constrained-resources smart mobile devices; and to give a comparison between the studied post-quantum schemes in terms of computational time, required memory, and power consumption.

Highlights

  • The classical public-key algorithms used today to secure user data and networking communications (e.g. Internet, mobile, etc.) are based on number theory

  • The RSA cryptosystem is based on integer factorization problem, and the Diffie-Hellman scheme is based on discrete logarithm problem

  • The aim of this paper is to survey the post-quantum public-key algorithms in regards to their efficient in smart mobiles. We evaluate their performance in terms of computational time, required memory, and power consumption

Read more

Summary

Introduction

The classical public-key algorithms used today to secure user data and networking communications (e.g. Internet, mobile, etc.) are based on number theory. The RSA cryptosystem is based on integer factorization problem, and the Diffie-Hellman scheme is based on discrete logarithm problem. In 1994, P.W. Shor [31] proposed an algorithm to solve these problems in polynomial time using quantum computers. In 2015, the National Security Agency (NSA) [27] announced that it is working with several partners to develop quantum-resistant encryption algorithms. In 2016, the NIST (National Institute of Standards and Technology) [29] has started the process of developing, evaluating, and standardizing one or more public-key post-quantum cryptographic algorithms. It’s crucial to re-evaluate the existing cryptographic schemes which are used to protect information, and to improve quantum-safe cryptography

Objectives
Discussion
Conclusion

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.