Paper 2022/996

Fast Hashing to $G_2$ in Direct Anonymous Attestation

Yu Dai
Fangguo Zhang
Chang-An Zhao

To reduce the workload of the Trusted Platform Module~(TPM) without affecting the security in pairing-based direct anonymous attestation~(DAA) schemes, it is feasible to select pairing-friendly curves that provide fast group operations in the first pairing subgroup. In this scenario, the BW13-P310 and BW19-P286 curves become competitive. In order to improve the efficiency of the DAA schemes based on these curves, it is also necessary to design an efficient algorithm for hashing to $G_2$. In this paper, we first generalize the previous work to address the bottlenecks involved in hashing to $G_2$ on the two curves. On this basis, we further optimize the hashing algorithm, which would be nearly twice as fast as the previous one in theory. These techniques actually can be applied to a large class of curves. We also implement the proposed algorithms over the BW13-P310 curve on a 64-bit computing platform.

Available format(s)
Public-key cryptography
Publication info
Direct anonymous attestation Pairing-friendly curves Hashing to $G_2$
Contact author(s)
daiy39 @ mail2 sysu edu cn
isszhfg @ mail sysu edu cn
zhaochan3 @ mail sysu edu cn
2022-08-03: approved
2022-08-03: received
See all versions
Short URL
Creative Commons Attribution


      author = {Yu Dai and Fangguo Zhang and Chang-An Zhao},
      title = {Fast Hashing to $G_2$ in Direct Anonymous Attestation},
      howpublished = {Cryptology ePrint Archive, Paper 2022/996},
      year = {2022},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.