skip to main content
research-article

High-Performance Implementation of the Identity-Based Signature Scheme in IEEE P1363 on GPU

Published:24 January 2023Publication History
Skip Abstract Section

Abstract

Identity-based cryptography is proposed to solve the complicated certificate management of traditional public-key cryptography. The pairing computation and high-level tower extension field arithmetic turn out to be the performance bottleneck of pairing-based signature schemes. Graphics processing units have been increasingly popular for general-purpose computing in recent years. They have shown a lot of promise in speeding up cryptographic schemes such as AES, RSA, and ECDSA. However, to our knowledge, the research on parallel implementation of pairings and identity-based cryptographic schemes on graphics processing units is somewhat outdated. Therefore, in this article, we implement the identity-based signature scheme in the IEEE P1363 Standard on a modern NVIDIA RTX 3060 card. We convert the pairing computation in signature verification into a product of pairings with fixed arguments and therefore avoid the scalar multiplication in 𝔾2. Then we employ the precomputation technique to improve the elliptic curve scalar multiplication, exponentiation in \(\mathbb {F}_{p^{12}}\) and the pairing computation. We also apply PTX ISA to multiple-precision arithmetic. Experiments demonstrate that our implementation can perform 43,856/46,753/39,798 pairings/sec for the Optimal Ate pairing, the pairing with a fixed argument, and two pairings with fixed arguments, respectively. Peak throughputs of signature generation and verification can achieve 322.6 and 40.6 kops/sec over the BN254 curve.

