DEVICE FOR CALCULATING A FINAL EXPONENTIATION, MATCHING OPERATION DEVICE, CRYPTOGRAPHIC PROCESSING DEVICE, METHOD FOR CALCULATING A FINAL EXPONENTIATION AND PROGRAM FOR Attributing A FINAL EXPONENTIATION

By decomposing and transforming the exponent part using a cyclotomic polynomial, the method efficiently calculates final exponentiation on BLS21 curves, addressing inefficiencies in existing methods and reducing computational costs in cryptographic schemes.

DE112019007858B4Inactive Publication Date: 2024-11-21MITSUBISHI ELECTRIC CORP
View PDF 1 Cites 0 Cited by

Patent Information

Application Number
DE112019007858
Authority / Receiving Office
DE · DE
Patent Type
Patents
Current Assignee / Owner
Filing Date
2019-12-26
Publication Date
2024-11-21
Estimated Expiration
Not applicable · inactive patent

AI Technical Summary

Technical Problem

Existing methods for calculating final exponentiation in pairing operations on Barreto-Lynn-Scott (BLS) curves with embedding degree k=21 are inefficient, leading to high computational costs, particularly in cryptographic schemes like functional encryption and searchable encryption.

Method used

A device and method that decompose the exponent part into an easy and difficult part using a cyclotomic polynomial, and transform the difficult part into a linear sum of the polynomial q(u), reducing computational effort by minimizing exponentiations of u and eliminating square root calculations.

Benefits of technology

This approach significantly reduces computational time and effort in calculating final exponentiation, making pairing operations on BLS21 curves more efficient, thereby accelerating cryptographic processes.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure 00000000_0000_ABST
    Figure 00000000_0000_ABST
Patent Text Reader

Abstract

Device (10C) for calculating a final exponentiation, comprising: a decomposition unit (221) for decomposing an exponential part into a simple part, specified in formula 1, and a difficult part, specified in formula 2, using a cyclotomic polynomial, wherein the exponential part in a calculation of the final exponentiation is part of a pairing operation on an elliptic curve represented by a polynomial r(u), a polynomial q(u), a polynomial t(u), an embedding degree k, and a parameter u, and is a Barreto-Lynn-Scott (BLS) curve 21 with 21 as embedding degree k; and a transformation unit (222) for transforming the difficult part obtained as a result of the decomposition by the decomposition unit (221) into a linear sum of the polynomial q(u) given in formula 3 (q (u) 7 − 1) ⋅ (q (u) 2 + q (u) + 1) Φ 21 ( q ( u ) ) r ( u ) ∑ i = 0 11 λ i ( u ) q ( u ) i where λ 11 ( u ) = u 4 − u 3 − u + 1, λ 10 ( u ) = ( u − 1 ) λ 11 ( u ), λ 9 ( u ) = u λ 10 ( u ), λ 8 ( u ) = u λ 9 ( u ) + λ 11 ( u ), λ 7 ( u ) = u λ 8 ( u ) − λ 11 ( u ), λ 6 ( u ) = u λ 7 ( u ) , λ 5 ( u ) = u λ 6 ( u ) + λ 11 ( u ), λ 4 ( u ) = u λ 5 ( u ), λ 3 ( u ) = u λ 4 ( u ) − λ 11 ( u ), λ 2 ( u ) = u λ 3 ( u ) + λ 11 ( u ), λ 1 ( u ) = u λ 2 ( u ), λ 0 ( u ) = u λ 1 ( u ) − λ 11 ( u ) + 3.
Need to check novelty before this filing date? Find Prior Art

Description

field of technology

[0001] The present disclosure relates to a technique for calculating a final exponentiation in a pairing operation. State of the art

[0002] A pairing operation is an operation or process using an elliptic curve that is processed internally within a cryptographic scheme, such as functional encryption and searchable encryption. A Barreto-Naehrig (BN) curve is known as an elliptic curve with a 128-bit security level. In recent years, there has been a growing demand for a pairing operation using an elliptic curve with a 256-bit security level, which is more secure.

[0003] The pairing operation is roughly divided into calculating a Miller function and calculating a final exponentiation. Both calculating the Miller function and calculating the final exponentiation require complex computational processes, which significantly impacts the computational complexity of the entire cryptographic scheme, such as functional encryption and searchable encryption.

[0004] Non-Patent Reference 1 and Non-Patent Reference 2 discuss a Barreto-Lynn-Scott (BLS) curve, which is assumed to be the most efficient for the matching operation among many matching-friendly curves. Non-Patent Reference 1 and Non-Patent Reference 2 discuss matching operations on BLS curves with k = 9, 15, 24, 27, 42, and 48, where there is no embedding degree. Patent Reference 1 and Non-Patent Reference 2 discuss a Kachisa-Schaefer-Scott (KSS) curve.

[0005] It is known that when performing the pairing operation on each of these curves, the computational cost of the final exponentiation is much higher than the computational cost of the Miller function.

[0006] A BLS curve is an elliptic curve defined by a polynomial r(u), a polynomial q(u), a polynomial t(u), an embedding degree k, and a parameter u. However, an elliptic curve with k ≡ 0 mod 18 is excluded. The polynomial r(u), the polynomial q(u), and the polynomial t(u) take different shapes depending on the embedding degree k.

