Novel public-key cryptosystem based on the problem of performing sequence of local complementations on the Paley graphs.

The security and robustness of the existing cryptographic models are ensured, thanks to algebraic or arithmetic problems such as the factorization problem, the discrete logarithm, and the quadratic residues. In this article, we consider the problem of performing sequence of local complementations on the Paley graphs. We then propose an effective novel public-key cryptosystem based on this problem. [ABSTRACT FROM AUTHOR]