On the performance of hyperelliptic cryptosystems

DOI10.1007/3-540-48910-X_12MaRDI QIDQ4250782zbMATH OpenFDO

Authors N. P. Smart

Publication date 19 June 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48910-X_12

zbMATH Keywords

cryptosystemsdigital signature schemeshyperelliptic curves

Mathematics Subject Classification ID

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

Review text

The author discusses the merits of hyperelliptic cryptosystems and digital signature schemes over their elliptic counterparts. The main conclusion is that hyperelliptic curves offer no performance advantage over elliptic curves. For the entire collection see [Zbl 0912.00038].

Recommendations

• Secure hyperelliptic cryptosystems and their performance
• scientific article; zbMATH DE number 2164328
• Hyperelliptic Pairings
• Hyperelliptic Curve Cryptosystems: Closing the Performance Gap to Elliptic Curves
• A comparison of different finite fields for elliptic curve cryptosystems

Cited in

(8)

• Constructive and destructive facets of Weil descent on elliptic curves
• Bilevel programming and applications
• Hyperelliptic curves for the vector decomposition problem over fields of even characteristic
• scientific article; zbMATH DE number 1950344 (Why is no real title available?)
• Hyperelliptic Curve Cryptosystems: Closing the Performance Gap to Elliptic Curves
• AN EFFICIENT METHOD FOR IMPROVING THE COMPUTATIONAL PERFORMANCE OF THE CUBIC LUCAS CRYPTOSYSTEM
• A review on the isomorphism classes of hyperelliptic curves of genus 2 over finite fields admitting a Weierstrass point
• Eta pairing computation on general divisors over hyperelliptic curves \(y^2=x^p - x+d\)

This page was built for publication: On the performance of hyperelliptic cryptosystems

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