Small scalar multiplication on Weierstrass curves using division polynomials

DOI10.4213/mvk406zbMath1497.11165OpenAlexW4285813273WikidataQ114021138 ScholiaQ114021138MaRDI QIDQ5042268

Sergey Agievich, S. V. Poruchnik, Vladimir I. Semenov

Publication date: 19 October 2022

Published in: Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography] (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/mvk406

zbMATH Keywords

elliptic curvescalar multiplicationdivision polynomialshort Weierstrass form

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Curves over finite and local fields (11G20)

Uses Software

• EFD

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Random bipartite posets and extremal problems
• Complete Addition Formulas for Prime Order Elliptic Curves
• Twisted Edwards Curves
• Exponent Recoding and Regular Exponentiation Algorithms
• Speeding the Pollard and Elliptic Curve Methods of Factorization
• Elliptic Curve Cryptosystems
• Faster Addition and Doubling on Elliptic Curves
• A normal form for elliptic curves
• New Point Addition Formulae for ECC Applications
• The Tate Pairing Via Elliptic Nets
• New Composite Operations and Precomputation Scheme for Elliptic Curve Cryptosystems over Prime Fields

This page was built for publication: Small scalar multiplication on Weierstrass curves using division polynomials