Given a Montgomery curve over some finite field $K$ in the form $E/K: by^2 = x^3 + ax^2 + x$ and using $E(K)$ for the $K$-rational points. I've just read that the number of points in $E(K)$ is always divisible by 4.
This is from crypto and usually it is assumed that $\operatorname{char}(K) \neq 2$ and $\neq 3$. In this specific case we also have $K = \mathbb{F}_{p^2}$ for some prime $p$.
Can somebody tell me why this is the case or if I have overlooked something?
Quoting from: Montgomery: Speeding the Pollard and Elliptic Curve Methods of Factorization, Mathematics of Computation, Volume 48. Number 177, January 1987, pages 243–264:
For easier understanding, note that:
Following the quoted snippet, further conditions are mentioned, given by Suyama, ensuring the existence of points of order $3$, hence of group order divisible by $12$.