[0007] A BLS curve E with embedding degree k is an elliptic curve over a finite field F q which is formed by q = q(u) elements. Note that r = r(u) is the largest prime number that determines the order of a subgroup E(F q ) of the elliptic curve E, and that t = t(u) is a course of the elliptic curve E.

[0008] A pairing operation on the elliptic curve E is performed by calculating a rational function f u,Q (P), which is called the Miller function, using two specific points P and Q on the elliptic curve E as inputs and then performing an exponentiation to the power (q(u) k -1) / r(u) is calculated.

[0009] That is, the pairing operation on the elliptic curve E is calculated by a formula 11. fu,Q(P)q(u)k−1r(u)

[0010] For the Miller function, a Miller algorithm is known that can efficiently perform a calculation for any curve (see Non-Patent Reference 3). For calculating the final exponentiation, an efficient calculation method is known in which an exponent part is decomposed using a cyclotomic polynomial (see Non-Patent Reference 4). However, the final exponentiation involves a huge amount of computation, even when using the method described in Non-Patent Reference 4, and further reduction of the time required for practical application.

[0011] The exponent part of the final exponentiation depends heavily on the polynomial parameters of the curve. Therefore, the process for decomposing the exponent part, i.e., the process for reducing the time required, is unique for each curve.

[0012] Non-patent reference 5 mentions a BLS curve with an embedding degree of k=21, but does not propose a simplified calculation involving decomposition of the final exponentiation. The same applies to non-patent reference 6, which deals with matching-friendly curves with an embedding degree of k=21. List of citationsPatent literature

[0013] Patent Reference 1: JP 2018-205511 A Non-patent literature Non-patent reference 1: X. Zhang, D. Lin: “Analysis of Optimum Pairing Products at High Security Levels”, INDOCRYPT 2012, pp. 412-430 Non-Patent Reference 2: Y. Kiyomura, A. Inoue, Y. Kawahara, M. Yasuda, T. Takagi, T. Kobayashi: “Secure and Efficient Pairing at 256-Bit Security Lebel,” ACNS2017, pp. 59-79 Non-patent reference 3: Victor S. Miller: “The Weil pairing, and its efficient calculation”, J. Cryptology, 17(4), 2004, pp.235-261 Nicht-Patentliteraturstelle 4: M. Scott, N. Benger, M. Charlemagne: „On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves“, Pairing 2009, S. 78-88 Nicht-Patentliteraturstelle 5: Barbulescu R., Mrabet N., Ghammam L.: „A taxonomy of pairings, their security, their complexity“ ResearchGate, Prepring August 2019, S. 1-36 Nicht-Patentliteraturstelle 6: Toure M. A., Samake K., Traore S.: „Optimal Ate Pairing on Elliptic Curves with Embedding Degree 21“, International Journal of Science and Research IJST, ISSN 2319-7064, Volume 8 Issue 11, November 2019, S. 1659-1666Abriss der Erfindung Technische Aufgabe

[0014] For BLS curves with degrees of embedding different from those studied so far, the calculation of the Miller function requires more time compared to other elliptic curves, such as those of the KSS type, or there is no known method to accelerate the calculation of the final exponentiation.

[0015] An object of the present disclosure is to enable efficient computation of a final exponentiation in a pairing operation. Solution to the task

[0016] An apparatus for calculating a final exponentiation according to the present disclosure comprises: a decomposition unit for decomposing an exponent part into an easy part and a difficult part using a cyclotomic polynomial, wherein the exponent part is part of a calculation of a final exponentiation in a pairing operation on an elliptic curve represented by a polynomial r(u), a polynomial q(u), a polynomial t(u), an embedding degree k, and a parameter u; and a transformation unit for transforming the difficult part obtained as a result of the decomposition by the decomposition unit into a linear sum of the polynomial q(u). Advantageous effects of the invention

[0017] In the present disclosure, an exponent part is decomposed into an easy part and a difficult part using a cyclotomic polynomial, and the difficult part is transformed into a linear sum of a polynomial q(u). This makes it possible to efficiently compute a final exponentiation in a pairing operation. Brief description of the drawings Fig. 1 is a configuration diagram of a mating operation device 10 according to a first embodiment; Fig. 2 is a flowchart of an entire process in the mating operation apparatus 10 according to the first embodiment; Fig. 3 is a diagram describing a process for simplifying exponentiation according to the first embodiment; Fig. 4 is a flowchart of a Müller function calculation process according to the first embodiment; Fig. 5 is a flowchart of the exponentiation simplification process according to the first embodiment; Fig. 6 is a flowchart of an exponentiation calculation process according to the first embodiment; Fig. 7 is a flowchart of a process for generating a first factor A1(u) according to the first embodiment; Fig. 8 is a flowchart of a process for generating a second factor A2(u) according to the first embodiment; Fig. 9 is a flowchart of a process for generating a third factor A3(u) according to the first embodiment; Fig. 10 is a diagram describing a conventional method for calculating an exponent part in a calculation part of a final exponentiation; Fig. 11 is a diagram describing a method of calculating an exponent part in a final exponentiation calculation part according to the first embodiment; Fig. 12 is a configuration diagram of the mating operation device 10 according to a first variant; Fig. 13 is a configuration diagram of a Miller function calculating apparatus 10A according to a third variant; Fig. 14 is a configuration diagram of a final exponentiation simplifying apparatus 10B according to the third embodiment; Fig. 15 is a configuration diagram of a final exponentiation calculation apparatus 10C according to the third embodiment; Fig. 16 is a configuration diagram of a cryptographic processing apparatus 30 according to a second embodiment; and Fig. 17 is a flowchart of an entire process in the cryptographic processing apparatus 30 according to the second embodiment. Description of embodimentsFirst embodiment*** Description of notation ***

