Delaying and Merging Operations in Scalar Multiplication: Applications to Curve-Based Cryptosystems

DOI10.1007/978-3-540-74462-7_15MaRDI QIDQ5429161zbMATH OpenOpenAlexFDO

Authors Roberto Maria Avanzi

Publication date 29 November 2007

Published in Selected Areas in Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-74462-7_15

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Sublinear scalar multiplication on hyperelliptic Koblitz curves
• Fast scalar multiplications on hyperelliptic curve cryptosystems
• Koblitz curve cryptosystems
• Speeding up regular elliptic curve scalar multiplication without precomputation
• scientific article; zbMATH DE number 1962162

Cited in

(6)

• Sublinear scalar multiplication on hyperelliptic Koblitz curves
• A duality in space usage between left-to-right and right-to-left exponentiation
• Faster and lower memory scalar multiplication on supersingular curves in characteristic three
• Highly Regular Right-to-Left Algorithms for Scalar Multiplication
• Another Look at Square Roots (and Other Less Common Operations) in Fields of Even Characteristic
• Redundant \(\tau \)-adic expansions. I: Non-adjacent digit sets and their applications to scalar multiplication

This page was built for publication: Delaying and Merging Operations in Scalar Multiplication: Applications to Curve-Based Cryptosystems

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