REFERENCES

  1. [1] Aranha Diego F., Barreto Paulo S. L. M., Longa Patrick, and Ricardini Jefferson E.. 2013. The realm of the pairings. In Selected Areas in Cryptography (SAC’13). Springer, Berlin, Germany, 3–25. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. [2] Aranha Diego F., Karabina Koray, Longa Patrick, Gebotys Catherine H., and López Julio. 2011. Faster explicit formulas for computing pairings over ordinary curves. In Advances in Cryptology (EUROCRYPT’11). Springer, Berlin, Germany, 48–68. Google ScholarGoogle ScholarCross RefCross Ref
  3. [3] Askar Tair, Shukirgaliyev Bekdaulet, Lukac Martin, and Abdikamalov Ernazar. 2021. Evaluation of pseudo-random number generation on GPU cards. Computation 9, 12 (2021), 142. Google ScholarGoogle ScholarCross RefCross Ref
  4. [4] Azarderakhsh Reza, Fishbein Dieter, Grewal Gurleen, Hu Shi, Jao David, Longa Patrick, and Verma Rajeev. 2015. Fast software implementations of bilinear pairings. IEEE Transactions on Dependable and Secure Computing 14, 6 (2015), 605–619. Google ScholarGoogle ScholarCross RefCross Ref
  5. [5] Bahadori Milad and Järvinen Kimmo. 2020. Compact and programmable yet high-performance SoC architecture for cryptographic pairings. In Proceedings of the 2020 30th International Conference on Field-Programmable Logic and Applications (FPL’20). IEEE, Los Alamitos, CA, 176–184. Google ScholarGoogle ScholarCross RefCross Ref
  6. [6] Balfanz Dirk, Durfee Glenn, Shankar Narendar, Smetters Diana, Staddon Jessica, and Wong Hao-Chi. 2003. Secret handshakes from pairing-based key agreements. In Proceedings of the 2003 Symposium on Security and Privacy.IEEE, Los Alamitos, CA, 180–196. Google ScholarGoogle ScholarCross RefCross Ref
  7. [7] Barreto Paulo S. L. M., Libert Benoît, McCullagh Noel, and Quisquater Jean-Jacques. 2005. Efficient and provably-secure identity-based signatures and signcryption from bilinear maps. In Advances in Cryptology (ASIACRYPT’05). Springer, Berlin, Germany, 515–532. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. [8] Barreto Paulo S. L. M. and Naehrig Michael. 2005. Pairing-friendly elliptic curves of prime order. In Selected Areas in Cryptography (SAC’05). Springer, Berlin, Germany, 319–331. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. [9] Bernstein Daniel J., Chen Tien-Ren, Cheng Chen-Mou, Lange Tanja, and Yang Bo-Yin. 2009. ECM on graphics cards. In Advances in Cryptology (EUROCRYPT’09). Springer, Berlin, Germany, 483–501. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. [10] Beuchat Jean-Luc, González-Díaz Jorge E., Mitsunari Shigeo, Okamoto Eiji, Rodríguez-Henríquez Francisco, and Teruya Tadanori. 2011. High-speed software implementation of the Optimal Ate pairing over Barreto–Naehrig curves. In Pairing-Based Cryptography (Pairing’10). Springer, Berlin, Germany, 21–39. Google ScholarGoogle ScholarCross RefCross Ref
  11. [11] Boneh Dan and Boyen Xavier. 2004. Efficient selective-ID secure identity-based encryption without random oracles. In Advances in Cryptology (EUROCRYPT’04). Springer, Berlin, Germany, 223–238. Google ScholarGoogle ScholarCross RefCross Ref
  12. [12] Boneh Dan and Boyen Xavier. 2004. Short signatures without random oracles. In Advances in Cryptology (EUROCRYPT’04). Springer, Berlin, Germany, 56–73. Google ScholarGoogle ScholarCross RefCross Ref
  13. [13] Boneh Dan and Boyen Xavier. 2008. Short signatures without random oracles and the SDH assumption in bilinear groups. Journal of Cryptology 21, 2 (April2008), 149–177. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. [14] Boneh Dan and Franklin Matt. 2001. Identity-based encryption from the Weil pairing. In Advances in Cryptology (CRYPTO’01). Springer, Berlin, Germany, 213–229. Google ScholarGoogle ScholarCross RefCross Ref
  15. [15] Boneh Dan, Lynn Ben, and Shacham Hovav. 2001. Short signatures from the Weil pairing. In Advances in Cryptology (ASIACRYPT’01). Springer, Berlin, Germany, 514–532. Google ScholarGoogle ScholarCross RefCross Ref
  16. [16] Bose Utsab, Bhattacharya Anup Kumar, and Das Abhijit. 2013. GPU-based implementation of 128-bit secure eta pairing over a binary field. In Progress in Cryptology (AFRICACRYPT’13). Springer, Berlin, Germany, 26–42. Google ScholarGoogle ScholarCross RefCross Ref
  17. [17] Choon Jae Cha and Cheon Jung Hee. 2003. An identity-based signature from gap Diffie-Hellman groups. In Public Key Cryptography (PKC’03). Springer, Berlin, Germany, 18–30. Google ScholarGoogle ScholarCross RefCross Ref
  18. [18] Chung Jaewook and Hasan M. Anwar. 2007. Asymmetric squaring formulae. In Proceedings of the 18th IEEE Symposium on Computer Arithmetic (ARITH’07). IEEE, Los Alamitos, CA, 113–122. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. [19] Cui Shujie, Großschädl Johann, Liu Zhe, and Xu Qiuliang. 2014. High-speed elliptic curve cryptography on the NVIDIA GT200 graphics processing unit. In Information Security Practice and Experience (ISPEC’14). Springer, Berlin, Germany, 202–216. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. [20] Devegili Augusto Jun, Scott Michael, and Dahab Ricardo. 2007. Implementing cryptographic pairings over Barreto-Naehrig curves. In Pairing-Based Cryptography (Pairing’07). Springer, Berlin, Germany, 197–207. Google ScholarGoogle ScholarCross RefCross Ref
  21. [21] Dong Jiankuo, Fan Guang, Zheng Fangyu, Lin Jingqiang, and Xiao Fu. 2021. TX-RSA: A high performance RSA implementation scheme on NVIDIA Tegra X2. In Wireless Algorithms, Systems, and Applications (WASA’21). Springer, Berlin, Germany, 210–222. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. [22] Dong Jiankuo, Zheng Fangyu, Lin Jingqiang, Liu Zhe, Xiao Fu, and Fan Guang. 2022. EC-ECC: Accelerating elliptic curve cryptography for edge computing on embedded GPU TX2. ACM Transactions on Embedded Computing Systems 21, 2 (March2022), 1–25. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. [23] Frey Gerhard and Rück Hans-Georg. 1994. A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves. Mathematics of Computation 62, 206 (1994), 865–874. Google ScholarGoogle ScholarCross RefCross Ref
  24. [24] Gao Lili, Zheng Fangyu, Wei Rong, Dong Jiankuo, Emmart Niall, Ma Yuan, Lin Jingqiang, and Weems Charles. 2021. DPF-ECC: A framework for efficient ECC with double precision floating-point computing power. IEEE Transactions on Information Forensics and Security 16 (July2021), 3988–4002. Google ScholarGoogle ScholarCross RefCross Ref
  25. [25] Gentry Craig and Ramzan Zulfikar. 2006. Identity-based aggregate signatures. In Public Key Cryptography (PKC’06). Springer, Berlin, Germany, 257–273. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. [26] Granger Robert, Hess Florian, Oyono Roger, Thériault Nicolas, and Vercauteren Frederik. 2007. Ate pairing on hyperelliptic curves. In Advances in Cryptology (EUROCRYPT’07). Springer, Berlin, Germany, 430–447. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. [27] Granger Robert and Scott Michael. 2010. Faster squaring in the cyclotomic subgroup of sixth degree extensions. In Public Key Cryptography (PKC’10). Springer, Berlin, Germany, 209–223. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. [28] Groth Jens. 2016. On the size of pairing-based non-interactive arguments. In Advances in Cryptology (EUROCRYPT’16). Springer, Berlin, Germany, 305–326. Google ScholarGoogle ScholarCross RefCross Ref
  29. [29] Hankerson Darrel, Menezes Alfred J., and Vanstone Scott. 2006. Guide to Elliptic Curve Cryptography. Springer Science & Business Media, New York, NY. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. [30] Hess Florian. 2002. Efficient identity based signature schemes based on pairings. In Selected Areas in Cryptography (SAC 2002). Springer, Berlin, Germany, 310–324. Google ScholarGoogle ScholarCross RefCross Ref
  31. [31] Karatsuba Anatolii Alekseevich and Ofman Yu P.. 1962. Multiplication of many-digital numbers by automatic computers. In Doklady Akademii Nauk (Proceedings of the USSR Academy of Sciences). Russian Academy of Sciences, Moscow, Russia, 293–294.Google ScholarGoogle Scholar
  32. [32] Koc C. Kaya, Acar Tolga, and Kaliski Burton S.. 1996. Analyzing and comparing Montgomery multiplication algorithms. IEEE Micro 16, 3 (1996), 26–33. Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. [33] Lavice Arthur, Mrabet Nadia El, Berzati Alexandre, Rigaud Jean-Baptiste, and Proy Julien. 2021. Hardware implementations of pairings at updated security levels. In Smart Card Research and Advanced Applications (CARDIS’21). Springer, Berlin, Germany, 189–209. Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. [34] Lee Eunjeong, Lee Hyang-Sook, and Park Cheol-Min. 2009. Efficient and generalized pairing computation on abelian varieties. IEEE Transactions on Information Theory 55, 4 (2009), 1793–1803. Google ScholarGoogle ScholarDigital LibraryDigital Library
  35. [35] Liu Jun-Jie, Tsang Ken K. T., and Deng Yu-Hui. 2021. Improved parallel RSA cryptosystem with GPU for network information security. In Advances in Natural Computation, Fuzzy Systems, and Knowledge Discovery (ICNC-FSKD’20). Springer, Berlin, Germany, 1061–1068. Google ScholarGoogle ScholarCross RefCross Ref
  36. [36] Menezes Alfred J., Katz Jonathan, Oorschot Paul C. van, and Vanstone Scott A.. 1996. Handbook of Applied Cryptography. CRC Press, Boca Raton, FL. Google ScholarGoogle ScholarDigital LibraryDigital Library
  37. [37] Montgomery Peter L.. 1985. Modular multiplication without trial division. Mathematics of Computation 44, 170 (1985), 519–521. Google ScholarGoogle ScholarCross RefCross Ref
  38. [38] Naehrig Michael, Niederhagen Ruben, and Schwabe Peter. 2010. New software speed records for cryptographic pairings. In Progress in Cryptology (LATINCRYPT’10). Springer, Berlin, Germany, 109–123. Google ScholarGoogle ScholarCross RefCross Ref
  39. [39] NVIDIA. 2022. cuRAND Library. Retrieved February 22, 2022 from https://docs.nvidia.com/cuda/curand/index.html.Google ScholarGoogle Scholar
  40. [40] NVIDIA. 2022. Parallel Thread Execution ISA Version 7.6. Retrieved February 22, 2022 from https://docs.nvidia.com/cuda/parallel-thread-execution/index.html.Google ScholarGoogle Scholar
  41. [41] Diffie-Hellman Antoine Joux. 2000. A one round protocol for tripartite. In Algorithmic Number Theory (ANTS’00). Springer, Berlin, Germany, 385–393. Google ScholarGoogle ScholarCross RefCross Ref
  42. [42] Orup Holger. 1995. Simplifying quotient determination in high-radix modular multiplication. In Proceedings of the 12th Symposium on Computer Arithmetic.IEEE, Los Alamitos, CA, 193–199. Google ScholarGoogle ScholarCross RefCross Ref
  43. [43] Pan Wuqiong, Zheng Fangyu, Zhao Yuan, Zhu Wen-Tao, and Jing Jiwu. 2016. An efficient elliptic curve cryptography signature server with GPU acceleration. IEEE Transactions on Information Forensics and Security 12, 1 (2016), 111–122. Google ScholarGoogle ScholarDigital LibraryDigital Library
  44. [44] Paterson Kenneth G.. 2002. ID-based signatures from pairings on elliptic curves. Electronics Letters 38, 18 (2002), 1025–1026. Google ScholarGoogle ScholarCross RefCross Ref
  45. [45] Paterson Kenneth G. and Schuldt Jacob C. N.. 2006. Efficient identity-based signatures secure in the standard model. In Proceedings of the Australasian Conference on Information Security and Privacy (ACISP’06). 207–222. Google ScholarGoogle ScholarDigital LibraryDigital Library
  46. [46] Pu Shi and Liu Jyh-Charn. 2013. EAGL: An elliptic curve arithmetic GPU-based library for bilinear pairing. In Pairing-Based Cryptography (Pairing’13). Springer, Berlin, Germany, 1–19. Google ScholarGoogle ScholarDigital LibraryDigital Library
  47. [47] Qiu Shuming, Wang Ding, Xu Guoai, and Kumari Saru. 2020. Practical and provably secure three-factor authentication protocol based on extended chaotic-maps for mobile lightweight devices. IEEE Transactions on Dependable and Secure Computing 19, 2 (2020), 1338–1351. Google ScholarGoogle ScholarCross RefCross Ref
  48. [48] Scott Michael. 2019. Pairing Implementation Revisited. Retrieved October 5, 2022 from https://eprint.iacr.org/2019/077.pdf.Google ScholarGoogle Scholar
  49. [49] Scott Michael, Benger Naomi, Charlemagne Manuel, Perez Luis J. Dominguez, and Kachisa Ezekiel J.. 2009. On the final exponentiation for calculating pairings on ordinary elliptic curves. In Pairing-Based Cryptography (Pairing’09). Springer, Berlin, Germany, 78–88. Google ScholarGoogle ScholarDigital LibraryDigital Library
  50. [50] Shamir Adi. 1984. Identity-based cryptosystems and signature schemes. In Advances in Cryptology (CRYPTO’84). Springer, Berlin, Germany, 47–53. Google ScholarGoogle ScholarCross RefCross Ref
  51. [51] Smith Brian. 2017. The Most Efficient Known Addition Chains for Field Element & Scalar Inversion for the Most Popular & Most Unpopular Elliptic Curves. Retrieved February 22, 2022 from https://briansmith.org/ecc-inversion-addition-chains-01.Google ScholarGoogle Scholar
  52. [52] Szerwinski Robert and Güneysu Tim. 2008. Exploiting the power of GPUs for asymmetric cryptography. In Cryptographic Hardware and Embedded Systems (CHES’08). Springer, Berlin, Germany, 79–99. Google ScholarGoogle ScholarDigital LibraryDigital Library
  53. [53] Tembhurne Jitendra V. and Sathe S. R.. 2016. RSA public key acceleration on CUDA GPU. In Artificial Intelligence and Evolutionary Computations in Engineering Systems (ICAIECES’15). Springer, Berlin, Germany, 365–375. Google ScholarGoogle ScholarCross RefCross Ref
  54. [54] Vercauteren Frederik. 2009. Optimal pairings. IEEE Transactions on Information Theory 56, 1 (2009), 455–461. Google ScholarGoogle ScholarDigital LibraryDigital Library
  55. [55] Wang A. Tengfei, Guo B. Wei, and Wei C. Jizeng. 2019. Highly-parallel hardware implementation of Optimal Ate pairing over Barreto-Naehrig curves. Integration 64 (2019), 13–21. Google ScholarGoogle ScholarCross RefCross Ref
  56. [56] Wang Ding and Wang Ping. 2016. Two birds with one stone: Two-factor authentication with security beyond conventional bound. IEEE Transactions on Dependable and Secure Computing 15, 4 (2016), 708–722. Google ScholarGoogle ScholarDigital LibraryDigital Library
  57. [57] Weil André. 1940. Sur les fonctions algébriquesa corps de constantes fini. Comptes Rendus de l’Académie des Sciences (Paris) 210, 592-594 (1940), 149.Google ScholarGoogle Scholar
  58. [58] Whyte William, Johnson Don, and Kendall Ananyi. 2013. IEEE standard for identity-based cryptographic techniques using pairings. IEEE Std 1363.3-2013 (2013), 1–151. Google ScholarGoogle ScholarCross RefCross Ref
  59. [59] Xing Yue, Huang Bo-Yuan, Gupta Aarti, and Malik Sharad. 2018. A formal instruction-level GPU model for scalable verification. In Proceedings of the International Conference on Computer-Aided Design (ICCAD’18). ACM, New York, NY, 1–8. Google ScholarGoogle ScholarDigital LibraryDigital Library
  60. [60] Yang Yang, Guan Zhi, Sun Huiping, and Chen Zhong. 2015. Accelerating RSA with fine-grained parallelism using GPU. In Information Security Practice and Experience (ISPEC’15). Springer, Berlin, Germany, 454–468. Google ScholarGoogle ScholarCross RefCross Ref
  61. [61] Zavattoni Eric, Perez Luis J. Dominguez, Mitsunari Shigeo, Sánchez-Ramırez Ana H., Teruya Tadanori, and Rodríguez-Henríquez Francisco. 2014. Software implementation of an attribute-based encryption scheme. IEEE Transactions on Computers 64, 5 (2014), 1429–1441. Google ScholarGoogle ScholarDigital LibraryDigital Library
  62. [62] Zheng Fangyu, Pan Wuqiong, Lin Jingqiang, Jing Jiwu, and Zhao Yuan. 2014. Exploiting the potential of GPUs for modular multiplication in ECC. In Information Security Applications (WISA’14). Springer, Berlin, Germany, 295–306. Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. High-Performance Implementation of the Identity-Based Signature Scheme in IEEE P1363 on GPU

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    • Published in

      cover image ACM Transactions on Embedded Computing Systems
      ACM Transactions on Embedded Computing Systems  Volume 22, Issue 2
      March 2023
      560 pages
      ISSN:1539-9087
      EISSN:1558-3465
      DOI:10.1145/3572826
      • Editor:
      • Tulika Mitra
      Issue’s Table of Contents

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 24 January 2023
      • Online AM: 27 September 2022
      • Accepted: 19 September 2022
      • Revised: 20 August 2022
      • Received: 31 May 2022
      Published in tecs Volume 22, Issue 2

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article
      • Refereed
    • Article Metrics

      • Downloads (Last 12 months)249
      • Downloads (Last 6 weeks)8

      Other Metrics

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Full Text

    View this article in Full Text.

    View Full Text

    HTML Format

    View this article in HTML Format .

    View HTML Format
    About Cookies On This Site

    We use cookies to ensure that we give you the best experience on our website.

    Learn more

    Got it!