Cryptology ePrint Archive: Report 2020/196

Trustless Groups of Unknown Order with Hyperelliptic Curves

Samuel Dobson and Steven D. Galbraith

Abstract: We suggest an alternative method of generating groups of unknown order for constructions such as cryptographic accumulators, by using the Jacobian groups of hyperelliptic curves (especially of genus 3). We propose that this construction is more efficient in practice than other proposals such as the use of ideal class groups of imaginary quadratic fields. We suggest that both the group operation and the size of element representation is an improvement over class groups. We also offer potential parameter choices for security with respect to best current algorithms for calculating the order of these groups.

Category / Keywords: cryptographic protocols / hyperelliptic curves, accumulators, unknown order groups

Date: received 16 Feb 2020, last revised 18 Feb 2020

Contact author: samuel dobson nz at gmail com,s galbraith@auckland ac nz

Available format(s): PDF | BibTeX Citation

Version: 20200219:050142 (All versions of this report)

Short URL: ia.cr/2020/196


[ Cryptology ePrint archive ]