Paper 2024/645

Toward Independent Key Encryption based on Q-Problem

Abdelkader Laouid, LIAP Laboratory, PO Box 789, El Oued 39000 University of El Oued, Algeria
Mostefa Kara, National Higher School of Mathematics, Scientific and Technology Hub of Sidi Abdellah, Algiers 16093, Algeria
Mohammad Hammoudeh, Information and Computer Science Department, King Fahd University of Petroleum and Minerals, Academic Belt Road, Dhahran 31261, Saudi Arabia
Abstract

This paper defines a post-quantum encryption scheme based on discussion cryptography by introducing a new post-quantum hard problem called Q-Problem. The idea behind this scheme is to hide the keys of each entity, and the encryption process is based on secret message holders using only random private keys.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Preprint.
Keywords
Securityencryptionkey exchangequantum computinghard problem
Contact author(s)
abdelkader-laouid @ univ-eloued dz
karamostefa @ univ-eloued dz
mohammad hammoudeh @ kfupm edu sa
History
2024-04-29: approved
2024-04-27: received
See all versions
Short URL
https://ia.cr/2024/645
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2024/645,
      author = {Abdelkader Laouid and Mostefa Kara and Mohammad Hammoudeh},
      title = {Toward Independent Key Encryption based on Q-Problem},
      howpublished = {Cryptology {ePrint} Archive, Paper 2024/645},
      year = {2024},
      url = {https://eprint.iacr.org/2024/645}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.