[0018] In the text of the description and in the drawings, an exponentiation may be denoted using "^". A concrete example is that a^ba b designated. *** Description of the configuration ***

[0019] Referring to Fig. 1, a configuration of a mating operation apparatus 10 according to a first embodiment will be described.

[0020] The pairing operation device 10 is a computer.

[0021] The pairing operation device 10 comprises, as hardware, a processor 11, a memory 12, a storage medium 13, and a communication interface 14. The processor 11 is connected to other hardware components via signal lines and controls these other hardware components.

[0022] Processor 11 is an integrated circuit (IC) that performs processing. Specific examples of processor 11 include a central processing unit (CPU), a digital signal processor (DSP), and a graphics processing unit (GPU).

[0023] The main memory 12 is a storage device for temporarily storing data. Specific examples of the main memory 12 are a static random-access memory (SRAM) and a dynamic random-access memory (DRAM).

[0024] The storage medium 13 is a storage device for storing data. A specific example of the storage medium 13 is a hard disk drive (HDD). Alternatively, the storage medium 13 may be a portable recording medium, such as a Secure Digital (SD, registered trademark) memory card, CompactFlash (CF, registered trademark), NAND Flash, a flexible disk, an optical disk, a compact disc, a Blu-ray (registered trademark) disc, or a digital versatile disc (DVD).

[0025] The communication interface 14 is an interface for communicating with external devices. Specific examples of the communication interface 14 are an Ethernet (registered trademark) port, a Universal Serial Bus (USB) port, or a port for a High Definition Multimedia Interface (HDMI, registered trademark).

[0026] The pairing operation device 10 includes, as functional components, a Miller function calculation unit 21, an exponentiation simplification unit 22, and an exponentiation calculation unit 23. The Miller function calculation unit 21 includes a doubling step calculation unit 211 and an addition step calculation unit 212. The exponentiation simplification unit 22 includes a decomposition unit 221 and a transformation unit 222. The decomposition unit 221 includes a first generation unit 223 and a second generation unit 224. The functions of the functional components of the pairing operation device 10 are implemented by software.

[0027] The storage medium 13 stores programs that implement the functions of the functional components of the pairing operation device 10. These programs are loaded into the main memory 12 by the processor 11 and executed by the processor 11. This implements the functions of the functional components of the pairing operation device 10.

[0028] In Fig. 1, only one processor 11 is shown. However, a plurality of processors 11 may be included, and the plurality of processors 11 may jointly execute the programs to implement the functions. *** Description of how it works ***

[0029] In Fig. 2 to 9, the operation of the mating operation device 10 according to the first embodiment will be described.

[0030] Execution of the operations of the pairing operation device 10 according to the first embodiment is equivalent to a pairing operation method according to the first embodiment. A program that implements the operations of the pairing operation device 10 according to the first embodiment is equivalent to a pairing operation program according to the first embodiment.

[0031] In the first embodiment, the pairing operation device 10 uses a BLS21 curve. The BLS21 curve is a BLS curve with an embedding degree that is not considered in Non-Patent Literature 1 and Non-Patent Literature 2.

[0032] A BLS curve is an elliptic curve defined by a polynomial r(u), a polynomial q(u), a polynomial t(u), an embedding degree k, and a parameter u. However, an elliptic curve with k Ξ 0 mod 18 is excluded. The polynomial r(u), the polynomial q(u), and the polynomial t(u) take different shapes depending on the embedding degree k. The BLS21 curve is the BLS curve with 21 as the embedding degree k.

[0033] A BLS curve E with embedding degree k is an elliptic curve over a finite field F q which is formed by q = q(u) elements. Note that r = r(u) is the largest prime number that determines the order of a subgroup E(F q ) of the elliptic curve E, and that t = t(u) is a course of the elliptic curve E.

[0034] The polynomial r(u), the polynomial q(u), and the polynomial t(u) are polynomial parameters that are determined depending on the degree of embedding k. The parameter u is the parameter that can be determined independently of the degree of embedding k.

[0035] In the first embodiment, the parameter u 2 43 + 2 39 + 2 37 + 2 6 = 9483287789632.

[0036] This parameter u is a value selected based on the following conditions (1) to (3). Condition (1): Both the polynomial r(u) and the polynomial q(u) are prime numbers. Condition (2): The polynomial r(u) is a prime number of approximately 512 bits. Condition (3): The Hamming weight is small.

[0037] Condition (1) is the condition that an elliptic curve is constructed. Condition (2) is the condition that 256 bits of security are achieved. Condition (3) is the condition that a pairing operation is accelerated.

[0038] The above parameter u satisfies conditions (1) and (2), and the Hamming weight is 4. Since the Hamming weight is very small, a matching operation can be accelerated.

[0039] A pairing operation on the elliptic curve E, which is the BLS21 curve, is performed by calculating a rational function f u,Q (P), which is called the Miller function, using two specific points P and Q on the elliptic curve E as inputs and then performing an exponentiation to the power (q(u) 21 -1) / r(u) is calculated.

