Constructing Canonical Strategies for Parallel Implementation of Isogeny Based Cryptography

  • Aaron Hutchinson
  • Koray Karabina
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11356)


Isogeny based cryptographic systems are one of the very competitive systems that are potentially secure against quantum attacks. The run time of isogeny based systems are dominated by a sequence of point multiplications and isogeny computations performed over supersingular elliptic curves in a specific order. The order of the sequence play an important role in the run time of the algorithms, and an optimal strategy can be efficiently determined yielding the minimum cost among all possible choices when a single processor is in use. In this paper, we generalize this idea and propose new algorithms that determine strategies for K processors under two different parallelization models: Per-Curve Parallelization (PCP) and Consecutive-Curve Parallelization (CCP). We present several recursive formulation of canonical strategies and their cost under the PCP model. As a result, we show how to construct the best (optimal) strategies under the PCP model. For some cryptographically interesting parameters, we obtain up to 24% (for \(K=2\)), 40% (for \(K=4\)), and 51% (for \(K=8\)) theoretical speed ups over the optimal strategies with one processor. The more general CCP model offers a refinement of PCP, and yields up to 30% (for \(K=2\)), 47% (for \(K=4\)), and 55% (for \(K=8\)) theoretical speed ups over the optimal strategies with one processor.


SIDH Isogeny-based cryptography Parallelization 



The authors would like to thank our reviewers for their comments and corrections. Research reported in this paper was supported by the Army Research Office under the award number W911NF-17-1-0311. The content is solely the responsibility of the authors and does not necessarily represent the official views of the Army Research Office.


  1. 1.
    Costello, C., Hisil, H.: A simple and compact algorithm for SIDH with arbitrary degree isogenies. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10625, pp. 303–329. Springer, Cham (2017). Scholar
  2. 2.
    Costello, C., Longa, P., Naehrig, M.: Efficient algorithms for supersingular isogeny diffie-hellman. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9814, pp. 572–601. Springer, Heidelberg (2016). Scholar
  3. 3.
    De Feo, L., Jao, D., Plût, J.: Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies. J. Math. Cryptol. 8(3), 209–247 (2014)MathSciNetzbMATHGoogle Scholar
  4. 4.
    Faz-Hernández, A., López, J., Ochoa-Jiménez, E., Rodríguez-Henríquez, F.: A faster software implementation of the supersingular isogeny Diffie-Hellman key exchange protocol. IEEE Trans. Comput. 2017Google Scholar
  5. 5.
    Galbraith, S.D., Petit, C., Silva, J.: Identification protocols and signature schemes based on supersingular isogeny problems. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10624, pp. 3–33. Springer, Cham (2017). Scholar
  6. 6.
    Galbraith, S.D., Vercauteren, F.: Computational problems in supersingular elliptic curve isogenies. Quantum Inf. Process. 17(10), 265 (2018)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Koziel, B., Azarderakhsh, R., Kermani, M., Jao, D.: Post-quantum cryptography on FPGA based on Isogenies on elliptic curves. IEEE Trans. Circuits Syst. 64, 86–99 (2017)CrossRefGoogle Scholar
  8. 8.
    Koziel, B., Azarderakhsh, R., Mozaffari-Kermani, M.: fast hardware architectures for supersingular isogeny diffie-hellman key exchange on FPGA. In: Dunkelman, O., Sanadhya, S.K. (eds.) INDOCRYPT 2016. LNCS, vol. 10095, pp. 191–206. Springer, Cham (2016). Scholar
  9. 9.
    Moody, D., Shumow, D.: Analogues of Velu’s formulas for isogenies on alternate models of elliptic curves. Math. Comput. 85(300), 1929–1951 (2016)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  1. 1.Florida Atlantic UniversityBoca RatonUSA

Personalised recommendations