Solving Elliptic Curve equation.

I have an equation Y square = X cube + aX + b mod p. Values of a, b, p and x are a= -3 b= 2455155546008943817740293915197451784769108058161191238065 p= 6277101735386680763835789423176059013767194773182842284081 x= 1894290318373708250692331360974342813437992324945519136768 I need to find value of Y corresponding to value of X. If first iteration does not solve Y, I have to increment X by one and solve again and so on till i find value of Y. How can this be possible ? Any help will be greatly appriciated.

[Rik]

What have you tried already? Show some code. Have a read here and here. It will greatly improve your chances of getting an answer.

Also: as far as I understand US law (which governs the use of this website/forum), it is not legal to discuss cryptography. I'm not a legal expert, nor a Mathworks employee, so make of this what you will.