[0040] Referring to Fig. 2, an entire process in the mating operation apparatus 10 according to the first embodiment will be described. (Step S1: Miller function calculation process)

[0041] The Miller function calculation unit 21 calculates the rational function f u,Q(P) by a Miller algorithm using two points P and Q on the elliptic curve E, which is the BLS21 curve, as input. (Step S2: Process to simplify exponentiation)

[0042] The decomposition unit 221 of the exponentiation simplification unit 22 decomposes using a cyclotomic polynomial Φ 21 an exponent part into an easy part and a difficult part. Furthermore, to simplify exponentiation, the transformation unit 222 of the unit 22 transforms the difficult part obtained by the decomposition by the decomposition unit 221 into a linear sum of the polynomial q(u).

[0043] Specifically, the decomposition unit 221, as in Fig. 3, (q(u) 21-1) / r(u), which is the exponent part in the calculation part of a final exponentiation, into the easy part given in Formula 12 and the difficult part given in Formula 13. The easy part is the part obtained by exponentiations or exponentiations of q(u). The difficult part is the part obtained by exponentiations of u. The transformation unit 222 transforms the difficult part into the linear sum of q(u) with a degree 11, as given in Formula 14. Note that λ i (u) is described later in formula 14.

[0044] However, if the difficult part is simply transformed, 1 / 3 appears as a coefficient. This means a square root must be calculated. The computational effort required to calculate a square root is significant. For this reason, the transformation unit 222 removes 1 / 3, which appears as a coefficient. (q(u)7−1)⋅(q(u)2+q(u)+1) Φ21(q(u))r(u) ∑i=011λi(u)q(u)i (Step S3: Exponentiation calculation process)

[0045] For the rational function f u,Q (P) calculated in step S1, the exponentiation calculation unit 23 calculates exponentiations of the easy part obtained in step S2 and exponentiations of the difficult part transformed into the linear sum in step S2 by the transformation unit 222. As a result, the pairing operation specified in Formula 16 is calculated, in which the pairing operation specified in Formula 15 is further raised to the power of 3.

[0046] The reason for calculating the result of raising the pairing operation to the power of 3 is that 1 / 3, which appears as the coefficient, is removed in step S2. fu,Q(P)q(u)21−1r(u) fu,Q(P)3⋅q(u)21−1r(u)

[0047] With reference to Fig. 4, a Miller function calculation process according to the first embodiment will be described.

[0048] In a step S11, the Miller function calculation unit 21 determines two points P and Q on the elliptic curve E, which is the BLS21 curve.

[0049] In a step S12, the doubling step calculation unit 211 repeatedly performs four doubling steps. In a step S13, the addition step calculation unit 212 performs one addition step. In a step S14, the doubling step calculation unit 211 repeatedly performs two doubling steps. In a step S15, the addition step calculation unit 212 performs one addition step. In a step S16, the doubling step calculation unit 211 repeatedly performs 31 doubling steps. In a step S17, the addition step calculation unit 212 performs one addition step. In a step S18, the doubling step calculation unit 211 repeatedly performs six doubling steps. As a result, the Miller function of the pairing operation is calculated.

[0050] In a step S19, the Miller function calculation unit 21 writes a function value M0, which is the result of the calculation in step S18, into the working memory 12.

[0051] In the first embodiment, the parameter u 2 43 + 2 39 +2 37 + 2 6 . Therefore, the Miller function calculation unit 21 can calculate the Miller function as shown in Fig. 4 is specified.

[0052] With reference to Fig. 5, a process for simplifying exponentiation according to the first embodiment is described.

[0053] In a step S21, the exponentiation simplifying unit 22 determines the polynomial r(u) and the polynomial q(u), which are the polynomial parameters of the elliptic curve E, i.e. the BLS21 curve.

[0054] In a step S22, the first generation unit 223 of the decomposition unit 221 generates a first factor A1(u) of (q(u) 21 -1) / r(u). The first factor A1(u) is a portion of the simple part, as given in Formula 17. The first generation unit 223 writes the first factor A1(u) to memory 12. (q(u)7−1)

[0055] In a step S23, the second generation unit 224 of the decomposition unit 221 generates a second factor A2(u) of (q(u) 21 -1) / r(u). The second factor A2(u) is the remaining portion of the simple part, as given in Formula 18. The second generation unit 224 writes the second factor A2(u) to memory 12. (q(u)2+q(u)+1)

[0056] In a step S24, the transformation unit 222 generates a third factor A3(u) of (q(u) 21-1) / r(u). The third factor A3(u) is the factor obtained by transforming the difficult part into the linear sum with a degree of 11 and removing 1 / 3, which appears as the coefficient, as given in Formula 19. The transformation unit 222 writes the third factor A3(u) to the working memory 12. ∑i=011λi(u)q(u)i

[0057] With reference to Fig. 6, a process for calculating an exponentiation according to the first embodiment will be described.

[0058] In a step S31, the exponentiation calculation unit 23 reads out the function value M0 calculated in the Miller function calculation process and also the first factor A1(u), the second factor A2(u), and the third factor A3(u) generated in the exponentiation simplification process from the working memory 12.

