Encryption Algorithm with Quadratic Polynomial

A quadratic polynomial is a parabola in the plane. By setting parameters, it is possible to make the parabola a monotonically increasing function within a certain interval of the first quadrant. The horizontal and vertical coordinates of a point on the parabolic curve in the first quadrant correspond one-to-one. If a large positive integer horizontal axis is used to represent the plaintext to be encrypted, by setting appropriate parameters, the vertical axis of the corresponding unique point on the parabola is also a positive integer representing the ciphertext, thus achieving encryption. On the contrary, if a large integer's y-axis represents the ciphertext, then the x-axis corresponding to its unique point on the corresponding parabola can be found, which is also a large positive integer representing the plaintext, thus achieving data decryption. Because ciphertext is a large positive integer with minimal repetition, it is impossible to analyze ciphertext using probability. This algorithm increases the key space, thereby increasing the difficulty of brute force cracking. The key space of this algorithm is theoretically infinite, which increases the difficulty of brute force cracking.