Equilibrium SAT based PQC: New aegis against quantum computing

TL;DR

This paper presents a new quantum-resistant public-key cryptography algorithm based on SAT problems, offering faster performance, simplicity, and scalability compared to existing methods, suitable for diverse devices.

Contribution

Introduces a novel SAT-based cryptographic algorithm that is faster, device-agnostic, and easily extendable into a scalable quantum-resistant cryptosystem.

Findings

Significantly faster than existing public-key algorithms

Does not require big numbers, enabling device versatility

Can be extended into a multi-key quantum-resistant system

Abstract

Public-key cryptography algorithms have evolved towards increasing computational complexity to hide desired messages, which is accelerating with the development of the Internet and quantum computing. This paper introduces a novel public-key cryptography algorithm that generates ciphertexts by counting the number of elements in randomly extracted subsets from a multiset. After explaining the novel cryptographic concept, the process of mathematically refining it using satisfiability problems is described. The advantages of the proposed algorithm are: first, it is significantly faster than other public-key algorithms; second, it does not require big numbers, making it executable on any devices; and third, it can be easily extended into a public-key cryptosystem using a single public key and multiple private keys while maintaining quantum resistance.