[0059] In step S32, the exponentiation calculation unit 23 calculates an exponentiation in which the base is the function value M0 and the exponent is the first factor A1(u) to generate a value M1. That is, the exponentiation calculation unit 23 calculates the value M1 using formula 20. M1=fu,Q(P)Ai(u)

[0060] In step S33, the exponentiation calculation unit 23 calculates an exponentiation in which the base is the value M1 and the exponent is the second factor A2(u) to generate a value M2. That is, the exponentiation calculation unit 23 calculates the value M2 using formula 21. M2=M1A2(u)

[0061] In step S34, the exponentiation calculation unit 23 calculates an exponentiation in which the base is the value M2 and the exponent is the third factor A3(u) to generate a value M3. That is, the exponentiation calculation unit 23 calculates the value M3 using formula 22. M3=M2A3(u)

[0062] The value M3 is the result of the pairing operation given in formula 16.

[0063] With reference to Fig. 7, a process for generating the first factor A1(u) according to the first embodiment will be described.

[0064] In a step S41, the first generation unit 223 calculates a reciprocal value f u,Q (P) -1 the rational function f u,Q(P). In a step S42, the first generation unit 223 calculates an element specified in formula 23. In a step S43, the first generation unit 223 calculates an element A specified in formula 24 using the inverse f calculated in step S41. u,Q (P) -1 and the element given in formula 23. fu,Q(P)q(u)7 A=fu,Q(P)q(u)7⋅fu,Q(P)−1

[0065] The element A is given in formula 25. Therefore, q(u) 7 - 1 of the exponent part as the first factor A1(u). A=fu,Q(P)q(u)7−1

[0066] With reference to Fig. 8, a process for generating the second factor A2(u) according to the first embodiment will be described.

[0067] In a step S51, the second generation unit 224 determines the element A generated in the process of generating the first factor A1(u). In a step S52, the second generation unit 224 calculates an element specified in Formula 26. In a step S53, the second generation unit 224 calculates an element specified in Formula 27. In a step S54, an element B specified in Formula 28 is calculated using the element A, the element specified in Formula 26, and the element specified in Formula 27. Aq(u) Aq(u)2 B=A⋅Aq(u)⋅Aq(u)2

[0068] The element B is given in formula 29. Therefore, q(u) 2 + q(u) + 1 in the exponent part as the second factor A2(u). B=Aq(u)2+q(u)+1

[0069] With reference to Fig. 9, a process for generating the third factor A3(u) according to the first embodiment will be described.

[0070] The process for generating the third factor A3(u) is the process of extracting terms of q(u) from the difficult part and transforming the difficult part into the linear sum with a degree 11, as given in Formula 30. The difficult part is identified in Formula 30 by identifying λ i (u) is transformed in descending order from i = 0, ..., 11 into the linear sum of q(u) with degree 11.

[0071] In a step S61, the transformation unit 222 determines the element B generated in the process of generating the second factor A2(u).

[0072] In a step S62, the transformation unit 222 generates using the element BB u . In a step S63, the transformation unit 222 generates using the B generated in step S62 uan element specified in Formula 31. In a step S64, the transformation unit 222 generates an element specified in Formula 32 using the element specified in Formula 31 generated in step S63. In a step S65, the transformation unit 222 generates an element specified in Formula 33 using the element specified in Formula 32 generated in step S64. Φ21(q(u))r(u)=∑i=011λi(u)q(u)i Bu3 Bu3 Bu4

[0073] In a step S66, the transformation unit 222 generates an element specified in formula 34 using the B generated in step S62. u and the element generated in step S64, which is specified in formula 32. In a step S67, the transformation unit 222 generates an inverse value, specified in formula 35, of the element generated in step S66, which is specified in formula 34. Bu3⋅Bu B−u3−u

[0074] In a step S68, the transformation unit 222 generates an element C indicated in Formula 36 using the element B, the element B indicated in Formula 33 generated in step S65, and the element indicated in Formula 35 generated in step S67. C=Bu4⋅B−u3−u⋅B u 4 - and 3 - u + 1, the exponent part of the element C, corresponds to λ 11 (u) in Formula 30.

[0075] In a step S69, the transformation unit 222 generates a reciprocal value C -1 of the element C generated in step S68. In a step S70, the transformation unit 222 generates an element D = C u ·C -1 using the element C generated in step S68 and the inverse C generated in step S69 -1 .

[0076] (u-1)λ 11(u), the exponent part of element B in element D, corresponds to λ 10 (u) in Formula 30.

[0077] In a step S71, the transformation unit 222 generates an element E = D u using the element D. uλ generated in step S70 10 (u), the exponent part of element B in element E, corresponds to λ9(u) in formula 30.

[0078] In a step S72, the transformation unit 222 generates an element F = E u ·C using the element C generated in step S68 and the element E generated in step S71. uλ9(u) + λ 11 (u), the exponent part of element B in element F, corresponds to λ8(u) in formula 30.

[0079] In a step S73, the transformation unit 222 generates an element G = F u ·C 1 using the inverse value C generated in step S69 -1 and the element F generated in step S72. uλ8(u) - λ 11(u), the exponent part of element B in element G, corresponds to λ7(u) in formula 30.

[0080] In a step S74, the transformation unit 222 generates an element H = G u using the element G generated in step S73. uλ7(u), the exponent part of the element B in the element H, corresponds to λ6(u) in formula 30.

