The LLL algorithm is strong algorithm that decrypts the additional type Knapsack cryptosystem. However, the LLL algorithm
is not applicable in the addition in the group that rational points of elliptic curves on finite fields do. Therefore, we
think the Knapsack cryptosystem constructed on elliptic curves. By using the pairing for the decryption, it is shown to be
able to make the computational complexity of the decryption a polynomial time by making the decryption function by the
pairing values