Abstract In supersingular isogeny-based cryptography, the path-finding problem reduces to endomorphism ring problem. Can be reduced knowing just one endomorphism? It is known that a small degree enables polynomial-time and computation (in: Love Boneh, ANTS XIV-Proceedings of Fourteenth Algorithmic Number Theory Symposium, volume 4 Open Book Ser. Math. Sci. Publ., Berkeley, 2020). An gives an ex...