On division polynomial PIT and supersingularity

DOI10.1007/S00200-018-0349-ZMaRDI QIDQ1623917zbMATH OpenOpenAlexFDO

Authors Javad Doliskani

Publication date 15 November 2018

Published in Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1801.02664

zbMATH Keywords

elliptic curvesdivision polynomialspolynomial identity testing

Mathematics Subject Classification ID

Cryptography (94A60) Curves over finite and local fields (11G20) Number-theoretic algorithms; complexity (11Y16) Applications to coding theory and cryptography of arithmetic geometry (14G50) Elliptic curves (14H52)

Abstract: For an elliptic curve $E$ over a finite field $F_q$, 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 (PIT) problem for the $p$-th division polynomial of $E$. In particular, an efficient algorithm using points of high order on $E$ is given.

Recommendations

• Identifying supersingular elliptic curves
• On the \(p\)-th division polynomial
• A primality test algorithm using supersingular elliptic curves
• Improved supersingularity testing of elliptic curves using Legendre form
• Division polynomials of elliptic curves over finite fields

Cites work

• scientific article; zbMATH DE number 3977160 (Why is no real title available?)
• scientific article; zbMATH DE number 3651744 (Why is no real title available?)
• scientific article; zbMATH DE number 2018401 (Why is no real title available?)
• A generalisation of Artin's conjecture for primitive roots
• Constructing supersingular elliptic curves
• Cryptographic hash functions from expander graphs
• Elements of high order on finite fields from elliptic curves
• Elements of large order on varieties over prime finite fields
• Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
• Elliptic curves. Number theory and cryptography
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Fast construction of irreducible polynomials over finite fields
• Identifying supersingular elliptic curves
• Isogeny-based quantum-resistant undeniable signatures
• Modern computer algebra
• On Artin's conjecture.
• On the order of points on curves over finite fields
• Progress on polynomial identity testing
• The Arithmetic of Elliptic Curves
• Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies

Cited in

(5)

• Effective pairings in isogeny-based cryptography
• Identifying supersingular elliptic curves
• Improved supersingularity testing of elliptic curves using Legendre form
• On the \(p\)-th division polynomial
• Division polynomials on the Hessian model of elliptic curves

Describes a project that uses

Uses Software

• SageMath
• PARI/GP
• NTL

This page was built for publication: On division polynomial PIT and supersingularity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1623917)