Computing isogenies between supersingular elliptic curves over
C Delfs, SD Galbraith - Designs, Codes and Cryptography, 2016 - Springer
Abstract Let p> 3 p> 3 be a prime and let EE, E'E′ be supersingular elliptic curves over F _p
F p. We want to construct an isogeny ϕ: E → E'ϕ: E→ E′. The currently fastest algorithm for …
F p. We want to construct an isogeny ϕ: E → E'ϕ: E→ E′. The currently fastest algorithm for …
[引用][C] Computing isogenies between supersingular elliptic curves over F p
C Delfs, SD Galbraith - Designs, Codes and Cryptography, 2014 - cir.nii.ac.jp
Computing isogenies between supersingular elliptic curves over $${\mathbb {F}}_p$$ F p |
CiNii Research CiNii 国立情報学研究所 学術情報ナビゲータ[サイニィ] 詳細へ移動 検索フォームへ …
CiNii Research CiNii 国立情報学研究所 学術情報ナビゲータ[サイニィ] 詳細へ移動 検索フォームへ …
Computing isogenies between supersingular elliptic curves over Fp
C Delfs, SD Galbraith - Designs, Codes and Cryptography, 2016 - dl.acm.org
Let p> 3 p> 3 be a prime and let EE, E'E be supersingular elliptic curves over F _p Fp. We
want to construct an isogeny ϕ: E → E': EE. The currently fastest algorithm for finding …
want to construct an isogeny ϕ: E → E': EE. The currently fastest algorithm for finding …
[PDF][PDF] COMPUTING ISOGENIES BETWEEN SUPERSINGULAR ELLIPTIC CURVES OVER Fp
C DELFS, SD GALBRAITH - arXiv preprint arXiv:1310.7789, 2013 - Citeseer
Let p> 3 be a prime and let E, E′ be supersingular elliptic curves over Fp. We want to
construct an isogeny φ: E→ E′. The currently fastest algorithm for finding isogenies …
construct an isogeny φ: E→ E′. The currently fastest algorithm for finding isogenies …
Computing isogenies between supersingular elliptic curves over F_p
C Delfs, SD Galbraith - arXiv preprint arXiv:1310.7789, 2013 - arxiv.org
Let p> 3 be a prime and let E, E'be supersingular elliptic curves over F_p. We want to
construct an isogeny phi: E--> E'. The currently fastest algorithm for finding isogenies …
construct an isogeny phi: E--> E'. The currently fastest algorithm for finding isogenies …
Computing isogenies between supersingular elliptic curves over F p
C Delfs, SD Galbraith - Designs, Codes and Cryptography, 2016 - infona.pl
Let $$ p> 3$$ p> 3 be a prime and let $$ E $$ E, $$ E'$$ E′ be supersingular elliptic
curves over $${\mathbb {F}} _p $$ F p. We want to construct an isogeny $$\phi: E\rightarrow …
curves over $${\mathbb {F}} _p $$ F p. We want to construct an isogeny $$\phi: E\rightarrow …
Computing isogenies between supersingular elliptic curves over F_p
C Delfs, SD Galbraith - arXiv e-prints, 2013 - ui.adsabs.harvard.edu
Let p> 3 be a prime and let E, E'be supersingular elliptic curves over F_p. We want to
construct an isogeny phi: E--> E'. The currently fastest algorithm for finding isogenies …
construct an isogeny phi: E--> E'. The currently fastest algorithm for finding isogenies …
[PDF][PDF] COMPUTING ISOGENIES BETWEEN SUPERSINGULAR ELLIPTIC CURVES OVER Fp
C DELFS, SD GALBRAITH - arXiv preprint arXiv:1310.7789, 2013 - researchgate.net
Let p> 3 be a prime and let E, E′ be supersingular elliptic curves over Fp. We want to
construct an isogeny φ: E→ E′. The currently fastest algorithm for finding isogenies …
construct an isogeny φ: E→ E′. The currently fastest algorithm for finding isogenies …