Small scalar multiplication on Weierstrass curves using division polynomials
DOI10.4213/MVK406zbMATH Open1497.11165OpenAlexW4285813273WikidataQ114021138 ScholiaQ114021138MaRDI QIDQ5042268FDOQ5042268
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
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
Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Curves over finite and local fields (11G20) Number-theoretic algorithms; complexity (11Y16)
Cites Work
- Twisted Edwards Curves
- Title not available (Why is that?)
- 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
- Exponent Recoding and Regular Exponentiation Algorithms
- Title not available (Why is that?)
- New Composite Operations and Precomputation Scheme for Elliptic Curve Cryptosystems over Prime Fields
- New Point Addition Formulae for ECC Applications
- The Tate Pairing Via Elliptic Nets
- Title not available (Why is that?)
- Complete addition formulas for prime order elliptic curves
- Random bipartite posets and extremal problems
Cited In (4)
Uses Software
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)
