1. Bostan, A., Morain, F., Salvy, B., Schost, É.: Fast algorithms for computing isogenies between elliptic curves. Math. Comp. 77(263), 1755–1778 (2008)
2. Bröker, R.: Constructing supersingular elliptic curves. J. Comb. Number Theory 1(3), 269–273 (2009)
3. Lecture Notes in Computer Science;R. Canetti,2001
4. Charles, D., Lauter, K., Goren, E.: Cryptographic hash functions from expander graphs. Journal of Cryptology 22, 93–113 (2009)
5. Childs, A., Jao, D., Soukharev, V.: Constructing elliptic curve isogenies in quantum subexponential time (2010), http://arxiv.org/abs/1012.4019/