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.
- [1] . 2013. The realm of the pairings. In Selected Areas in Cryptography (SAC’13). Springer, Berlin, Germany, 3–25. Google Scholar
Digital Library
- [2] . 2011. Faster explicit formulas for computing pairings over ordinary curves. In Advances in Cryptology (EUROCRYPT’11). Springer, Berlin, Germany, 48–68. Google Scholar
Cross Ref
- [3] . 2021. Evaluation of pseudo-random number generation on GPU cards. Computation 9, 12 (2021), 142. Google Scholar
Cross Ref
- [4] . 2015. Fast software implementations of bilinear pairings. IEEE Transactions on Dependable and Secure Computing 14, 6 (2015), 605–619. Google Scholar
Cross Ref
- [5] . 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 Scholar
Cross Ref
- [6] . 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 Scholar
Cross Ref
- [7] . 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 Scholar
Digital Library
- [8] . 2005. Pairing-friendly elliptic curves of prime order. In Selected Areas in Cryptography (SAC’05). Springer, Berlin, Germany, 319–331. Google Scholar
Digital Library
- [9] . 2009. ECM on graphics cards. In Advances in Cryptology (EUROCRYPT’09). Springer, Berlin, Germany, 483–501. Google Scholar
Digital Library
- [10] . 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 Scholar
Cross Ref
- [11] . 2004. Efficient selective-ID secure identity-based encryption without random oracles. In Advances in Cryptology (EUROCRYPT’04). Springer, Berlin, Germany, 223–238. Google Scholar
Cross Ref
- [12] . 2004. Short signatures without random oracles. In Advances in Cryptology (EUROCRYPT’04). Springer, Berlin, Germany, 56–73. Google Scholar
Cross Ref
- [13] . 2008. Short signatures without random oracles and the SDH assumption in bilinear groups. Journal of Cryptology 21, 2 (
April 2008), 149–177. Google ScholarDigital Library
- [14] . 2001. Identity-based encryption from the Weil pairing. In Advances in Cryptology (CRYPTO’01). Springer, Berlin, Germany, 213–229. Google Scholar
Cross Ref
- [15] . 2001. Short signatures from the Weil pairing. In Advances in Cryptology (ASIACRYPT’01). Springer, Berlin, Germany, 514–532. Google Scholar
Cross Ref
- [16] . 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 Scholar
Cross Ref
- [17] . 2003. An identity-based signature from gap Diffie-Hellman groups. In Public Key Cryptography (PKC’03). Springer, Berlin, Germany, 18–30. Google Scholar
Cross Ref
- [18] . 2007. Asymmetric squaring formulae. In Proceedings of the 18th IEEE Symposium on Computer Arithmetic (ARITH’07). IEEE, Los Alamitos, CA, 113–122. Google Scholar
Digital Library
- [19] . 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 Scholar
Digital Library
- [20] . 2007. Implementing cryptographic pairings over Barreto-Naehrig curves. In Pairing-Based Cryptography (Pairing’07). Springer, Berlin, Germany, 197–207. Google Scholar
Cross Ref
- [21] . 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 Scholar
Digital Library
- [22] . 2022. EC-ECC: Accelerating elliptic curve cryptography for edge computing on embedded GPU TX2. ACM Transactions on Embedded Computing Systems 21, 2 (
March 2022), 1–25. Google ScholarDigital Library
- [23] . 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 Scholar
Cross Ref
- [24] . 2021. DPF-ECC: A framework for efficient ECC with double precision floating-point computing power. IEEE Transactions on Information Forensics and Security 16 (
July 2021), 3988–4002. Google ScholarCross Ref
- [25] . 2006. Identity-based aggregate signatures. In Public Key Cryptography (PKC’06). Springer, Berlin, Germany, 257–273. Google Scholar
Digital Library
- [26] . 2007. Ate pairing on hyperelliptic curves. In Advances in Cryptology (EUROCRYPT’07). Springer, Berlin, Germany, 430–447. Google Scholar
Digital Library
- [27] . 2010. Faster squaring in the cyclotomic subgroup of sixth degree extensions. In Public Key Cryptography (PKC’10). Springer, Berlin, Germany, 209–223. Google Scholar
Digital Library
- [28] . 2016. On the size of pairing-based non-interactive arguments. In Advances in Cryptology (EUROCRYPT’16). Springer, Berlin, Germany, 305–326. Google Scholar
Cross Ref
- [29] . 2006. Guide to Elliptic Curve Cryptography. Springer Science & Business Media, New York, NY. Google Scholar
Digital Library
- [30] . 2002. Efficient identity based signature schemes based on pairings. In Selected Areas in Cryptography (SAC 2002). Springer, Berlin, Germany, 310–324. Google Scholar
Cross Ref
- [31] . 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 Scholar
- [32] . 1996. Analyzing and comparing Montgomery multiplication algorithms. IEEE Micro 16, 3 (1996), 26–33. Google Scholar
Digital Library
- [33] . 2021. Hardware implementations of pairings at updated security levels. In Smart Card Research and Advanced Applications (CARDIS’21). Springer, Berlin, Germany, 189–209. Google Scholar
Digital Library
- [34] . 2009. Efficient and generalized pairing computation on abelian varieties. IEEE Transactions on Information Theory 55, 4 (2009), 1793–1803. Google Scholar
Digital Library
- [35] . 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 Scholar
Cross Ref
- [36] . 1996. Handbook of Applied Cryptography. CRC Press, Boca Raton, FL. Google Scholar
Digital Library
- [37] . 1985. Modular multiplication without trial division. Mathematics of Computation 44, 170 (1985), 519–521. Google Scholar
Cross Ref
- [38] . 2010. New software speed records for cryptographic pairings. In Progress in Cryptology (LATINCRYPT’10). Springer, Berlin, Germany, 109–123. Google Scholar
Cross Ref
- [39] . 2022. cuRAND Library. Retrieved February 22, 2022 from https://docs.nvidia.com/cuda/curand/index.html.Google Scholar
- [40] . 2022. Parallel Thread Execution ISA Version 7.6. Retrieved February 22, 2022 from https://docs.nvidia.com/cuda/parallel-thread-execution/index.html.Google Scholar
- [41] . In Algorithmic Number Theory (ANTS’00). Springer, Berlin, Germany, 385–393. Google Scholar
Cross Ref
- [42] . 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 Scholar
Cross Ref
- [43] . 2016. An efficient elliptic curve cryptography signature server with GPU acceleration. IEEE Transactions on Information Forensics and Security 12, 1 (2016), 111–122. Google Scholar
Digital Library
- [44] . 2002. ID-based signatures from pairings on elliptic curves. Electronics Letters 38, 18 (2002), 1025–1026. Google Scholar
Cross Ref
- [45] . 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 Scholar
Digital Library
- [46] . 2013. EAGL: An elliptic curve arithmetic GPU-based library for bilinear pairing. In Pairing-Based Cryptography (Pairing’13). Springer, Berlin, Germany, 1–19. Google Scholar
Digital Library
- [47] . 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 Scholar
Cross Ref
- [48] . 2019. Pairing Implementation Revisited. Retrieved October 5, 2022 from https://eprint.iacr.org/2019/077.pdf.Google Scholar
- [49] . 2009. On the final exponentiation for calculating pairings on ordinary elliptic curves. In Pairing-Based Cryptography (Pairing’09). Springer, Berlin, Germany, 78–88. Google Scholar
Digital Library
- [50] . 1984. Identity-based cryptosystems and signature schemes. In Advances in Cryptology (CRYPTO’84). Springer, Berlin, Germany, 47–53. Google Scholar
Cross Ref
- [51] . 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 Scholar
- [52] . 2008. Exploiting the power of GPUs for asymmetric cryptography. In Cryptographic Hardware and Embedded Systems (CHES’08). Springer, Berlin, Germany, 79–99. Google Scholar
Digital Library
- [53] . 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 Scholar
Cross Ref
- [54] . 2009. Optimal pairings. IEEE Transactions on Information Theory 56, 1 (2009), 455–461. Google Scholar
Digital Library
- [55] . 2019. Highly-parallel hardware implementation of Optimal Ate pairing over Barreto-Naehrig curves. Integration 64 (2019), 13–21. Google Scholar
Cross Ref
- [56] . 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 Scholar
Digital Library
- [57] . 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 Scholar
- [58] . 2013. IEEE standard for identity-based cryptographic techniques using pairings. IEEE Std 1363.3-2013 (2013), 1–151. Google Scholar
Cross Ref
- [59] . 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 Scholar
Digital Library
- [60] . 2015. Accelerating RSA with fine-grained parallelism using GPU. In Information Security Practice and Experience (ISPEC’15). Springer, Berlin, Germany, 454–468. Google Scholar
Cross Ref
- [61] . 2014. Software implementation of an attribute-based encryption scheme. IEEE Transactions on Computers 64, 5 (2014), 1429–1441. Google Scholar
Digital Library
- [62] . 2014. Exploiting the potential of GPUs for modular multiplication in ECC. In Information Security Applications (WISA’14). Springer, Berlin, Germany, 295–306. Google Scholar
Cross Ref
Index Terms
High-Performance Implementation of the Identity-Based Signature Scheme in IEEE P1363 on GPU
Recommendations
Forgery attacks on Kang et al.'s identity-based strong designated verifier signature scheme and its improvement with security proof
Recently, Kang et al. proposed a new identity-based strong designated verifier signature scheme (ID-SDVS) and identity-based designated verifier proxy signature scheme (ID-DVPS). They claimed that their schemes are unforgeable. However, we found out ...
Identity-Based Sequential Aggregate Signature from RSA
CHINAGRID '09: Proceedings of the 2009 Fourth ChinaGrid Annual ConferenceSequential aggregate signature (SAS) schemes allow multiple signers to sequentially produce a short signature of different messages and also allow signers to attest to these messages as well as the order in which they signed. Identity-based signature (...
A novel identity-based strong designated verifier signature scheme
Unlike ordinary digital signatures, a designated verifier signature scheme makes it possible for a signer to convince a designated verifier that she has signed a message in such a way that the designated verifier cannot transfer the signature to a third ...






Comments