Speeding up Huff form of elliptic curves

DOI10.1007/s10623-018-0475-4zbMath1442.94044OpenAlexW2794936923WikidataQ130046893 ScholiaQ130046893MaRDI QIDQ1801095

Neriman Gamze Orhon, Huseyin Hisil

Publication date: 26 October 2018

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-018-0475-4

zbMATH Keywords

elliptic curvesparallel computationefficientscalar multiplication2-isogenyHuff curvesinversion-free point addition

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Elliptic curves (14H52) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (2)

An application of crypto cloud computing in social networks by cooperative game theory ⋮ Protecting ECC against fault attacks: the ring extension method revisited

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A complete set of addition laws for incomplete Edwards curves
• Diophantine problems in geometry and elliptic ternary forms
• Analogues of Vélu’s formulas for isogenies on alternate models of elliptic curves
• Twisted Hessian Curves
• Twisted Edwards Curves
• Twisted Edwards Curves Revisited
• Jacobi Quartic Curves Revisited
• Elliptic curves in Huff’s model
• Huff’s Model for Elliptic Curves
• Faster Addition and Doubling on Elliptic Curves

This page was built for publication: Speeding up Huff form of elliptic curves