On division polynomial PIT and supersingularity

On division polynomial PIT and supersingularity
复制标题

关于除法多项式 PIT 和超奇异性

DOI:
--
复制
发表时间:
2018
期刊:
Applicable Algebra in Engineering, Communication and Computing
影响因子:
--
通讯作者:
Javad Doliskani
Javad Doliskani
中科院分区:
--
文献类型:
--
作者:
Javad Doliskani

文献摘要

被引文献

相似文献

For an elliptic curve E over a finite field Fqdocumentclass[12pt]{minimal} usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy} usepackage{mathrsfs} usepackage{upgreek} setlength{oddsidemargin}{-69pt} egin{document}$$mathbb {F}_q$$end{document}, where q is a prime power, we propose new algorithms for testing the supersingularity of E. Our algorithms are based on the polynomial identity testing problem for the p-th division polynomial of E. In particular, an efficient algorithm using points of high order on E is given.
For an elliptic curve E over a finite field Fqdocumentclass[12pt]{minimal} usepackage{amsmath} usepackage{wasysym} usepackage{amsfonts} usepackage{amssymb} usepackage{amsbsy} usepackage{mathrsfs} usepackage{upgreek} setlength{oddsidemargin}{-69pt} egin{document}$$mathbb {F}_q$$end{document}, where q is a prime power, we propose new algorithms for testing the supersingularity of E. Our algorithms are based on the polynomial identity testing problem for the p-th division polynomial of E. In particular, an efficient algorithm using points of high order on E is given.