Some Improved Algorithms for Hyperelliptic Curve Cryptosystems Using Degenerate Divisors

DOI10.1007/11496618_22MaRDI QIDQ5450910zbMATH OpenOpenAlexFDO

Authors Masanobu Katagi, Toru Akishita, Izuru Kitamura, Tsuyoshi Takagi

Publication date 17 March 2008

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

Full work available at URL https://doi.org/10.1007/11496618_22

zbMATH Keywords

scalar multiplicationwindow methodhyperelliptic curve cryptosystemdegenerate divisor

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Cryptography (94A60)

Recommendations

• Fast scalar multiplication of degenerate divisors for hyperelliptic curve cryptosystems
• Topics in Cryptology – CT-RSA 2006
• scientific article; zbMATH DE number 2164328
• Information Security and Privacy
• Hyperelliptic Curve Cryptosystems: Closing the Performance Gap to Elliptic Curves

Cited in

(3)

• Fast scalar multiplication of degenerate divisors for hyperelliptic curve cryptosystems
• Group law computations on Jacobians of hyperelliptic curves
• Efficient pairing computation on supersingular abelian varieties

This page was built for publication: Some Improved Algorithms for Hyperelliptic Curve Cryptosystems Using Degenerate Divisors

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