Elliptic curve cryptography arithmetic in terms of one variable polynomial division

DOI10.1080/09720529.2019.1702754MaRDI QIDQ5034523zbMATH OpenOpenAlexFDO

Authors Santoshi Pote, B. K. Lande, Virendra R. Sule

Publication date 18 February 2022

Published in Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/09720529.2019.1702754

zbMATH Keywords

elliptic curvefinite fieldpolynomial division

Mathematics Subject Classification ID

Applications to coding theory and cryptography of arithmetic geometry (14G50) Elliptic curves (14H52) Cryptography (94A60)

Recommendations

• The geometry of efficient arithmetic on elliptic curves
• Efficient arithmetic on elliptic curve cryptography
• scientific article; zbMATH DE number 2058638
• scientific article; zbMATH DE number 1088245
• Fast Point Multiplication on Elliptic Curves without Precomputation

Cites work

• Computational number theory
• Elliptic Curve Cryptosystems
• Elliptic curves. Number theory and cryptography
• Finite fields and applications
• Handbook of Elliptic and Hyperelliptic Curve Cryptography
• scientific article; zbMATH DE number 3937328 (Why is no real title available?)
• scientific article; zbMATH DE number 3948147 (Why is no real title available?)
• scientific article; zbMATH DE number 4023423 (Why is no real title available?)

Cited in

(1)

• Coding and Cryptography

This page was built for publication: Elliptic curve cryptography arithmetic in terms of one variable polynomial division

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