[0081] In a step S75, the transformation unit 222 generates an element I = H u ·C using the element C generated in step S68 and the element H generated in step S74. uλ6(u)+ λ 11 (u), the exponent part of element B in element I, corresponds to λ5(u) in formula 30.

[0082] In a step S76, the transformation unit 222 generates an element J = I u using the element I generated in step S75. uλ5(u), the exponent part of the element B in the element J, corresponds to λ4(u) in formula 30.

[0083] In a step S77, the transformation unit 222 generates an element K = J u ·C -1 using the element C generated in step S68 and the element J generated in step S76. uλ4(u)- λ 11 (u), the exponent part of the element B in the element K, corresponds to λ3(u) in formula 30.

[0084] In a step S78, the transformation unit 222 generates an element L = J u ·C using the element C generated in step S68 and the element K generated in step S77. uλ3(u)+ λ 11 (u), the exponent part of the element B in the element L, corresponds to λ2(u) in formula 30.

[0085] In a step S79, the transformation unit 222 generates an element M = L u using the element L generated in step S78. uλ2(u), the exponent part of the element B in the element M, corresponds to λ1(u) in formula 30.

[0086] In a step S80, the transformation unit 222 generates an element N = M u ·C -1 B 2 B using the element B, the element C generated in step S68 and the element M generated in step S79. uλ1(u) - λ 11 (u) +3, the exponent part of the element B in the element N, corresponds to λ0(u) in formula 30.

[0087] As a result, the third factor A3(u) given in formula 37 is obtained. A3(u)=∑i=011λi(u)q(u)i where λ11(u)=u4−u3−u+1, λ10(u)=(u−1)λ11(u), λ9(u)=uλ10(u), λ8(u)=uλ9(u)+λ11(u), λ7(u)=uλ8(u)−λ11(u,) λ6(u)=uλ7(u) λ5(u)=uλ6(u)+λ11(u), λ4(u)=uλ5(u), λ3(u)=uλ4(u)−λ11(u), λ2(u)=uλ3(u)+λ11(u), λ1(u)=uλ2(u), λ0(u)=uλ1(u)−λ11(u)+3. *** Effects of the first embodiment ***

[0088] As described above, the pairing operation device 10 according to the first embodiment decomposes using the cyclotomic polynomial Φ 21 The exponent part is divided into the easy part and the difficult part, and the difficult part is transformed into the linear sum of the polynomial q(u). This makes it possible to efficiently compute a pairing operation.

[0089] Specifically, by transforming the difficult part into the linear sum of the polynomial q(u) with a degree of 11, the number of exponentiations of u is significantly reduced at the expense of slightly increasing the number of exponentiations of q(u). It is known that the computational cost of exponentiating u is much higher than the computational cost of exponentiating q(u). Therefore, by transforming the difficult part into the linear sum with a degree of 11, the matching operation device 10 according to the first embodiment can efficiently calculate a matching operation.

[0090] More specifically, in a conventional method for decomposing the exponent part using the cyclotomic polynomial Φ 21 (q(u) 21 -1) / r(u), which is the exponent part in the calculation part of a final exponentiation, decomposed as in Fig. 10. In this case, the easy part, expressed by exponentiations of q(u), includes seven exponentiations of q(u). The difficult part, expressed by one exponentiation of u, includes 212 exponentiations of u and zero exponentiations of q(u).

[0091] In contrast, the pairing operation device 10 according to the first embodiment further decomposes the conventional difficult part into the easy part expressed by exponentiations of q(u) and the difficult part expressed by exponentiations of u, as shown in Fig. 11. Then, the difficult part is transformed into the linear sum of q(u) with a degree of 11. This transforms the conventional difficult part, which includes 212 exponentiations of u and zero exponentiations of q(u), into the simple part, which includes two exponentiations of q(u), and the difficult part, which includes 15 exponentiations of u and 11 exponentiations of q(u). The breakdown of the number of exponentiations of u in the difficult part of the first embodiment is: once for each of λ0(u) to λ 10 (u) and four times for λ 11 (u), which makes a total of 15 times.

[0092] Note that the computational cost for an exponentiation of u is approximately 200 times higher than the computational cost for an exponentiation of q(u). Accordingly, let 1 represent the cost for an exponentiation of q(u), and 200 represent the cost for an exponentiation of u. Then, the cost for the conventional computation part of a final exponentiation is 1 × 7 + 200 × 212 = 42407. In contrast, the cost for the computation part of a final exponentiation of the first embodiment is 1 × 7 + 1 × 2 + 200 × 15 + 1 × 11 = 3020.

[0093] The pairing operation device 10 according to the first embodiment calculates a result of raising a pairing operation to the power of 3 instead of calculating a square root in the final exponentiation calculation part. By eliminating the square root calculation, the computational burden in the final exponentiation calculation part can be reduced.

[0094] If a pairing operation is computed based on the assumption that a result raised to the power of 3 will be obtained, it can be used in the same way as a typical pairing operation.

[0095] The matching operation device 10 according to the first embodiment uses the BLS21 curve as the elliptic curve. No known method for accelerating a matching operation using the BLS21 curve is available. By using the BLS21 curve as the elliptic curve E and transforming the difficult part into the linear sum with a degree of 11, the matching operation device 10 according to the first embodiment can calculate a matching operation more efficiently than in cases where other curves are used.

