supersingular isogeny-based cryptosystems are strong contenders for post-quantum cryptography standardization. such cryptosystems rely on the hardness of path-finding on supersingular isogeny graphs. the path-finding problem is known to reduce to the endomorphism ring problem. can path-finding be reduced to knowing just one endomorphism? in this talk, we give explicit classical and quantum algorithms for path-finding to an initial curve using the knowledge of one endomorphism. an endomorphism gives an orientation of a supersingular elliptic curve. we use the theory of oriented supersingular isogeny graphs and algorithms for taking ascending/descending/horizontal steps on such graphs.