I read some where in crypto.stackexchange answer (related to EC-SRP protocol) that there is pattern in points on elliptic curves, i.e. if given some points containing mix of correct and wrong points and all points are less than prime number (p), now my question is:
is it possible to identify the correct points if so what is that logic? Please someone explain (I am not an expert in ecc).
@fgrieu and @CodesInChaos: Thank you both for your answers and I understood your point but if x and y co-ordinates of a point are encrypted using a shared secret e.g. password like in encrypted key exchange, my question is that is there any other attack other than checking x or y value greater than prime p to derive password?
It appears from your answer that after decrypting the point (x, y) by a candidate password the equation allows easily determining if a point of given coordinates x,y valid or not and thus password can be derived after observing few transactions over a period of time, please confirm/clarify with some details?