[0096] The mating operation device 10 according to the first embodiment uses 2 43 + 2 39 + 2 37 + 2 6as parameter u. Therefore, the pairing operation device 10 can calculate the Miller function as in Fig. 4. This allows for efficient calculation of the Miller function. As a result, a pairing operation can be calculated efficiently.

[0097] That is, the parameter u is used that satisfies conditions (1) and (2) and also has a low Hamming weight, as specified in condition (3). This allows for a reduction in the computational effort in the Miller function. *** Other configurations ***<Erste Variante>

[0098] In the first embodiment, the functional components are implemented by software. However, as a first variant, the functional components can be implemented by hardware. Differences from the first embodiment will be described with regard to this first variant.

[0099] Referring to Fig. 12, a configuration of the mating operation device 10 according to a first variant is described.

[0100] When the functional components are realized by hardware, the pairing operation device 10 includes an electronic circuit 15 instead of the processor 11, the memory 12, and the storage medium 13. The electronic circuit 15 is a dedicated circuit that realizes the functions of the functional components, the memory 12, and the storage medium 13.

[0101] The electronic circuit 15 is assumed to be a single circuit, a composite circuit, a programmed processor, a parallel-programmed processor, a logic IC, a gate array (GA), an application-specific integrated circuit (ASCI), or a field-programmable gate array (FPGA).

[0102] The functional components can be realized by a single electronic circuit 15 or can be distributed among and realized by a plurality of electronic circuits 15. <Zweite Variante>

[0103] As a second variant, some of the functional components can be realized by hardware and the remaining functional components can be realized by software.

[0104] The processor 11, the RAM 12, the storage medium 13, and the electronic circuit 15 are each referred to as a processing circuit. This means that the functions of the functional components are implemented by the processing circuit. <Dritte Variante>

[0105] One or more functional components of the functional components of the pairing operation device 10 may be implemented as a separate device. As shown in Fig. 13, the Miller function calculation unit 21 can be implemented, for example, as a Miller function calculation device 10A. As shown in Fig. 14, the exponentiation simplifying unit 22 may be implemented as a device 10B for calculating a final exponentiation. As shown in Fig. 15, the exponentiation simplifying unit 22 and the exponentiation calculating unit 23 can be implemented as a device for calculating a final exponentiation 10C. Second embodiment

[0106] In the first embodiment, the method for a pairing operation was described. In a second embodiment, a process that uses a result of a pairing operation calculated in the first embodiment is described. In the second embodiment, differences from the first embodiment are described, and the description of the same aspects is omitted. *** Description of the configuration ***

[0107] With reference to Fig. 16, a configuration of a cryptographic processing apparatus 30 according to the second embodiment will be described.

[0108] The cryptographic processing device 30 according to the first embodiment includes a cryptographic processing unit 31 in addition to the functional components included in the pairing operation device 10. Like the functional components included in the pairing operation device 10, the cryptographic processing unit 31 is implemented by software or hardware. *** Description of how it works ***

[0109] With reference to Fig. 17, the operation of the cryptographic processing apparatus 30 according to the second embodiment is described.

[0110] Executing the operations of the cryptographic processing device 30 according to the second embodiment is equivalent to a cryptographic processing method according to the second embodiment. A program that implements the operations of the cryptographic processing device 30 according to the second embodiment is equivalent to a cryptographic processing program according to the second embodiment. (Step S61: Pairing operation process)

[0111] A pairing operation is performed by the functional components included in the pairing operation device 10 according to the first embodiment. A result of the pairing operation is written to the working memory 12. (Step S62: Cryptographic Process)

[0112] The cryptographic processing unit 31 performs a cryptographic process using the result of the pairing operation obtained in step S61. The cryptographic process includes processes involving cryptographic primitives, such as an encryption process, a decryption process, a signature process, and a verification process.

[0113] The encryption process is the process of transforming data in a plaintext state into a ciphertext in order to hide the data from third parties. The decryption process is the process of transforming a ciphertext that has been encrypted by the encryption process into data in a plaintext state. The signature process is the process of generating a signature to detect the forgery of data and / or to verify the data source. The verification process is the process of performing a detection of the forgery of data and / or the

[0114] Verification of the data source using a signature generated in the signature process.

[0115] For example, it is conceivable that the cryptographic processing unit 31 uses a result of the pairing operation that takes an element of a ciphertext and an element of a decryption key as inputs to generate a message obtained by decrypting the ciphertext. *** Effects of the second embodiment ***

[0116] As described above, the cryptographic processing device 30 according to the second embodiment implements a cryptographic process using the functional components of the pairing operation device 10 according to the first embodiment. The pairing operation device 10 according to the first embodiment can efficiently calculate a pairing operation. Therefore, the cryptographic processing device 30 according to the second embodiment can efficiently implement a cryptographic process. List of reference symbols

[0117] 10: pairing operation device, 10A: Miller function calculation device, 10B: final exponentiation simplification device, 10C: final exponentiation calculation device, 11: processor, 12: main memory, 13: storage medium, 14: communication interface, 15: electronic circuit, 21: Miller function calculation unit, 22: exponentiation simplification unit, 221: decomposition unit, 222: transformation unit, 223: first generation unit, 224: second generation unit, 23: exponentiation calculation unit, 30: cryptographic processing device, 31: cryptographic processing unit.

Claims

