King Fahd University of Petroleum and Minerals

Adnan A Gutub

Mohammad K Ibrahim

Lahouari Ghouti

The method of performing elliptic polynomial cryptography with elliptic polynomial hopping allows for the encryption of messages through elliptic polynomial cryptography, i.e., using elliptic polynomials with multi x-coordinates, and particularly with the utilization of elliptic polynomial hopping based upon both the elliptic polynomial and its twist, regardless of whether the elliptic polynomial and its twist are isomorphic with respect to one another. Each plaintext block is encrypted by a different elliptic polynomial, and the elliptic polynomials used are selected by an initial secret key and a random number generator. The method is particularly useful for symmetric encryption systems, and provides a block cipher fundamentally based upon a computationally hard problem.

Method of performing elliptic polynomial cryptography with elliptic polynomial hopping

Elliptic polynomial cryptography with secret key embedding is a method that allows for the encryption of messages through elliptic polynomial cryptography and, particularly, with the embedding of secret keys in the message bit string. The method of performing elliptic polynomial cryptography is based on the elliptic polynomial discrete logarithm problem. It is well known that an elliptic polynomial discrete logarithm problem is a computationally 'difficult' or 'hard' problem.

Elliptic polynomial cryptography with secret key embedding

The method of cipher block chaining using elliptic curve cryptography allows for the encryption of messages through elliptic curve cryptography and, particularly, with the performance of cipher block chaining utilizing both the elliptic curve and its twist, regardless of whether the elliptic curve and its twist are isomorphic with respect to one another. The method of performing elliptic curve cryptography is based on the elliptic curve discrete logarithm problem. It is well known that an elliptic curve discrete logarithm problem is a computationally 'difficult' or 'hard' problem.

Method of cipher block chaining using elliptic curve cryptography

The method of generating password protocols based upon elliptic polynomial cryptography provides for the generation of password protocols based on the elliptic polynomial discrete logarithm problem. It is well known that an elliptic polynomial discrete logarithm problem is a computationally 'difficult' or 'hard' problem.

Method of generating a password protocol using elliptic polynomial cryptography

The method of performing cipher block chaining using elliptic polynomial cryptography allows for the encryption of messages through elliptic polynomial cryptography and, particularly, with the utilization of cipher block chaining based upon both the elliptic polynomial and its twist, regardless of whether the elliptic polynomial and its twist are isomorphic with respect to one another. The method of performing cipher block chaining is based on the elliptic polynomial discrete logarithm problem. It is well known that an elliptic polynomial discrete logarithm problem is a computationally 'difficult' or 'hard' problem.

Growing community of inventors

Dhahran, Saudi Arabia

Adnan A Gutub