A hardware-oriented algorithm for computing in Jacobians and its implementation for hyperelliptic curve cryptosystems

DOI10.1007/10719994_18MaRDI QIDQ4452581zbMATH OpenFDO

Authors Tetsuya Tamura, Kouichi Sakurai, Tsutomu Matsumoto

Publication date 1 March 2004

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

Full work available at URL https://doi.org/10.1007/10719994_18

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1992750
• On efficient implementation of FPGA-based hyperelliptic curve cryptosystems
• Computing the characteristic polynomials of a class of hyperelliptic curves for cryptographic applications
• Boneh-Boyen encryption and signature scheme on the Jacobian of a hyperelliptic curve
• A systolic architecture for implementing the arithmetic of cryptographic algorithms on elliptic curves
• Efficient algorithms for the construction of hyperelliptic cryptosystems
• Efficient hardware implementation of elliptic curve cryptosystems
• Efficient hardware implementations for elliptic curve cryptography over Curve448

Cited in

(4)

• On efficient implementation of FPGA-based hyperelliptic curve cryptosystems
• HECC Goes Embedded: An Area-Efficient Implementation of HECC
• Genus two hyperelliptic curve coprocessor
• Over \(F_p\) vs. over \(F_{2^n}\) and on Pentium vs. on Alpha in software implementation of hyperelliptic curve cryptosystems

This page was built for publication: A hardware-oriented algorithm for computing in Jacobians and its implementation for hyperelliptic curve cryptosystems

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