[1] Apparatus (10C) for calculating a final exponentiation, comprising: a decomposition unit (221) for decomposing an exponent part into an easy part, which is given in formula 1, and a difficult part, which is given in formula 2, using a cyclotomic polynomial, wherein the exponent part in a calculation of the final exponentiation is part of a pairing operation on an elliptic curve represented by a polynomial r(u), a polynomial q(u), a polynomial t(u), an embedding degree k and a parameter u, and is a Barreto-Lynn-Scott (BLS) curve 21 with 21 as the embedding degree k; and a transformation unit (222) for transforming the difficult part obtained as a result of the decomposition by the decomposition unit (221) into a linear sum of the polynomial q(u) given in formula 3 (q(u)7−1)⋅(q(u)2+q(u)+1) Φ21(q(u))r(u) ∑i=011λi(u)q(u)i where λ11(u)=u4−u3−u+1, λ10(u)=(u−1)λ11(u), λ9(u)=uλ10(u), λ8(u)=uλ9(u)+λ11(u), λ7(u)=uλ8(u)−λ11(u), λ6(u)=uλ7(u), λ5(u)=uλ6(u)+λ11(u), λ4(u)=uλ5(u), λ3(u)=uλ4(u)−λ11(u), λ2(u)=uλ3(u)+λ11(u), λ1(u)=uλ2(u), λ0(u)=uλ1(u)−λ11(u)+3. [2] Device (10C) for calculating a final exponentiation according to claim 1, where the parameter u 2 43 + 2 39 2 37 + 2 6 is. [3] A mating operation device (10) comprising: the device (10C) for calculating a final exponentiation according to claim 2; and a Miller function calculation unit (21) for calculating a Miller function of the pairing operation by repeating doubling steps four times, performing an addition step, repeating doubling steps twice, performing an addition step, repeating doubling steps 31 times, performing an addition step, and repeating doubling steps six times. [4] The mating operation device (10) according to claim 3, further comprising a final exponentiation calculation device (23) which calculates, for a function value which is a result calculated by the Miller function calculation unit (21), an exponentiation of the easy part and an exponentiation of the difficult part which has been transformed into the linear sum by the transformation unit (222), to calculate a result of the pairing operation. [5] Cryptographic processing device (30) for performing a cryptographic process using a result of a pairing operation calculated by the pairing operation device (10) according to claim 3 or 4. [6] A method for calculating a final exponentiation, comprising: Decomposing an exponent part into an easy part, which is given in formula 4, and a difficult part, which is given in formula 5, using a cyclotomic polynomial, wherein the exponent part is part of a calculation of a final exponentiation in a pairing operation on an elliptic curve represented by a polynomial r(u), a polynomial q(u), a polynomial t(u), an embedding degree k, and a parameter u, and is a Barreto-Lynn-Scott (BLS) curve 21 with 21 as the embedding degree k, by a decomposition unit (221) in a device (10C) for calculating a final exponentiation; and Transforming the difficult part into a linear sum of the polynomial q(u) given in formula 6 by a transformation unit (222) in the device (10C) for calculating a final exponentiation (q(u)7−1)⋅(q(u)2+q(u)+1) Φ21(q(u))r(u) ∑i=011λi(u)q(u)i where λ11(u)=u4−u3−u+1, λ10(u)=(u−1)λ11(u), λ9(u)=uλ10(u), λ8(u)=uλ9(u)+λ11(u), λ7(6)=uλ7(u)−λ11(u), λ6(u)=uλ7(u), λ5(u)=uλ6(u)+λ11(u), λ4(u)=uλ5(u), λ3(u)=uλ4(u)−λ11(u), λ2(u)=uλ3(u)+λ11(u), λ1(u)=uλ2(u), λ0(u)=uλ1(u)−λ11(u)+3. [7] A program for calculating a final exponentiation, which causes a computer to act as a device (10C) for calculating a final exponentiation to perform: a decomposition process for decomposing an exponent part into an easy part given in Formula 7 and a difficult part given in Formula 8 using a cyclotomic polynomial, wherein the exponent part is part of a calculation of a final exponentiation in a pairing operation on an elliptic curve represented by a polynomial r(u), a polynomial q(u), a polynomial t(u), an embedding degree k, and a parameter u, and is a Barreto-Lynn-Scott (BLS) curve 21 with 21 as the embedding degree k; and a transformation process for transforming the difficult part obtained as a result of the decomposition by the decomposition process into a linear sum of the polynomial q(u) given in formula 9 (q(u)7−1)⋅(q(u)2+q(u)+1) Φ21(q(u))r(u) ∑i=011λi(u)q(u)i where λ11(u)=u4−u3−u+1, λ10(u)=(u−1)λ11(u), λ9(u)=uλ10(u), λ8(u)=uλ9(u)+λ11(u), λ7(u)=uλ8(u)−λ11(u), λ6(u)=uλ7(u), λ5(u)=uλ6(u)+λ11(u), λ4(u)=uλ5(u), λ3(u)=uλ4(u)−λ11(u), λ2(u)=uλ3(u)+λ11(u), λ1(u)=uλ2(u), λ0(u)=uλ1(u)−λ11(u)+3.

Citation Information

Patent Citations

  • Parameter conversion method, parameter conversion device, parameter conversion program, pairing operation method, pairing operation device and pairing operation program

    JP2018205511A