Lightweight and Efficient Post Quantum Key Encapsulation Mechanism Based on Q-Problem
The Q-problem is a new lightweight and hard mathematical problem that resists quantum attacks. It depends on putting one known value and two unknown values per equation; whatever the operator, the Q-problem defines certain conditions between equations. This paper presents a new key exchange protocol based on the Q-problem. To protect secure end-to-end communication over a public transmission channel, the proposed mechanism consists of two rounds of exchanging totally random numbers, which ensure a shared secret key between two parties at the end. Security analysis proves the robustness of the proposal and experiments prove its lightness during implementation, making it a promising protocol of hybrid solutions and an assistive technique for the transition to the quantum era.
Authors
- Spyros Panagiotakis (ORCID: https://orcid.org/0000-0001-8091-6462)
- Konstantinos Κarampidis (ORCID: https://orcid.org/0000-0003-1643-8018)
- Muhamad Felemban (ORCID: https://orcid.org/0000-0001-6414-3391)
- Mostefa Kara (ORCID: https://orcid.org/0000-0002-5736-8039)
- Giorgos Papadourakis (ORCID: https://orcid.org/0000-0001-9090-9354)
- Mohammad Hammoudeh (ORCID: https://orcid.org/0000-0003-1058-0996)
Institutions
- King Fahd University of Petroleum and Minerals (SA)
- Hellenic Mediterranean University (GR)
Publication Details
- Journal
- Electronics
- Published
- 2025-02-13
- DOI
- https://doi.org/10.3390/electronics14040728
- Citations
- 7
- Primary Topic
- Cryptographic Implementations and Security
- Type
- article
- Field-Weighted Citation Impact
- 17.37