Small scalar multiplication on Weierstrass curves using division polynomials

DOI10.4213/MVK406MaRDI QIDQ5042268zbMATH OpenOpenAlexWikidataFDO

Authors 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

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

Recommendations

• scientific article; zbMATH DE number 1612501
• Speeding up regular elliptic curve scalar multiplication without precomputation
• Scalar Multiplication on Elliptic Curves Defined over Fields of Small Odd Characteristic
• Fast point multiplication algorithms for binary elliptic curves with and without precomputation
• Fast Point Multiplication on Elliptic Curves without Precomputation

Cites work

• scientific article; zbMATH DE number 3948147 (Why is no real title available?)
• scientific article; zbMATH DE number 1962161 (Why is no real title available?)
• scientific article; zbMATH DE number 2114384 (Why is no real title available?)
• A normal form for elliptic curves
• Complete addition formulas for prime order elliptic curves
• Elliptic Curve Cryptosystems
• Exponent Recoding and Regular Exponentiation Algorithms
• Faster Addition and Doubling on Elliptic Curves
• New Composite Operations and Precomputation Scheme for Elliptic Curve Cryptosystems over Prime Fields
• New Point Addition Formulae for ECC Applications
• Random bipartite posets and extremal problems
• Speeding the Pollard and Elliptic Curve Methods of Factorization
• The Tate Pairing Via Elliptic Nets
• Twisted Edwards Curves

Cited in

(4)

• scientific article; zbMATH DE number 1612501 (Why is no real title available?)
• Scalar Multiplication on Elliptic Curves Defined over Fields of Small Odd Characteristic
• Efficient scalar multiplications for elliptic curve cryptosystems using mixed coordinates strategy and direct computations
• Public Key Cryptography – PKC 2004

Describes a project that uses

Uses Software

• EFD

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

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