PERFORMANCE OF OPTIMIZED POST- QUANTUM HASH BASED CRYPTOGRAPHY USING QPQ-CD ON 5G NETWORK AUTHENTICATION KEY AGREEMENT

Telecommunication engineering

The QPQ-CD (Quantum and PostQuantum CipherKey Dynamic uses a dynamic key after the registration of the mobile at the 5G Network. The algorithm could be divided in two parts : The Quantum Cryptography (QC) and Post Quantum Cryptography (PQC) . The Post Quantum Cryptography will use 12 families of algorithms which are duplicate algorithm of : MD45, MD45xor, MD54, MD54xor, SHA256, SHA256xor for treating the 2 output QHT separately and QAT of the Quantum algorithm. Before the selector of the next key, the 12 keys of 256 bits are optimized of one bit change and selected the best effective probability. It will be based on probability by the extremity, probability of proximity, probability of a bit changed, and probability of disorder or binary entropy and probability of penalties. According to the order of its probabilities, the following key after QPQ-CD thus has the behavior: very far from the ends of the key (00 ... 000 and 11 ... 111); very far from the previous key; several bits changed and very messy from the point of view bit zero and bit one and the penalty of bad extremity proximity. All key chosen keys have a probability by the extremity and proximity between 50% until 100%. The probability of the bit changed is to 50%, the entropy is near 100%. The result is only obtained if the system uses optimization of one bit changed. Any chart representative also permits to include all 12 keys obtained after the Post Quantum algorithm have all chance to be selected by the system. So all varieties of PostQuantum Cryptography is necessary to be implemented on the QPQ-CD. All the result is simulated with Matlab.

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.