US8934631B2 - Decompressing apparatus and compressing apparatus - Google Patents

Decompressing apparatus and compressing apparatus Download PDF

Info

Publication number
US8934631B2
US8934631B2 US13/225,964 US201113225964A US8934631B2 US 8934631 B2 US8934631 B2 US 8934631B2 US 201113225964 A US201113225964 A US 201113225964A US 8934631 B2 US8934631 B2 US 8934631B2
Authority
US
United States
Prior art keywords
equation
solutions
expression data
affine
unit
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Fee Related, expires
Application number
US13/225,964
Other versions
US20120150931A1 (en
Inventor
Yoshikazu HANATANI
Taichi Isogai
Hirofumi Muratani
Tomoko Yonemura
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Toshiba Corp
Original Assignee
Toshiba Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Toshiba Corp filed Critical Toshiba Corp
Assigned to KABUSHIKI KAISHA TOSHIBA reassignment KABUSHIKI KAISHA TOSHIBA ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: Isogai, Taichi, HANATANI, YOSHIKAZU, MURATANI, HIROFUMI, YONEMURA, TOMOKO
Publication of US20120150931A1 publication Critical patent/US20120150931A1/en
Application granted granted Critical
Publication of US8934631B2 publication Critical patent/US8934631B2/en
Expired - Fee Related legal-status Critical Current
Adjusted expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G09EDUCATION; CRYPTOGRAPHY; DISPLAY; ADVERTISING; SEALS
    • G09CCIPHERING OR DECIPHERING APPARATUS FOR CRYPTOGRAPHIC OR OTHER PURPOSES INVOLVING THE NEED FOR SECRECY
    • G09C1/00Apparatus or methods whereby a given sequence of signs, e.g. an intelligible text, is transformed into an unintelligible sequence of signs by transposing the signs or groups of signs or by replacing them by others according to a predetermined system
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F17/00Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10Complex mathematical operations
    • G06F17/11Complex mathematical operations for solving equations, e.g. nonlinear equations, general mathematical optimization problems
    • G06F17/12Simultaneous equations, e.g. systems of linear equations
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/30Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy
    • H04L9/3066Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy involving algebraic varieties, e.g. elliptic or hyper-elliptic curves
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L2209/00Additional information or applications relating to cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00
    • H04L2209/30Compression, e.g. Merkle-Damgard construction

Definitions

  • Embodiments described herein relate generally to a decompressing apparatus and a compressing apparatus for elements over a finite field.
  • FIG. 1 is a block diagram of a compressing apparatus according to a first embodiment
  • FIG. 2 is a flowchart of a compression processing according to the first embodiment
  • FIG. 3 is a block diagram of a decompressing apparatus according to the first embodiment
  • FIG. 4 is a flowchart of decompression processing according to the first embodiment
  • FIG. 5 is a block diagram of a compressing apparatus according to a second embodiment
  • FIG. 6 is a block diagram of a decompressing apparatus according to the second embodiment.
  • FIG. 7 is a block diagram of a compressing apparatus according to a third embodiment.
  • FIG. 8 is a block diagram of a decompressing apparatus according to the third embodiment.
  • FIG. 9 is a block diagram of a decompressing apparatus according to a fourth embodiment.
  • FIG. 10 is a hardware structure diagram of the decompressing apparatus and the compressing apparatus according to each embodiment.
  • a decompressing apparatus includes an input unit, a calculating unit, a first selecting unit, and a decompressing unit.
  • the input unit inputs additional data, which is obtained based on trace expression data in which an element in a subgroup of a multiplicative group of a finite field is trace-expressed and affine expression data in which the trace expression data is affine-expressed, and the trace expression data.
  • the calculating unit calculates a plurality of solutions of simultaneous equations derived by the trace expression data.
  • the first selecting unit selects any of a plurality of items of affine expression data in which the element is affine-expressed based on the additional data, the affine expression data being found from the solutions.
  • the decompressing unit decompresses the selected affine expression data to the element.
  • Fpm indicates a finite field having p ⁇ m elements, and is called an m-th degree extension field of Fp.
  • F3m indicates an m-th degree extension field of a finite field F3 having three elements.
  • a ⁇ b indicates the b-th power of a.
  • the b-th power of a may be expressed as a b .
  • a finite field Fq will be considered.
  • q ⁇ 5 (mod 7) is obtained.
  • An affine transform map Af:Fq6 ⁇ Fq3 and an affine transform inverse map Af ⁇ 1 ⁇ :Fq3 ⁇ Fq6 are defined in the equation (2).
  • Af ( g ) ( G 1+1)/ G 2
  • Af ⁇ 1 ⁇ ( Af ( g )) ( Af ( g )+ z )/( Af ( g )+ z ⁇ q ) (2)
  • FIG. 1 is a block diagram illustrating an exemplary structure of a compressing apparatus 100 according to the first embodiment.
  • the compressing apparatus 100 comprises an input unit 101 , a first transforming unit 102 , a second transforming unit 103 , an additional bit deciding unit 104 , an output unit 105 and a storing unit 121 .
  • the input unit 101 is directed for inputting an element in an algebraic torus subset to be compressed.
  • the first transforming unit 102 transforms the input element into trace expression data expressed in a trace expression. In the following, the trace expression data will be simply called trace expression.
  • the first transforming unit 102 transforms the input element into the trace expression by the trace map Tr.
  • the second transforming unit 103 transforms the input element into affine expression data expressed in an affine expression.
  • the affine expression data will be simply called affine expression.
  • the second transforming unit 103 transforms the input element into the affine expression by the affine transform map Af.
  • the additional bit deciding unit 104 decides an additional bit based on the trace expression data in which the element in the subgroup of the multiplicative group of the finite field (the algebraic torus of the finite field expression) is trace-expressed and the affine expression data in which the element in the subgroup of the multiplicative group of the finite field is affine-expressed.
  • the additional bit deciding unit 104 decides additional data (hereinafter referred to as additional bit below) for finding the affine expression from the solutions of predetermined simultaneous equations based on the trace expression and the affine expression.
  • the additional bit is decided based on the candidates of the affine expression obtained by decompressing the trace expression data in which the element in the subgroup of the multiplicative group of the finite field (the algebraic torus of the finite field expression) is trace-expressed and the affine expression data in which the element in the subgroup of the multiplicative group of the finite field (the algebraic torus of the finite field expression) is affine-expressed.
  • the output unit 105 outputs the trace expression and the additional bit.
  • the storing unit 121 stores information used for finding previously-derived equations to be used for deciding the additional bit.
  • FIG. 2 is a flowchart illustrating a flow of the entire compression processing according to the first embodiment.
  • the input unit 101 inputs an element g in an algebraic torus subgroup (step S 101 ).
  • the first transforming unit 102 inputs g into the trace map to calculate the trace expression Tr(g) (step S 102 ).
  • the second transforming unit 103 inputs g into the affine map to calculate the affine expression of ( ⁇ +1, ⁇ +1, ⁇ +1) ⁇ Fq3 (step S 103 ).
  • the additional bit deciding unit 104 decides multivariable simultaneous equations derived by the conditions for the trace expression and the algebraic torus and the condition for the finite field (step S 104 ).
  • the additional bit deciding unit 104 solves the multivariable simultaneous equations to decide the additional bit (step S 105 ).
  • the output unit 105 outputs the trace expression and the additional bit (Tr(g), i) (step S 106 ). Any method that can discriminate the six solutions may be used for deciding the additional bit not only by arranging and deciding the six solutions in descending order but also by arranging and deciding them in ascending order.
  • the compression at the compression rate of 1/6 can be realized by the trace map Tr:Fq6 ⁇ Fq. i can be expressed by three bits due to 1 ⁇ i ⁇ 6. In other words, the additional bit i rarely affects the compression rate of 1/6.
  • step S 104 The method for deriving the multivariable simultaneous equations (step S 104 ) and the method for solving the multivariable simultaneous equations (step S 105 ) can be achieved with the same structure as a decompressing apparatus 200 .
  • the respective processing will be described in detail along with the structure of the decompressing apparatus 200 .
  • FIG. 3 is a block diagram illustrating an exemplary structure of the decompressing apparatus 200 according to the first embodiment.
  • the decompressing apparatus 200 comprises an input unit 201 , a calculating unit 210 , a first selecting unit 202 , a decompressing unit 203 , an output unit 204 and a storing unit 221 .
  • the input unit 201 inputs the trace expression and the additional bit output from the compressing apparatus 100 .
  • the calculating unit 210 derives the multivariable simultaneous equations from the input trace expression and calculates the solutions of the multivariable simultaneous equations.
  • the calculating unit 210 comprises a first equation deriving unit 211 , a first solution finding unit 212 , a second equation deriving unit 213 , a second solution finding unit 214 , a third equation deriving unit 215 and a third solution finding unit 216 .
  • the first equation deriving unit 211 derives the first equation obtained by inputting the input trace expression data into a preset coefficient in a previously-found k 1 -th (k 1 is a preset integer of 1 or more) degree equation over the finite field Fq.
  • k 1 is a preset integer of 1 or more degree equation over the finite field Fq.
  • the first solution finding unit 212 finds the solutions of the first equation.
  • the third equation deriving unit 215 derives the third equation obtained by inputting at least one of the solutions found by the first solution finding unit 212 and the solutions found by the second solution finding unit 214 into a preset coefficient in a previously-found k 3 -th (k 3 is a preset integer of 1 or more) degree equation over the finite field Fq.
  • k 3 is a preset integer of 1 or more degree equation over the finite field Fq.
  • the third solution finding unit 216 finds the solutions of the third equation.
  • the first selecting unit 202 finds a plurality of affine expressions from the plurality of solutions calculated by the calculating unit 210 and selects any affine expression corresponding to the additional data from among the found affine expressions.
  • the decompressing unit 203 decompresses the selected affine expression to the element in the algebraic torus subgroup before the compression.
  • the decompressing unit 203 transforms the affine expression into the pre-compression element by the affine transform inverse map Af ⁇ 1 ⁇ .
  • the output unit 204 outputs the decompressed element in the algebraic torus subgroup.
  • the storing unit 221 stores information for finding previously-derived equations used for deciding the additional bit as the storing unit 121 in the compressing apparatus 100 does.
  • the storing unit 121 and the storing unit 221 may be configured of any generally-used storage medium such as HDD (Hard Disk Drive), optical disk, memory card or RAM (Random Access Memory).
  • FIG. 4 is a flowchart illustrating a flow of the entire decompression processing in the first embodiment.
  • the input unit 201 inputs the trace expression T ⁇ Fq and the additional bit j ⁇ F2 ⁇ 3 (step S 201 ).
  • the calculating unit 210 derives the multivariable simultaneous equations from the input trace expression and calculates the solutions of the multivariable simultaneous equations (step S 202 ). The calculation processing by the calculating unit 210 will be detailed below.
  • the first selecting unit 202 selects (decides) the affine expression based on the calculated solutions and the input additional bit (step S 203 ).
  • the decompressing unit 203 decompresses the affine expression to the element g in the algebraic torus subgroup (step S 204 ).
  • the output unit 204 outputs the element g in the algebraic torus subgroup which is obtained by the decompression (step S 205 ).
  • step S 202 The calculation processing by the calculating unit 210 in step S 202 will be detailed below.
  • the first equation deriving unit 211 derives the quadric equation A(x) expressed in the equation (3) (step S 202 ).
  • a ( x ): x ⁇ 2+( T ⁇ t ⁇ 2 ⁇ +1) ⁇ 1 ⁇ 0over Fq (3)
  • the first equation deriving unit 211 reads the information for finding the above A(x) from the storing unit 221 , for example.
  • the information contains relationships between coefficients and variables and information for specifying a preset coefficient for inputting the trace expression.
  • the first equation deriving unit 211 inputs the trace expression input into the preset coefficient to decide A(x) with reference to the information.
  • the first equation deriving unit 211 sends the decided A(x) to the first solution finding unit 212 .
  • the first solution finding unit 212 sends the found solutions a1 and a2 to the second equation deriving unit 213 and the third equation deriving unit 215 .
  • the second equation deriving unit 213 derives the cubic equations B(x) and C(x) expressed by the equations (4) and (5).
  • B ( x ): x ⁇ 3 ⁇ a 1 ⁇ x ⁇ 2 ⁇ ( a 1 ⁇ 2 ⁇ 1) x ⁇ Z ( a 1) 0 over Fq (4)
  • C ( x ): x ⁇ 3 ⁇ a 2 ⁇ x ⁇ 2 ⁇ ( a 2 ⁇ 2 ⁇ 1) x ⁇ Z ( a 2) 0 over Fq (5)
  • the second equation deriving unit 213 sends B(x) and C(x) to the second solution finding unit 214 .
  • the second solution finding unit 214 sends the solutions (b1, b2, b3) and (c1, c2, c3) to the third equation deriving unit 215 .
  • the third equation deriving unit 215 derives the linear equations D(x), E(x), F(x), G(x), H(x) and I(x) expressed in the equations (6) to (11).
  • the third equation deriving unit 215 sends D(x), E(x), F(x), G(x), H(x) and I(x) to the third solution finding unit 216 .
  • the third solution finding unit 216 finds the solutions d, e, f, g, h and i.
  • the third solution finding unit 216 sends six combinations of solutions (a1 ⁇ b1 ⁇ d, b1, d), (a1 ⁇ b2 ⁇ e, b2, e), (a1 ⁇ b3 ⁇ f, b3, f), (a2 ⁇ c1 ⁇ g, c1, g), (a2 ⁇ c2 ⁇ h, c2, h) and (a2 ⁇ c3 ⁇ i, c3, i) from the above solutions and the solutions b1, b2, b3, c1, c2, c3 of the cubic equations B(x) and C(x) to the first selecting unit 202 .
  • the first selecting unit 202 calculates (a1 ⁇ b1 ⁇ d+1, b1+1, d+1), (a1 ⁇ b2 ⁇ e+1, b2+1, e+1), (a1 ⁇ b3 ⁇ f+1, b3+1, f+1), (a2 ⁇ c1 ⁇ g+1, c1+1, g+1), (a2 ⁇ c2 ⁇ h+1, c2+1, h+1) and (a2 ⁇ c3 ⁇ i+1, c3+1, i+1), each element in the six combinations of solutions being added with 1.
  • the first selecting unit 202 arranges the calculated six solutions according to a predetermined rule. The solutions are arranged in descending order in the following, but the rule is not limited to that.
  • the first selecting unit 202 selects the j-th largest value from among the six arranged solutions. The value corresponds to the desired affine expression. The first selecting unit 202 sends the selected value (affine expression) to the decompressing unit 203 .
  • the decompressing unit 203 transforms the received affine expression into the finite field expression of the algebraic torus subgroup by the affine transform inverse map Af ⁇ 1 ⁇ , and outputs the finite field expression.
  • Tr(g′) can be calculated not by decompressing the trace expression Tr(g) but by operating the additional bit by use of the property that the trace expressions Tr(g) and Tr(g′) are identical for a certain element g over the algebraic torus subgroup and an element g′ obtained by calculating a Frobenius map.
  • a decompressing apparatus uses part of additional bits to narrow equations to be solved. Thus, compression and decompression can be more efficiently performed.
  • the structure of algebraic torus is the same as that of the first embodiment and thus an explanation thereof will be omitted.
  • FIG. 5 is a block diagram illustrating an exemplary structure of a compressing apparatus 100 - 2 according to the second embodiment.
  • the compressing apparatus 100 - 2 comprises the input unit 101 , the first transforming unit 102 , the second transforming unit 103 , an additional bit deciding unit 104 - 2 , the output unit 105 and the storing unit 121 .
  • the second embodiment is different from the first embodiment in the function of the additional bit deciding unit 104 - 2 .
  • Other structures and functions are the same as those of the compressing apparatus 100 according to the first embodiment illustrated in the block diagram of FIG. 1 , and thus are denoted by the same reference numerals as those in FIG. 1 and an explanation thereof will be omitted.
  • the additional bit deciding unit 104 - 2 solves a quadric equation derived based on the conditions for the trace expression and the algebraic torus and the condition for the finite field, thereby finding the solutions a1 and a2.
  • the additional bit deciding unit 104 - 2 derives the cubic equation based on the trace expression, the sums of elements in the affine expression, the condition for the torus, and the condition for the finite field.
  • the additional bit deciding unit 104 - 2 derives the linear equation based on the solutions of the cubic equation and finds three candidates for the affine expression.
  • the additional bit deciding unit 104 - 2 arranges the found candidates in descending order, compares them with the affine expression of g, and when the candidate coincides with i2-th (1 ⁇ i2 ⁇ 3) element, decides i2 as the additional bit 2.
  • the output unit 105 outputs the additional bits i1 and i2 together with the trace expression.
  • FIG. 6 is a block diagram illustrating an exemplary structure of the decompressing apparatus 200 - 2 according to the second embodiment.
  • the decompressing apparatus 200 - 2 comprises the input unit 201 , a calculating unit 210 - 2 , a first selecting unit 202 - 2 , the decompressing unit 203 , the output unit 204 and the storing unit 221 .
  • the second embodiment is different from the first embodiment in the functions of the calculating unit 210 - 2 and the first selecting unit 202 - 2 .
  • the other structures and functions are the same as those of the decompressing apparatus 200 according to the first embodiment illustrated in the block diagram of FIG. 3 , and thus are denoted by the same reference numerals and an explanation thereof will be omitted.
  • the calculating unit 210 - 2 further comprises a second selecting unit 217 .
  • the functions of the first equation deriving unit 211 and the first solution finding unit 212 are the same as those in the first embodiment, and thus are denoted by the same reference numerals and an explanation thereof will be omitted.
  • the second selecting unit 217 uses the additional bit 1 (i1) among the input additional bits to select the i1-th solution when the solutions obtained by the first solution finding unit 212 are arranged in descending order.
  • the second equation deriving unit 213 - 2 uses the solution selected by the second selecting unit 217 to derive the second equation.
  • the second solution finding unit 214 - 2 finds the solutions of the second equation.
  • the third equation deriving unit 215 - 2 derives the third equation obtained by inputting at least one of the solution selected by the second selecting unit 217 and the solutions found by the second solution finding unit 214 - 2 .
  • the third solution finding unit 216 - 2 finds the solutions of the third equation.
  • the first selecting unit 202 - 2 is different from the first selecting unit 202 according to the first embodiment in that the additional data i2 among the items of additional data is used to select a solution.
  • the input unit 201 sends the trace expression T to the first equation deriving unit 211 .
  • the first equation deriving unit 211 derives the quadric equation A(x) by the above processing, and sends it to the first solution finding unit 212 .
  • the second selecting unit 217 arranges the solutions a1 and a2 in descending order, selects the i1-th element as a and sends it to the second equation deriving unit 213 - 2 and the third equation deriving unit 215 - 2 .
  • the second equation deriving unit 213 - 2 derives the cubic equation B(x) expressed in the equation (12).
  • Z(x) and Y(x) are as noted above.
  • B ( x ): x ⁇ 3 ⁇ a ⁇ x ⁇ 2 ⁇ ( a ⁇ 2 ⁇ 1) x ⁇ Z ( a ) 0 over Fq (12)
  • the second equation deriving unit 213 - 2 sends B(x) to the second solution finding unit 214 - 2 .
  • the second solution finding unit 214 - 2 sends the solution (b1, b2, b3) to the third equation deriving unit 215 - 2 .
  • the third equation deriving unit 215 - 2 derives the linear equations D(x), E(x) and F(x) expressed in the equations (13) to (15).
  • D ( x ):( ⁇ b 1 ⁇ 2 ⁇ +( a +(1 /a )) ⁇ b 1) ⁇ x+Z ( a )+( ⁇ a +(1 /a )) ⁇ b 1 ⁇ 2 ⁇ ( Y ( a )/ a ) ⁇ b 1 0 over Fq (13)
  • E ( x ):( ⁇ b 2 ⁇ 2 ⁇ +( a +(1 /a )) ⁇ b 2) ⁇ x+Z ( a )+( ⁇ a +(1 /a )) ⁇ b 2 ⁇ 2 ⁇ ( Y ( a )/ a ) ⁇ b 2 0 over Fq (14)
  • the third equation deriving unit 215 - 2 sends the linear equations D(x), E(x) and F(x) to the third solution finding unit 216 - 2 .
  • the third solution finding unit 216 - 2 finds their solutions d, e and f.
  • the third solution finding unit 216 - 2 sends three combinations of solutions (a ⁇ b1 ⁇ d, b1, d), (a ⁇ b2 ⁇ e, b2, e) and (a ⁇ b3 ⁇ f, b3, f) to the first selecting unit 202 - 2 .
  • the first selecting unit 202 - 2 calculates (a ⁇ b1 ⁇ d+1, b1+1, d+1), (a ⁇ b2 ⁇ e+1, b2+1, e+1) and (a ⁇ b3 ⁇ f+1, b3+1, f+1), each element in the three combinations of solutions being added with 1.
  • the first selecting unit 202 - 2 arranges the three calculated solutions in descending order.
  • the first selecting unit 202 - 2 selects the i2-th largest solution among the three arranged solutions.
  • the value corresponds to the desired affine expression.
  • the first selecting unit 202 - 2 sends the selected value (affine expression) to the decompressing unit 203 .
  • the decompressing unit 203 transforms the received affine expression into the finite field expression of the algebraic torus subgroup and outputs the resulting finite field expression.
  • the compressing apparatus and the decompressing apparatus can separately calculate the additional bits i1 and i2 and can use the additional bit i1 to early narrow the equations to be solved. Thereby, the compression and the decompression can be more efficiently performed.
  • the affine transform map Af:Fq4 ⁇ Fq2 and the affine transform inverse map Af ⁇ 1 ⁇ :Fq2 ⁇ Fq4 are defined in the equation (17).
  • Af ( g ) ( G+ 1)/ G 2 ⁇ Fq 2
  • Af ⁇ 1 ⁇ ( Af ( g )) ( Af ( g )+ z )/( Af ( g )+ z ⁇ q ) ⁇ Fq 4 (17)
  • FIG. 7 is a block diagram illustrating an exemplary structure of a compressing apparatus 100 - 3 according to a third embodiment.
  • the compressing apparatus 100 - 3 comprises the input unit 101 , a first transforming unit 102 - 3 , a second transforming unit 103 - 3 , an additional bit deciding unit 104 - 3 , the output unit 105 and the storing unit 121 .
  • the constituents having the same functions as those of the first embodiment are denoted by the same reference numerals as those in FIG. 1 and an explanation thereof will be omitted.
  • the first transforming unit 102 - 3 transforms the element g input from the trace map Tr in the equation (16) into the trace expression Tr(g).
  • the second transforming unit 103 - 3 transforms the element g input from the affine transform map Af in the equation (17) into the affine expression ( ⁇ , ⁇ ) ⁇ Fq ⁇ Fq.
  • the additional bit deciding unit 104 - 2 decides the least significant bit of ⁇ as the additional bit 1 and the least significant bit of ⁇ as the additional bit 2.
  • FIG. 8 is a block diagram illustrating an exemplary structure of a decompressing apparatus 200 - 3 according to the third embodiment.
  • the decompressing apparatus 200 - 3 comprises the input unit 201 , a calculating unit 210 - 3 , a first selecting unit 202 - 3 , a decompressing unit 203 - 3 , the output unit 204 and the storing unit 221 .
  • the constituents having the same functions as those of the first embodiment are denoted by the same reference numerals as those in FIG. 3 and an explanation thereof will be omitted.
  • the calculating unit 210 - 3 comprises a first equation deriving unit 211 - 3 , a first solution finding unit 212 - 3 , a second equation deriving unit 213 - 3 and a second solution finding unit 214 - 3 .
  • the first equation deriving unit 211 - 3 derives the first equation as a different quadric equation from the first embodiment.
  • the first solution finding unit 212 - 3 finds the solutions of the first equation.
  • the second equation deriving unit 213 - 3 derives the second equation as a quadric equation, unlike the first embodiment.
  • the second solution finding unit 214 - 3 finds the solutions of the second equation.
  • the first selecting unit 202 - 3 selects any solution corresponding to the additional data from among the solutions calculated by the calculating unit 210 - 3 .
  • the first equation deriving unit 211 - 3 derives the quadric equation A(x) expressed in the equation (18) and sends it to the first solution finding unit 212 - 3 .
  • a ( x ): x ⁇ 2 +x +1 ⁇ T ⁇ q ⁇ t ⁇ 0 over Fq (18)
  • the first solution finding unit 212 - 3 may transform the term of x ⁇ 2 into a linear term by using a Frobenius map, thereby solving the transformed linear equation.
  • the second equation deriving unit 213 - 3 derives the quadric equations B(x) and C(x) expressed in the equations (19) and (20) and sends them to the second solution finding unit 214 - 3 .
  • B ( x ): x ⁇ 2 +x+a 1 ⁇ 2 +a 1 ⁇ t ⁇ T ⁇ q ⁇ t ⁇ 0 over Fq (19)
  • C ( x ): x ⁇ 2 +x+a 2 ⁇ 2 +a 2 ⁇ t ⁇ T ⁇ q ⁇ t ⁇ 0 over Fq (20)
  • the second solution finding unit 214 - 3 sends the solutions b1, b2, c1 and c2 to the first selecting unit 202 - 3 .
  • the first selecting unit 202 - 3 finds four combinations of solutions (a1 ⁇ b1, b1), (a1 ⁇ b2, b2), (a2 ⁇ c1, c1) and (a2 ⁇ c2, c2).
  • the first selecting unit 202 - 3 compares the least significant bit of the first component in each combination (a1 ⁇ b1, a1 ⁇ b2, a2 ⁇ c1, a2 ⁇ c2) with the additional bit 1, compares the least significant bit of the second component in each combination (b1, b2, c1, c2) with the additional bit 2, and selects the coincident pair.
  • the value of the pair corresponds to the desired affine expression.
  • the first selecting unit 202 - 3 sends the selected value (affine expression) to the decompressing unit 203 - 3 .
  • the decompressing unit 203 - 3 transforms the received affine expression into the finite filed expression of the algebraic torus subgroup and outputs it.
  • the third embodiment can realize the compression at the compression rate of 1/4 and the decompression similar to the first embodiment.
  • a compressing apparatus according to the fourth embodiment is the same as the compressing apparatus 100 - 3 according to the third embodiment.
  • FIG. 9 is a block diagram illustrating an exemplary structure of a decompressing apparatus 200 - 4 according to the fourth embodiment.
  • the decompressing apparatus 200 - 4 comprises the input unit 201 , a calculating unit 210 - 4 , a first selecting unit 202 - 4 , a decompressing unit 203 - 3 , the output unit 204 and the storing unit 221 .
  • the constituents having the same functions as those of the third embodiment are denoted by the same reference numerals as those in FIG. 8 and an explanation thereof will be omitted.
  • the calculating unit 210 - 4 comprises a first equation deriving unit 211 - 3 , the first solution finding unit 212 - 3 , a second selecting unit 217 - 4 , a second equation deriving unit 213 - 4 and a second solution finding unit 214 - 4 .
  • the second selecting unit 217 - 4 uses the additional bit 1(i1) and the additional bit 2(i2) among the input additional bits to compare the least significant bit of the solutions obtained by the first solution finding unit 212 - 3 with the sum of the additional bit 1(i1) and the additional bit 2(i2) over F2, thereby selecting the coincident solution.
  • the second equation deriving unit 213 - 4 uses the solution selected by the second selecting unit 217 - 4 to decide the second equation.
  • the second solution finding unit 214 - 4 finds the solutions of the second equation.
  • the first equation deriving unit 211 - 3 derives the quadric equation A(x) expressed in the equation (18) and sends it to the first solution finding unit 212 - 3 .
  • the first solution finding unit 212 - 3 sends the solutions a1 and a2 to the second selecting unit 217 - 4 .
  • a Frobenius map may be used to transform the term of x ⁇ 2 into a linear term to solve the transformed linear equation.
  • the second selecting unit 217 - 4 compares the sum of the additional bit 1(i1) and the additional bit 2(i2) over F2 with the least significant bit of the solutions a1, a2, and selects the coincident solution as the solution a.
  • the second selecting unit 217 - 4 sends the selected solution a to the second equation deriving unit 213 - 4 .
  • the second equation deriving unit 213 - 4 derives the quadric equation B(x) expressed in the equation (21) and sends it to the second solution finding unit 214 - 4 .
  • B ( x ): x ⁇ 2 +x+a ⁇ 2 +a ⁇ t ⁇ T ⁇ q ⁇ t ⁇ 0 over Fq (21)
  • the second solution finding unit 214 - 4 sends the solutions b1 and b2 to the first selecting unit 202 - 4 .
  • the first selecting unit 202 - 4 compares the additional bit 2(i2) with the least significant bit of the solutions b1, b2, and selects the coincident solution as the solution b.
  • the first selecting unit 202 - 4 sends (a ⁇ b, b) ⁇ Fq ⁇ Fq obtained from the solutions a and b to the decompressing unit 203 - 3 .
  • (a ⁇ b, b) corresponds to the desired affine expression.
  • the decompressing unit 203 - 3 transforms the received affine expression into the finite field expression of the algebraic torus subgroup and outputs it.
  • the fourth embodiment can realize the compression at the compression rate of 1/4 and the decompression similar to the second embodiment.
  • the compressing apparatus and the decompressing apparatus according to each of the above embodiments can be provided inside an apparatus for encoding and decoding a public key encryption, for example.
  • the compressing apparatus may be provided in an information processing apparatus (encoding apparatus) for transmitting the data encoded by the public key encryption and the decompressing apparatus may be provided in an information processing apparatus (decoding apparatus) for receiving and decoding the encoded data.
  • a compressing/decompressing apparatus including both the compressing apparatus and the decompressing apparatus according to each of the above embodiments may be configured.
  • T6(Fq) is assumed as torus and the torus subgroup takes a trace expression for compressing the expression.
  • the subgroups can be compatibly configured by the above factorization.
  • the subgroup having the order (q+ ⁇ (3q)+1) is assumed as G+ and the subgroup having the order (q ⁇ (3q)+1) is assumed as G_. Since the mapping from the element in the subgroup of T6(Fq) into the element in the trace expression is not bijective, a plurality of elements for T6(Fq) are present for an inverse map of a certain element in the trace expression. Since six elements are present for T6(Fq) corresponding to one trace expression, at least three additional bits are required for identifying the six elements. Since the bit length required for the expression is log — 2(q)+3 bits including the three additional bits for both G+ and G_, G_ as a smaller group than q is not necessarily required but G_ is taken as a subgroup here.
  • the extension field Fq6 obtained by six-order decompressing the finite field Fq by the modulus polynomial ⁇ 7 is assumed and the compression/decompression map for the elements in the subgroup G_ of T6(Fq) is configured.
  • ⁇ 7 1 +x+x q 4 +x q 5 +x q 2 +x q +x q 3 (23)
  • Tr ( g ) g+g q +g q 2 +g q 3 +g q 4 +g q 5 (29)
  • 1 is a unit element of the multiplication of Fq6.
  • ⁇ ⁇ ( g ) - ( ⁇ 0 + 1 ) ⁇ 1 ⁇ F q 3 ( 30 )
  • the equation (29) corresponds to the trace map Tr in the equation (1).
  • the equations (30) and (31) correspond to the affine transform map Af and the affine transform inverse map Af ⁇ 1 ⁇ in the equation (2).
  • Tr(g) is expressed by the sum of elements in h ⁇ 1 .
  • h is expressed in the equation (35).
  • Tr(g) is obtained.
  • the denominator of Tr(g) is expressed in the equation (36). Since the numerator will be described later and is omitted here.
  • Tr ⁇ ( g ) ⁇ denominator ] ( ⁇ 1 6 + ⁇ 2 6 + ⁇ 3 6 ) + ( ⁇ 1 ⁇ ⁇ 2 5 + ⁇ 2 ⁇ ⁇ 3 5 + ⁇ 3 ⁇ ⁇ 1 5 ) + ( ⁇ 1 4 ⁇ ⁇ 2 2 + ⁇ 2 4 ⁇ ⁇ 3 2 + ⁇ 2 4 ⁇ ⁇ 1 2 ) + ( ⁇ 1 4 ⁇ ⁇ 2 ⁇ ⁇ 3 + ⁇ 1 ⁇ ⁇ 2 4 ⁇ ⁇ 3 + ⁇ 1 ⁇ ⁇ 2 ⁇ ⁇ 3 4 ) + ( ⁇ 1 2 ⁇ ⁇ 2 4 + ⁇ 2 2 ⁇ ⁇ 3 4 + ⁇ 3 2 ⁇ ⁇ 1 4 ) - ( ⁇ 1 3 ⁇ ⁇ 2 3 + ⁇ 2 3 ⁇ ⁇ 1 3 ) - ( ⁇ 1 3 ⁇ ⁇ 2 3 + ⁇ 2 3 ⁇ ⁇ 1 3 ) - ( ⁇ 1 3 ⁇ ⁇ 2 3 + ⁇
  • the conditional equation for ⁇ 1, ⁇ 2, and ⁇ 3 is arranged from the above equation. It is expressed in the equation (44).
  • the trace value of an element is the same as the trace value of the q-th power of the element. From the property, at least six affine expressions having the same trace value are present. The relationship between the affine expressions will be considered. In the case of f ⁇ Fq3, the relational equation is expressed in the equation (47).
  • Tr ⁇ ( g ) ⁇ denominator ] ( ⁇ + ⁇ + ⁇ ) 6 + ( ⁇ ⁇ ⁇ ⁇ 5 + ⁇ ⁇ ⁇ ⁇ 5 + ⁇ ⁇ ⁇ ⁇ 5 ) + ( ⁇ 4 ⁇ ⁇ 2 + ⁇ 4 ⁇ ⁇ 2 + ⁇ 4 ⁇ ⁇ 2 ) + ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ( ⁇ + ⁇ + ⁇ ) 3 + ( ⁇ 2 ⁇ ⁇ 4 + ⁇ 2 ⁇ ⁇ 4 + ⁇ 2 ⁇ ⁇ 4 ) - ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ( ⁇ 2 ⁇ ⁇ + ⁇ 2 ⁇ ⁇ + ⁇ 2 ⁇ ⁇ ) - ⁇ 2 ⁇ ⁇ 2 ⁇ ⁇ 2 - ( ⁇ 3 ⁇ ⁇ + ⁇ 3 ⁇ ⁇ ) - ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇
  • Equation (51) and (52) are transformed by the equation (53).
  • the two kinds of finally symmetrical equations ( ⁇ + ⁇ + ⁇ ) and ⁇ , and an asymmetrical equation ( ⁇ 2 + ⁇ 2 + ⁇ 2 ) are used as many times as possible.
  • the equation (59) is obtained from the equations (57) and (58).
  • Tr(g) is deformed to obtain the equations (63) and (64) from the equations (51) and (52).
  • Tr ⁇ ( g ) ⁇ denominator ] ⁇ ( ⁇ + ⁇ + ⁇ ) 6 + ( ⁇ ⁇ ⁇ ⁇ 5 + ⁇ ⁇ ⁇ ⁇ 5 + ⁇ ⁇ ⁇ ⁇ 5 ) + ⁇ ( ⁇ 4 ⁇ ⁇ 2 + ⁇ 4 ⁇ ⁇ 2 ) + ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ( ⁇ + ⁇ + ⁇ ) 3 + ⁇ ( ⁇ 2 ⁇ ⁇ 4 + ⁇ 2 ⁇ ⁇ 4 + ⁇ 2 ⁇ ⁇ 4 ) - ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ ( ⁇ 2 ⁇ ⁇ + ⁇ 2 ⁇ ⁇ + ⁇ 2 ⁇ ⁇ ) + ⁇ 2 ⁇ ⁇ 2 ⁇ ⁇ 2 ⁇ ) + ⁇ 2 ⁇ ⁇ 2 ⁇ ⁇ 2 ⁇ ) + ⁇ 2 ⁇ ⁇ 2 ⁇ ⁇ 2 ⁇ - ⁇ ( ⁇ 3 ⁇ +
  • the equation (68) is obtained from the equation (65).
  • Equation (75) is substituted into the equations (72), (73) and (74) for rearrangement to obtain the equations (76) to (78).
  • the subgroup having the order of (q+ ⁇ (2q)+1) is G+ and the subgroup having the order of (q ⁇ (2q)+1) is G_. Since the mapping from an element in the subgroup in the torus into an element in the trace is not bijective, there are multiple elements of the torus to be mapped from elements of a trace. Since four elements in a trace corresponding to the elements in one trace are present (see the trace expression for details), two additional bits are required for identifying the four elements. In the following, a relationship between the trace and the affine expression will be made clear and the method for decompressing the trace to the affine expression will be described. The following operations are over F(2 ⁇ n) ⁇ 4 unless otherwise noted.
  • the equation (92) collectively describes the relational equations of f used for deforming the equations in the following.
  • Tr(g) g+g q +g ⁇ q 2 +g ⁇ q 3 (corresponding to the equation (16)).
  • the equation (93) indicates the calculation process.
  • t ⁇ q (mod 5) ⁇ 2 (mod 5) is assumed.
  • the deformed equation expressed in the equation (95) is possible from the equation (94).
  • f q + 1 ⁇ ⁇ 1 2 + ⁇ 1 ⁇ ⁇ 2 + ⁇ 2 2 ⁇ ( described ⁇ ⁇ above )
  • Tr(g) for T4
  • Tr(g ⁇ q 2 ) g ⁇ q 2 +g ⁇ q 3 +g+g q
  • the trace of the element which is obtained by raising the element g of a torus to the q-th power has the same value of the original trace.
  • Equation (102) is substituted into the left side of the equation (103) to obtain the equation (104).
  • Tr ⁇ ( g ) ⁇ 1 2 + ⁇ 2 2 + ⁇ 1 + ⁇ 2 + 1 ⁇ 1 4 + ⁇ 1 2 ⁇ ⁇ 2 2 + ⁇ 2 4 + ⁇ 1 3 + ⁇ 2 3 + ⁇ 1 ⁇ ⁇ 2 + ⁇ 2 2 + ⁇ 2 + 1 ( 109 )
  • the four solutions are in the q-th power symmetric relationship.
  • the relationship of ( ⁇ 1 , ⁇ 2 ) ⁇ ( ⁇ 2 +1, ⁇ 1 ) ⁇ ( ⁇ 1 +1, ⁇ 2 +1) ⁇ ( ⁇ 2 +1, ⁇ 1 )( ⁇ ( ⁇ 1 , ⁇ 2 )) is obtained.
  • the arrow goes to the right each time the q-th power is raised and returns to the origin with the q 4 -th power.
  • Tr(g) is found from the equation (109).
  • b 0 is assumed as the least significant bit of ⁇ 1 and b 1 is assumed as the least significant bit of ⁇ 2 to output Tr(g), (b 0 , b 1 ).
  • the specific method for recovering the element of the T4 torus from the element of the trace by adding the additional bit has been described above.
  • the expression can be compressed only to 1 ⁇ 3 relative to the size of the finite field in the conventional torus, but the expression can be gradually compressed to 1 ⁇ 4 with the embodiments.
  • the compressing apparatus and the decompressing apparatus can be efficiently realized for the modulus polynomials which cannot efficiently configure the decompressed map in the conventional method.
  • FIG. 10 is an explanatory diagram illustrating a hardware structure of the decompressing apparatus and the compressing apparatus according to the first to fourth embodiments.
  • the decompressing apparatus and the compressing apparatus comprise a control device such as a CPU (Central Processing Unit) 51 , storage devices such as ROM (Read Only Memory) 52 and RAM (Random Access Memory) 53 , a communication I/F 54 connected to a network for making communication, and a bus 61 for interconnecting the respective units.
  • a control device such as a CPU (Central Processing Unit) 51
  • storage devices such as ROM (Read Only Memory) 52 and RAM (Random Access Memory) 53
  • ROM Read Only Memory
  • RAM Random Access Memory
  • the programs to be executed by the decompressing apparatus and the compressing apparatus according to the first to fourth embodiments are previously incorporated in the ROM 52 or the like to be provided.
  • the programs to be executed by the decompressing apparatus and the compressing apparatus according to the first to fourth embodiments may be recorded in a computer-readable recording medium such as CD-ROM (Compact Disk Read Only Memory), flexible disk (FD), CD-R (Compact Disk Recordable) or DVD (Digital Versatile Disk) in an installable form or executable form to be provided as a computer program product.
  • a computer-readable recording medium such as CD-ROM (Compact Disk Read Only Memory), flexible disk (FD), CD-R (Compact Disk Recordable) or DVD (Digital Versatile Disk) in an installable form or executable form to be provided as a computer program product.
  • the programs to be executed by the decompressing apparatus and the compressing apparatus according to the first to fourth embodiments may be stored on a computer connected to a network such as the Internet and may be downloaded via the network to be provided.
  • the programs to be executed by the decompressing apparatus and the compressing apparatus according to the first to fourth embodiments may be provided or distributed via the network such as Internet.
  • the programs to be executed by the decompressing apparatus and the compressing apparatus according to the first to fourth embodiments can cause a computer to function as each unit in the decompressing apparatus and the compressing apparatus.
  • the computer may read and execute a program from a computer-readable recording medium on a min storage device.

Abstract

According to one embodiment, a decompressing apparatus includes an input unit, a calculating unit, a first selecting unit, and a decompressing unit. The input unit inputs additional data, which is obtained based on trace expression data in which an element in a subgroup of a multiplicative group of a finite field is trace-expressed and affine expression data in which the trace expression data is affine-expressed, and the trace expression data. The calculating unit calculates a plurality of solutions of simultaneous equations derived by the trace expression data. The first selecting unit selects any of a plurality of items of affine expression data in which the element is affine-expressed based on the additional data, the affine expression data being found from the solutions. The decompressing unit decompresses the selected affine expression data to the element.

Description

CROSS-REFERENCE TO RELATED APPLICATIONS
This application is based upon and claims the benefit of priority from Japanese Patent Application No. 2010-275160, filed on Dec. 9, 2010; the entire contents of which are incorporated herein by reference.
FIELD
Embodiments described herein relate generally to a decompressing apparatus and a compressing apparatus for elements over a finite field.
BACKGROUND
Some of public key encryptions are configured by use of a subset of a finite field (a set of numbers; the four arithmetic operations are possible by only the elements in the set). Assuming that the number of elements in the subset is A and the number of elements in the finite field is B, A≦B is given. For example, A=2^160 and B=2^1024 are used for the public key encryptions. Generally, the number of bits required for expressing X elements is log2X bits. However, although only A elements in the subset are used for the existing public key encryptions, some encryption systems require log2B bits for expressing the elements.
Elements in a subset of a finite field, which is called algebraic torus, can be expressed with a small number of bits. There is known that when the order of an extension field to which the algebraic torus belongs is a product of powers of two prime numbers p and q, n=(p^m)×(q^w), at most, a compression rate (=the number of bits after compression/the number of bits before compression) is φ(n)/n. Herein, φ is Euler's function.
There is also known a method for realizing the compression rate of 1/4 and the compression rate of 1/6. According to the method, further compression is performed by obtaining data D1 in which the elements in an algebraic torus subset are compressed, and obtaining data D2, which is the partly deleted data D1, and an additional bit. Then, multivariable simultaneous equations obtained by a conditional equation of the algebraic torus subset and a relationship between the data D1 and the data D2 are solved so that candidates of the data D1 corresponding to the data D2 are obtained and the compressed data D1 is determined by using the additional bit.
BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is a block diagram of a compressing apparatus according to a first embodiment;
FIG. 2 is a flowchart of a compression processing according to the first embodiment;
FIG. 3 is a block diagram of a decompressing apparatus according to the first embodiment;
FIG. 4 is a flowchart of decompression processing according to the first embodiment;
FIG. 5 is a block diagram of a compressing apparatus according to a second embodiment;
FIG. 6 is a block diagram of a decompressing apparatus according to the second embodiment;
FIG. 7 is a block diagram of a compressing apparatus according to a third embodiment;
FIG. 8 is a block diagram of a decompressing apparatus according to the third embodiment;
FIG. 9 is a block diagram of a decompressing apparatus according to a fourth embodiment; and
FIG. 10 is a hardware structure diagram of the decompressing apparatus and the compressing apparatus according to each embodiment.
DETAILED DESCRIPTION
In general, according to one embodiment, a decompressing apparatus includes an input unit, a calculating unit, a first selecting unit, and a decompressing unit. The input unit inputs additional data, which is obtained based on trace expression data in which an element in a subgroup of a multiplicative group of a finite field is trace-expressed and affine expression data in which the trace expression data is affine-expressed, and the trace expression data. The calculating unit calculates a plurality of solutions of simultaneous equations derived by the trace expression data. The first selecting unit selects any of a plurality of items of affine expression data in which the element is affine-expressed based on the additional data, the affine expression data being found from the solutions. The decompressing unit decompresses the selected affine expression data to the element.
Exemplary embodiments of a decompressing apparatus will be described below in detail with reference to the accompanying drawings.
First Embodiment
Limitations different from those of the conventional technique are imposed on modulus polynomials so that a compressing apparatus and a decompressing apparatus according to a first embodiment are efficiently configured. In the present embodiment, an element of a finite field expression of algebraic torus is expressed by a trace expression and an additional bit to compress the expression, and the compressed expression is decompressed to the element of the finite field expression of the algebraic torus by the solutions of multivariable simultaneous equations determined by the trace expression and the additional bit. When the multivariable simultaneous equations are solved, a plurality of elements of the finite field expression of the algebraic torus, which are candidates to be decompressed, are obtained so that the additional bit is used to determine the element before the compression.
(1) Structure of Algebraic Torus
First, terms and notations used in the respective embodiments will be explained. Fpm indicates a finite field having p^m elements, and is called an m-th degree extension field of Fp. For example, F3m indicates an m-th degree extension field of a finite field F3 having three elements. In the case of a0, a1, . . . , an ε Fq, the polynomial F(x)=a0+a1×x+ . . . +an×x^n is called a polynomial over Fq. The polynomial over Fq may be expressed as F(x)=a0+a1×x+ . . . +an×x^n over Fq. Herein, “a^b” indicates the b-th power of a. In the following, the b-th power of a may be expressed as ab.
Assuming that n is an odd number of n≡5 (mod 12) and q=3^n is given, a finite field Fq will be considered. At this time, q≡5 (mod 7) is obtained. By using Φ7=x^6+x^5+x^4+x^3+x^2+x+1 as a modulus polynomial, a sixth degree extension field of the finite field Fq is considered. The modulus polynomial is not limited to the above-described one, and may be another polynomial such as Φ9=x^6+x^3+a1.
In this case, x^q=x^5, x^{q^2}=x^4, x^{q^3}=x^6, x^{q^4}=x^2, x^{q^5}=x^3 are established over Fq6. The algebraic torus T6 (Fq) over the sixth degree extension field Fq6 has a subgroup having the order of q−√(3q)+1. Since q is an odd-number-th power of 3, √(3q) is an integer. Here, it is assumed √(3q)=t.
The trace map Tr:Fq6→Fq is defined in the equation (1). Tr(g) is called a trace expression of g.
Tr(g)=g+g^q+g^{q^2}+g^{q^3}+g^{q^4}+g^{q^5}  (1)
An affine transform map Af:Fq6→Fq3 and an affine transform inverse map Af^{−1}:Fq3→Fq6 are defined in the equation (2).
Af(g)=(G1+1)/G2,
Af^{−1}(Af(g))=(Af(g)+z)/(Af(g)+z^q)  (2)
where z:=x+x^{q^2}+x^ {q^4}=x+x^2+x^4 and g:=a0+a1×x+a2×x^2+a3×x^3+a4×x^4+a5×x^5=(a0+a3×x^3+a5×x^5)+(a1×x+a2×x^2+a4×x^4)=G1+G2×z (where, G1, G2εFq3). Af(g) is called an affine expression of g.
(2) Structure of Compressing Apparatus
An exemplary structure of the compressing apparatus and the decompressing apparatus according to the first embodiment will be described. FIG. 1 is a block diagram illustrating an exemplary structure of a compressing apparatus 100 according to the first embodiment. As illustrated in FIG. 1, the compressing apparatus 100 comprises an input unit 101, a first transforming unit 102, a second transforming unit 103, an additional bit deciding unit 104, an output unit 105 and a storing unit 121.
The input unit 101 is directed for inputting an element in an algebraic torus subset to be compressed. The first transforming unit 102 transforms the input element into trace expression data expressed in a trace expression. In the following, the trace expression data will be simply called trace expression. The first transforming unit 102 transforms the input element into the trace expression by the trace map Tr.
The second transforming unit 103 transforms the input element into affine expression data expressed in an affine expression. In the following, the affine expression data will be simply called affine expression. The second transforming unit 103 transforms the input element into the affine expression by the affine transform map Af.
The additional bit deciding unit 104 decides an additional bit based on the trace expression data in which the element in the subgroup of the multiplicative group of the finite field (the algebraic torus of the finite field expression) is trace-expressed and the affine expression data in which the element in the subgroup of the multiplicative group of the finite field is affine-expressed. The additional bit deciding unit 104 decides additional data (hereinafter referred to as additional bit below) for finding the affine expression from the solutions of predetermined simultaneous equations based on the trace expression and the affine expression. In other words, the additional bit is decided based on the candidates of the affine expression obtained by decompressing the trace expression data in which the element in the subgroup of the multiplicative group of the finite field (the algebraic torus of the finite field expression) is trace-expressed and the affine expression data in which the element in the subgroup of the multiplicative group of the finite field (the algebraic torus of the finite field expression) is affine-expressed.
The output unit 105 outputs the trace expression and the additional bit. The storing unit 121 stores information used for finding previously-derived equations to be used for deciding the additional bit.
Subsequently, compression processing by the compressing apparatus 100 with the above structure according to the first embodiment will be described with reference to FIG. 2. FIG. 2 is a flowchart illustrating a flow of the entire compression processing according to the first embodiment.
The input unit 101 inputs an element g in an algebraic torus subgroup (step S101). The first transforming unit 102 inputs g into the trace map to calculate the trace expression Tr(g) (step S102). The second transforming unit 103 inputs g into the affine map to calculate the affine expression of (α+1, β+1, γ+1)εFq3 (step S103). The additional bit deciding unit 104 decides multivariable simultaneous equations derived by the conditions for the trace expression and the algebraic torus and the condition for the finite field (step S104). The additional bit deciding unit 104 solves the multivariable simultaneous equations to decide the additional bit (step S105). Specifically, the additional bit deciding unit 104 solves the multivariable simultaneous equations to obtain six solutions {(ai, bi, ci)}_{i=1, . . . , 6}, arranges the six solutions in descending order to decide the i-th element coincident with the affine expression of g, and consequently decides i as the additional bit. The output unit 105 outputs the trace expression and the additional bit (Tr(g), i) (step S106). Any method that can discriminate the six solutions may be used for deciding the additional bit not only by arranging and deciding the six solutions in descending order but also by arranging and deciding them in ascending order.
In the present embodiment, the compression at the compression rate of 1/6 can be realized by the trace map Tr:Fq6→Fq. i can be expressed by three bits due to 1≦i≦6. In other words, the additional bit i rarely affects the compression rate of 1/6.
The method for deriving the multivariable simultaneous equations (step S104) and the method for solving the multivariable simultaneous equations (step S105) can be achieved with the same structure as a decompressing apparatus 200. The respective processing will be described in detail along with the structure of the decompressing apparatus 200.
(3) Structure of Decompressing Apparatus
FIG. 3 is a block diagram illustrating an exemplary structure of the decompressing apparatus 200 according to the first embodiment. As illustrated in FIG. 3, the decompressing apparatus 200 comprises an input unit 201, a calculating unit 210, a first selecting unit 202, a decompressing unit 203, an output unit 204 and a storing unit 221.
The input unit 201 inputs the trace expression and the additional bit output from the compressing apparatus 100. The calculating unit 210 derives the multivariable simultaneous equations from the input trace expression and calculates the solutions of the multivariable simultaneous equations. The calculating unit 210 comprises a first equation deriving unit 211, a first solution finding unit 212, a second equation deriving unit 213, a second solution finding unit 214, a third equation deriving unit 215 and a third solution finding unit 216.
The first equation deriving unit 211 derives the first equation obtained by inputting the input trace expression data into a preset coefficient in a previously-found k1-th (k1 is a preset integer of 1 or more) degree equation over the finite field Fq. An example in which the first equation as a quadric equation (k1=2) is derived will be described below. The first solution finding unit 212 finds the solutions of the first equation.
The second equation deriving unit 213 derives the second equation obtained by inputting at least one of the solutions found by the first solution finding unit 212 into a preset coefficient in a previously-found k2-th (k2 is a preset integer of 1 or more) degree equation over the finite field Fq. An example in which the second equation as a cubic equation (k2=3) is derived will be described below. The second solution finding unit 214 finds the solutions of the second equation.
The third equation deriving unit 215 derives the third equation obtained by inputting at least one of the solutions found by the first solution finding unit 212 and the solutions found by the second solution finding unit 214 into a preset coefficient in a previously-found k3-th (k3 is a preset integer of 1 or more) degree equation over the finite field Fq. An example in which the third equation as a linear equation (k3=1) is derived will be described below. The third solution finding unit 216 finds the solutions of the third equation.
The first selecting unit 202 finds a plurality of affine expressions from the plurality of solutions calculated by the calculating unit 210 and selects any affine expression corresponding to the additional data from among the found affine expressions. The decompressing unit 203 decompresses the selected affine expression to the element in the algebraic torus subgroup before the compression. The decompressing unit 203 transforms the affine expression into the pre-compression element by the affine transform inverse map Af^{−1}. The output unit 204 outputs the decompressed element in the algebraic torus subgroup.
The storing unit 221 stores information for finding previously-derived equations used for deciding the additional bit as the storing unit 121 in the compressing apparatus 100 does. The storing unit 121 and the storing unit 221 may be configured of any generally-used storage medium such as HDD (Hard Disk Drive), optical disk, memory card or RAM (Random Access Memory).
Decompression processing by the decompressing apparatus 200 with the above structure according to the first embodiment will be described with reference to FIG. 4. FIG. 4 is a flowchart illustrating a flow of the entire decompression processing in the first embodiment.
The input unit 201 inputs the trace expression TεFq and the additional bit jεF2^3 (step S201). The calculating unit 210 derives the multivariable simultaneous equations from the input trace expression and calculates the solutions of the multivariable simultaneous equations (step S202). The calculation processing by the calculating unit 210 will be detailed below.
The first selecting unit 202 selects (decides) the affine expression based on the calculated solutions and the input additional bit (step S203). The decompressing unit 203 decompresses the affine expression to the element g in the algebraic torus subgroup (step S204). The output unit 204 outputs the element g in the algebraic torus subgroup which is obtained by the decompression (step S205).
The calculation processing by the calculating unit 210 in step S202 will be detailed below.
First, the first equation deriving unit 211 derives the quadric equation A(x) expressed in the equation (3) (step S202).
A(x):x^2+(T^{t−2}+1)^{−1}=0over Fq  (3)
The first equation deriving unit 211 reads the information for finding the above A(x) from the storing unit 221, for example. The information contains relationships between coefficients and variables and information for specifying a preset coefficient for inputting the trace expression. The first equation deriving unit 211 inputs the trace expression input into the preset coefficient to decide A(x) with reference to the information. The first equation deriving unit 211 sends the decided A(x) to the first solution finding unit 212.
Assuming that a desired affine expression is (α+1, β+1, γ+1), the quadric equation A(x) has the root of α+β+γ. A procedure of deriving the quadric equation A(x) will be described later.
When A(x) is input, the first solution finding unit 212 uses the Berlekamp algorithm or the like to factorize A(x) over Fq, and consequently finds the solutions a1 and a2 for A(x)=0. The first solution finding unit 212 sends the found solutions a1 and a2 to the second equation deriving unit 213 and the third equation deriving unit 215.
When the solutions a1 and a2 are input, the second equation deriving unit 213 derives the cubic equations B(x) and C(x) expressed by the equations (4) and (5).
B(x):x^3−a1×x^2−(a1^2−1)x−Z(a1)=0 over Fq  (4)
C(x):x^3−a2×x^2−(a2^2−1)x−Z(a2)=0 over Fq  (5)
where Z(x)=x^3−Y(x)+(x×Y(x)−Y(x)^2−1)/x^3 over Fq and Y(x)=(−1−x^2)/x^t−x over Fq.
The second equation deriving unit 213 sends B(x) and C(x) to the second solution finding unit 214.
Assuming that a desired affine expression is (α+1, β+1, γ+1), one of the cubic equations has the root of β. Procedures of deriving the cubic equations B(x) and C(x) will be described later.
When B(x) and C(x) are input, the second solution finding unit 214 uses the Berlekamp algorithm or the like to factorize B(x) and C(x) over Fq, and consequently finds the solutions b1, b2, b3 for B(x)=0 and the solutions c1, c2, c3 for C(x)=0. The second solution finding unit 214 sends the solutions (b1, b2, b3) and (c1, c2, c3) to the third equation deriving unit 215.
When (a1, a2), (b1, b2, b3) and (c1, c2, c3) are input, the third equation deriving unit 215 derives the linear equations D(x), E(x), F(x), G(x), H(x) and I(x) expressed in the equations (6) to (11).
D(x):(−b1^{2}+(a1+(1/a1))×b1)×x+Z(a1)+(−a1+(1/a1))×b1^2−(Y(a1)/a1)×b1=0 over Fq  (6)
E(x):(−b2^{2}+(a1+(1/a1))×b2)×x+Z(a1)+(−a1+(1/a1))×b2^2−(Y(a1)/a1)×b2=0 over Fq  (7)
F(x):(−b3^{2}+(a1+(1/a1))×b3)×x+Z(a1)+(−a1+(1/a1))×b3^2−(Y(a1)/a1)×b3=0 over Fq  (8)
G(x):(−c1^{2}+(a2+(1/a2))×c1)×x+Z(a2)+(−a2+(1/a2))×c1^2−(Y(a2)/a2)×c1=0 over Fq  (9)
H(x):(−c2^{2}+(a2+(1/a2))×c2)×x+Z(a2)+(−a2+(1/a2))×c2^2−(Y(a2)/a2)×c2=0 over Fq  (10)
I(x):(−c3^{2}+(a2+(1/a2))×c3)×x+Z(a2)+(−a2+(1/a2))×c3^2−(Y(a2)/a2)×c3=0 over Fq  (11)
The third equation deriving unit 215 sends D(x), E(x), F(x), G(x), H(x) and I(x) to the third solution finding unit 216.
Assuming that a desired affine expression is (α+1, β+1, γ+1), one of the linear equations has the root of γ. Procedures of deriving the linear equations D(x), E(x), F(x), G(x), H(x) and I(x) will be described later.
When D(x)=0, E(x)=0, F(x)=0, G(x)=0, H(x)=0 and I(x)=0 are input, the third solution finding unit 216 finds the solutions d, e, f, g, h and i. The third solution finding unit 216 sends six combinations of solutions (a1−b1−d, b1, d), (a1−b2−e, b2, e), (a1−b3−f, b3, f), (a2−c1−g, c1, g), (a2−c2−h, c2, h) and (a2−c3−i, c3, i) from the above solutions and the solutions b1, b2, b3, c1, c2, c3 of the cubic equations B(x) and C(x) to the first selecting unit 202.
When the six combinations of solutions and the additional bit j (1≦j≦6) are received, the first selecting unit 202 calculates (a1−b1−d+1, b1+1, d+1), (a1−b2−e+1, b2+1, e+1), (a1−b3−f+1, b3+1, f+1), (a2−c1−g+1, c1+1, g+1), (a2−c2−h+1, c2+1, h+1) and (a2−c3−i+1, c3+1, i+1), each element in the six combinations of solutions being added with 1. The first selecting unit 202 arranges the calculated six solutions according to a predetermined rule. The solutions are arranged in descending order in the following, but the rule is not limited to that.
The first selecting unit 202 selects the j-th largest value from among the six arranged solutions. The value corresponds to the desired affine expression. The first selecting unit 202 sends the selected value (affine expression) to the decompressing unit 203.
The decompressing unit 203 transforms the received affine expression into the finite field expression of the algebraic torus subgroup by the affine transform inverse map Af^{−1}, and outputs the finite field expression.
In this way, the compressing apparatus and the decompressing apparatus according to the first embodiment can be efficiently realized for the modulus polynomials which cannot efficiently configure a decompressed map in the conventional method. In the compressing apparatus and the decompressing apparatus according to the present embodiment, Tr(g′) can be calculated not by decompressing the trace expression Tr(g) but by operating the additional bit by use of the property that the trace expressions Tr(g) and Tr(g′) are identical for a certain element g over the algebraic torus subgroup and an element g′ obtained by calculating a Frobenius map.
Second Embodiment
A decompressing apparatus according to a second embodiment uses part of additional bits to narrow equations to be solved. Thus, compression and decompression can be more efficiently performed. The structure of algebraic torus is the same as that of the first embodiment and thus an explanation thereof will be omitted.
(1) Structure of Compressing Apparatus
FIG. 5 is a block diagram illustrating an exemplary structure of a compressing apparatus 100-2 according to the second embodiment. As illustrated in FIG. 5, the compressing apparatus 100-2 comprises the input unit 101, the first transforming unit 102, the second transforming unit 103, an additional bit deciding unit 104-2, the output unit 105 and the storing unit 121.
The second embodiment is different from the first embodiment in the function of the additional bit deciding unit 104-2. Other structures and functions are the same as those of the compressing apparatus 100 according to the first embodiment illustrated in the block diagram of FIG. 1, and thus are denoted by the same reference numerals as those in FIG. 1 and an explanation thereof will be omitted.
Additional bit decision processing by the additional bit deciding unit 104-2 according to the second embodiment will be described below.
When the first transforming unit 102 and the second transforming unit 103 calculate the trace expression Tr(g) and the affine expression (α+1, β+1, γ+1) (step S102, step S103 in FIG. 2), the additional bit deciding unit 104-2 solves a quadric equation derived based on the conditions for the trace expression and the algebraic torus and the condition for the finite field, thereby finding the solutions a1 and a2. The additional bit deciding unit 104-2 rearranges the found solutions a1 and a2 in descending order, and decides i1 (i1=1 or 2) coincident with the sum of elements in the affine expression of g, α+β+γ+3 over Fq as the additional bit 1.
Then, the additional bit deciding unit 104-2 derives the cubic equation based on the trace expression, the sums of elements in the affine expression, the condition for the torus, and the condition for the finite field. The additional bit deciding unit 104-2 derives the linear equation based on the solutions of the cubic equation and finds three candidates for the affine expression. The additional bit deciding unit 104-2 arranges the found candidates in descending order, compares them with the affine expression of g, and when the candidate coincides with i2-th (1≦i2≦3) element, decides i2 as the additional bit 2. The output unit 105 outputs the additional bits i1 and i2 together with the trace expression.
The methods for deriving the quadric equation, the cubic equation and the linear equation and finding their solutions can be realized in the same structure as that of a decompressing apparatus 200-2 described below.
(2) Structure of Decompressing Apparatus
FIG. 6 is a block diagram illustrating an exemplary structure of the decompressing apparatus 200-2 according to the second embodiment. As illustrated in FIG. 6, the decompressing apparatus 200-2 comprises the input unit 201, a calculating unit 210-2, a first selecting unit 202-2, the decompressing unit 203, the output unit 204 and the storing unit 221.
The second embodiment is different from the first embodiment in the functions of the calculating unit 210-2 and the first selecting unit 202-2. The other structures and functions are the same as those of the decompressing apparatus 200 according to the first embodiment illustrated in the block diagram of FIG. 3, and thus are denoted by the same reference numerals and an explanation thereof will be omitted.
The calculating unit 210-2 further comprises a second selecting unit 217. The functions of the first equation deriving unit 211 and the first solution finding unit 212 are the same as those in the first embodiment, and thus are denoted by the same reference numerals and an explanation thereof will be omitted.
The second selecting unit 217 uses the additional bit 1 (i1) among the input additional bits to select the i1-th solution when the solutions obtained by the first solution finding unit 212 are arranged in descending order.
The second equation deriving unit 213-2 uses the solution selected by the second selecting unit 217 to derive the second equation. The second solution finding unit 214-2 finds the solutions of the second equation. The third equation deriving unit 215-2 derives the third equation obtained by inputting at least one of the solution selected by the second selecting unit 217 and the solutions found by the second solution finding unit 214-2. The third solution finding unit 216-2 finds the solutions of the third equation.
The first selecting unit 202-2 is different from the first selecting unit 202 according to the first embodiment in that the additional data i2 among the items of additional data is used to select a solution.
Calculation processing by the calculating unit 210-2 according to the second embodiment will be described below in detail.
When the trace expression TεFq and the additional bit (i1, i2)εF2×F2^2 are input, the input unit 201 sends the trace expression T to the first equation deriving unit 211. The first equation deriving unit 211 derives the quadric equation A(x) by the above processing, and sends it to the first solution finding unit 212. The first solution finding unit 212 factorizes A(x) over Fq to find the solutions a1 and a2 for A(x)=0, and sends the solutions a1 and a2 to the second selecting unit 217.
When the solutions a1, a2 and the additional bit 1(i1) are input, the second selecting unit 217 arranges the solutions a1 and a2 in descending order, selects the i1-th element as a and sends it to the second equation deriving unit 213-2 and the third equation deriving unit 215-2.
When the solution a is input, the second equation deriving unit 213-2 derives the cubic equation B(x) expressed in the equation (12). Z(x) and Y(x) are as noted above.
B(x):x^3−a×x^2−(a^2−1)x−Z(a)=0 over Fq  (12)
The second equation deriving unit 213-2 sends B(x) to the second solution finding unit 214-2. When B(x) is input, the second solution finding unit 214-2 uses the Berlekamp algorithm or the like to factorize B(x) over Fq, and consequently finds the solutions b1, b2 and b3 for B(x)=0. The second solution finding unit 214-2 sends the solution (b1, b2, b3) to the third equation deriving unit 215-2.
When (a) and (b1, b2, b3) are input, the third equation deriving unit 215-2 derives the linear equations D(x), E(x) and F(x) expressed in the equations (13) to (15).
D(x):(−b1^{2}+(a+(1/a))×b1)×x+Z(a)+(−a+(1/a))×b1^2−(Y(a)/ab1=0 over Fq  (13)
E(x):(−b2^{2}+(a+(1/a))×b2)×x+Z(a)+(−a+(1/a))×b2^2−(Y(a)/ab2=0 over Fq  (14)
F(x):(−b3^{2}+(a+(1/a))×b3)×x+Z(a)+(−a+(1/a))×b3^2−(Y(a)/ab3=0 over Fq  (15)
The third equation deriving unit 215-2 sends the linear equations D(x), E(x) and F(x) to the third solution finding unit 216-2.
When D(x)=0, E(x)=0 and F(x)=0 are input, the third solution finding unit 216-2 finds their solutions d, e and f. The third solution finding unit 216-2 sends three combinations of solutions (a−b1−d, b1, d), (a−b2−e, b2, e) and (a−b3−f, b3, f) to the first selecting unit 202-2.
When the three solutions and the additional bit i2 (1≦i2≦3) are received, the first selecting unit 202-2 calculates (a−b1−d+1, b1+1, d+1), (a−b2−e+1, b2+1, e+1) and (a−b3−f+1, b3+1, f+1), each element in the three combinations of solutions being added with 1. The first selecting unit 202-2 arranges the three calculated solutions in descending order. The first selecting unit 202-2 selects the i2-th largest solution among the three arranged solutions. The value corresponds to the desired affine expression. The first selecting unit 202-2 sends the selected value (affine expression) to the decompressing unit 203. The decompressing unit 203 transforms the received affine expression into the finite field expression of the algebraic torus subgroup and outputs the resulting finite field expression.
In this way, the compressing apparatus and the decompressing apparatus according to the second embodiment can separately calculate the additional bits i1 and i2 and can use the additional bit i1 to early narrow the equations to be solved. Thereby, the compression and the decompression can be more efficiently performed.
Third Embodiment
In a third embodiment, an example in which the same method as that of the first embodiment is applied to the compression at the compression rate of 1/4 will be described.
(1) Structure of Algebraic Torus
Consider a finite field Fq with q≡2 (mod 5), q=2^n and p|(√(2q)). And consider a fourth degree extension field Fq4 of the finite field Fq by use of the modulus polynomial Φ5=x^4+x^3+x^2+x+1. In this case, x^q=x^2, x^{q^2}=x^4, x^{q^3}=x^3, and x^{q^4}=x are established over Fq4.
At this time, the algebraic torus T4(Fq) over the fourth degree extension field Fq4 has a subgroup with the order of q−√(2q)+1. Herein, n is an odd number from q≡2 (mod 5) and thus √(2q) is an integer. Here, it is assumed √(2q)=t. The trace map Tr:Fq4→Fq is defined in the equation (16).
Tr(g)=g+g^q+g^{q^2}+g^{q^3}  (16)
The affine transform map Af:Fq4→Fq2 and the affine transform inverse map Af^{−1}:Fq2→Fq4 are defined in the equation (17).
Af(g)=(G+1)/G2εFq2,
Af^{−1}(Af(g))=(Af(g)+z)/(Af(g)+z^qFq4  (17)
where z:=x+x^q=x+x^2 and g:=a0+a1×x+a2×x^2+a3×x^3=(a0+a3×x^3)+(a1×x+a2×x^2)=G1+G2×z (where, G1, G2εFq).
(2) Structure of Compressing Apparatus
FIG. 7 is a block diagram illustrating an exemplary structure of a compressing apparatus 100-3 according to a third embodiment. As illustrated in FIG. 7, the compressing apparatus 100-3 comprises the input unit 101, a first transforming unit 102-3, a second transforming unit 103-3, an additional bit deciding unit 104-3, the output unit 105 and the storing unit 121. The constituents having the same functions as those of the first embodiment are denoted by the same reference numerals as those in FIG. 1 and an explanation thereof will be omitted.
The first transforming unit 102-3 transforms the element g input from the trace map Tr in the equation (16) into the trace expression Tr(g). The second transforming unit 103-3 transforms the element g input from the affine transform map Af in the equation (17) into the affine expression (α, β)εFq×Fq. The additional bit deciding unit 104-2 decides the least significant bit of α as the additional bit 1 and the least significant bit of β as the additional bit 2.
(3) Structure of Decompressing Apparatus
FIG. 8 is a block diagram illustrating an exemplary structure of a decompressing apparatus 200-3 according to the third embodiment. As illustrated in FIG. 8, the decompressing apparatus 200-3 comprises the input unit 201, a calculating unit 210-3, a first selecting unit 202-3, a decompressing unit 203-3, the output unit 204 and the storing unit 221. The constituents having the same functions as those of the first embodiment are denoted by the same reference numerals as those in FIG. 3 and an explanation thereof will be omitted.
The calculating unit 210-3 comprises a first equation deriving unit 211-3, a first solution finding unit 212-3, a second equation deriving unit 213-3 and a second solution finding unit 214-3.
The first equation deriving unit 211-3 derives the first equation as a different quadric equation from the first embodiment. The first solution finding unit 212-3 finds the solutions of the first equation. The second equation deriving unit 213-3 derives the second equation as a quadric equation, unlike the first embodiment. The second solution finding unit 214-3 finds the solutions of the second equation. The first selecting unit 202-3 selects any solution corresponding to the additional data from among the solutions calculated by the calculating unit 210-3.
Now, the calculation processing by the calculating unit 210-3 according to the third embodiment will be described in detail.
When the trace expression TεFq and the additional bits (i1, i2)εF2×F2 are input, the first equation deriving unit 211-3 derives the quadric equation A(x) expressed in the equation (18) and sends it to the first solution finding unit 212-3.
A(x):x^2+x+1−T^{q−t}=0 over Fq  (18)
When A(x) is input, the first solution finding unit 212-3 uses the Berlekamp algorithm or the like to factorize A(x) over Fq and to find the solutions a1 and a2 for A(x)=0, and sends the solutions a1 and a2 to the second equation deriving unit 213-3. The first solution finding unit 212-3 may transform the term of x^2 into a linear term by using a Frobenius map, thereby solving the transformed linear equation.
When the solutions a1 and a2 are input, the second equation deriving unit 213-3 derives the quadric equations B(x) and C(x) expressed in the equations (19) and (20) and sends them to the second solution finding unit 214-3.
B(x):x^2+x+a1^2+a1^t×T^{q−t}=0 over Fq  (19)
C(x):x^2+x+a2^2+a2^t×T^{q−t}=0 over Fq  (20)
When B(x) and C(x) are input, the second solution finding unit 214-3 uses the Berlekamp algorithm or the like to factorize B(x) and C(x) over Fq, thereby finding the solutions b1 and b2 for B(x)=0 and the solutions c1 and c2 for C(x)=0. The second solution finding unit 214-3 sends the solutions b1, b2, c1 and c2 to the first selecting unit 202-3.
When the solutions b1, b2, c1, c2, the additional bit 1 and the additional bit 2 are received, the first selecting unit 202-3 finds four combinations of solutions (a1−b1, b1), (a1−b2, b2), (a2−c1, c1) and (a2−c2, c2). The first selecting unit 202-3 compares the least significant bit of the first component in each combination (a1−b1, a1−b2, a2−c1, a2−c2) with the additional bit 1, compares the least significant bit of the second component in each combination (b1, b2, c1, c2) with the additional bit 2, and selects the coincident pair. The value of the pair corresponds to the desired affine expression. The first selecting unit 202-3 sends the selected value (affine expression) to the decompressing unit 203-3. The decompressing unit 203-3 transforms the received affine expression into the finite filed expression of the algebraic torus subgroup and outputs it.
In this way, the third embodiment can realize the compression at the compression rate of 1/4 and the decompression similar to the first embodiment.
Fourth Embodiment
In a fourth embodiment, an example in which the same method as that of the second embodiment is applied to the compression at the compression rate of 1/4 will be described. The structure of the algebraic torus is the same as that of the third embodiment and thus an explanation thereof will be omitted. A compressing apparatus according to the fourth embodiment is the same as the compressing apparatus 100-3 according to the third embodiment.
(1) Structure of Decompressing Apparatus
FIG. 9 is a block diagram illustrating an exemplary structure of a decompressing apparatus 200-4 according to the fourth embodiment. As illustrated in FIG. 9, the decompressing apparatus 200-4 comprises the input unit 201, a calculating unit 210-4, a first selecting unit 202-4, a decompressing unit 203-3, the output unit 204 and the storing unit 221. The constituents having the same functions as those of the third embodiment are denoted by the same reference numerals as those in FIG. 8 and an explanation thereof will be omitted. The calculating unit 210-4 comprises a first equation deriving unit 211-3, the first solution finding unit 212-3, a second selecting unit 217-4, a second equation deriving unit 213-4 and a second solution finding unit 214-4.
The second selecting unit 217-4 uses the additional bit 1(i1) and the additional bit 2(i2) among the input additional bits to compare the least significant bit of the solutions obtained by the first solution finding unit 212-3 with the sum of the additional bit 1(i1) and the additional bit 2(i2) over F2, thereby selecting the coincident solution. The second equation deriving unit 213-4 uses the solution selected by the second selecting unit 217-4 to decide the second equation. The second solution finding unit 214-4 finds the solutions of the second equation.
The calculation processing by the calculating unit 210-4 according to the fourth embodiment will be described below in detail.
When the trace expression TεFq and the additional bits (i1, i2)εF2×F2 are input, the first equation deriving unit 211-3 derives the quadric equation A(x) expressed in the equation (18) and sends it to the first solution finding unit 212-3.
When A(x) is input, the first solution finding unit 212-3 uses the Berlekamp algorithm or the like to factorize A(x) over Fq, thereby finding the solutions a1 and a2 for A(x)=0. The first solution finding unit 212-3 sends the solutions a1 and a2 to the second selecting unit 217-4. A Frobenius map may be used to transform the term of x^2 into a linear term to solve the transformed linear equation.
When the solutions a1, a2, the additional bit 1(i1) and the additional bit 2(i2) are input, the second selecting unit 217-4 compares the sum of the additional bit 1(i1) and the additional bit 2(i2) over F2 with the least significant bit of the solutions a1, a2, and selects the coincident solution as the solution a. The second selecting unit 217-4 sends the selected solution a to the second equation deriving unit 213-4.
When the solution a is input, the second equation deriving unit 213-4 derives the quadric equation B(x) expressed in the equation (21) and sends it to the second solution finding unit 214-4.
B(x):x^2+x+a^2+a^t×T^{q−t}=0 over Fq  (21)
When B(x) is input, the second solution finding unit 214-4 uses the Berlekamp algorithm or the like to factorize B(x) over Fq, thereby finding the solutions b1 and b2 for B(x)=0. The second solution finding unit 214-4 sends the solutions b1 and b2 to the first selecting unit 202-4.
When the solutions b1, b2 and the additional bit 2(i2) are received, the first selecting unit 202-4 compares the additional bit 2(i2) with the least significant bit of the solutions b1, b2, and selects the coincident solution as the solution b. The first selecting unit 202-4 sends (a−b, b)εFq×Fq obtained from the solutions a and b to the decompressing unit 203-3. (a−b, b) corresponds to the desired affine expression.
The first selecting unit 202-4 may be configured to find two combinations of solutions (a−b1, b1) and (a−b2, b2) and to select a combination of solutions whose second component coincides with the additional bit 2(i2) (=the desired affine expression).
The decompressing unit 203-3 transforms the received affine expression into the finite field expression of the algebraic torus subgroup and outputs it.
In this way, the fourth embodiment can realize the compression at the compression rate of 1/4 and the decompression similar to the second embodiment.
The compressing apparatus and the decompressing apparatus according to each of the above embodiments can be provided inside an apparatus for encoding and decoding a public key encryption, for example. For example, the compressing apparatus may be provided in an information processing apparatus (encoding apparatus) for transmitting the data encoded by the public key encryption and the decompressing apparatus may be provided in an information processing apparatus (decoding apparatus) for receiving and decoding the encoded data. A compressing/decompressing apparatus including both the compressing apparatus and the decompressing apparatus according to each of the above embodiments may be configured.
A procedure of deriving the linear to cubic equations used in each of the above embodiments will be described. At first, the procedure of deriving the equations used at the compression rate of 1/6 (in the first and second embodiments) will be described.
(1) 1/6 Compression
T6(Fq) is assumed as torus and the torus subgroup takes a trace expression for compressing the expression. The order of T6(Fq) is the cyclotomic polynomial Φ6=q2−2+1. The cyclotomic polynomial Φ6 can be factorized into Φ6=q2−q+1=(q+√(3q)+1) (q−√(3q)+1), therefore, if (q+√(3q)+1) and (q−√)3q)+1) are each an integer, T6(Fq) can be divided into the subgroup having the order (q+√(3q)+1) and the subgroup having the order (q−√(3q)+1). In other words, when q is raised to the odd-number-th power of 3, the subgroups can be compatibly configured by the above factorization.
The subgroup having the order (q+√(3q)+1) is assumed as G+ and the subgroup having the order (q−√(3q)+1) is assumed as G_. Since the mapping from the element in the subgroup of T6(Fq) into the element in the trace expression is not bijective, a plurality of elements for T6(Fq) are present for an inverse map of a certain element in the trace expression. Since six elements are present for T6(Fq) corresponding to one trace expression, at least three additional bits are required for identifying the six elements. Since the bit length required for the expression is log2(q)+3 bits including the three additional bits for both G+ and G_, G_ as a smaller group than q is not necessarily required but G_ is taken as a subgroup here.
Hereinafter, a relationship between the trace expression and the affine expression will be made clear and a method for enabling the decompression from the trace expression to the affine expression will be described. The following operations are all over F(3^n)^6 unless otherwise noted.
(2) Preparation
(2.1) Condition for Extension Field
The extension field Fq6 obtained by six-order decompressing the finite field Fq by the modulus polynomial Φ7 is assumed and the compression/decompression map for the elements in the subgroup G_ of T6(Fq) is configured. The conditions for the algebraic torus, the modulus polynomial Φ7 and q are expressed in the equation (22).
Φ7=1+x+x 2 +x 3 +x 4 +x 5 +x 6 ,x 7=1,
q=5 mod 7,
q=3n,(nεZ),
(n=5 mod 12)  (22)
In this case, the modulus polynomial Φ7 is expressed in the equation (23) due to q=5 mod 7.
Φ7=1+x+x q 4 +x q 5 +x q 2 +x q +x q 3   (23)
The basic fields Fq2 and Fq3 are assumed for Fq6 formed of the modulus polynomial Φ7 and the base y of Fq2 and the base z of Fq3 are decided as in the equation (24).
y=x+x q 3 ,
z=x+x q 2 +x q 4   (24)
The equations (25) and (26) are obtained as relations for y and z from the conditions for the modulus polynomial Φ7 and q.
y + y q + y q 2 + 1 = 0 , y 2 = ( x + x q 3 ) 2 = ( x + x 6 ) 2 = ( x 2 + x 5 + 2 ) = x q + x q 4 + 2 = y q + 2 , ( 25 ) y q + 1 = ( x + x q 3 ) ( x q + x q 4 ) = ( x + x 6 ) ( x 5 + x 2 ) = ( x 6 + x 3 + x 4 + x ) = y + y q 2 z + z q + 1 = 0 , z 2 = ( x + x q 2 + x q 4 ) 2 = ( x + x 4 + x 2 ) 2 = ( x 2 + x + x 4 + 2 x 5 + 2 x 3 + 2 x 6 ) = z + 2 z q = z q - 1 , ( 26 ) z 3 = ( x + x q 2 + x q 4 ) 3 = ( x + x 4 + x 2 ) 3 = ( x 3 + x 5 + x 6 ) = z q , z q + 1 = ( x + x q 2 + x q 4 ) ( x q + x q 3 + x q 5 ) = ( x + x 4 + x 2 ) ( x 5 + x 6 + x 3 ) = x 6 + 1 + x 4 + x 2 + x 3 + 1 + 1 + x + x 5 = - 1
It is considered that n must be an odd number but the condition of n=5 mod 12 is not necessarily required. For simplified calculation, the following condition is employed for forming yt=y and zt=zq.
FεFq3 can be expressed in the equation (27) by use of the base y of Fq2 and δ1, δ2, δ3εFq. Further, ft is expressed in the equation (28).
f=δ 1 y+δ 2 y q3 y q 2   (27)
f t1 t y+δ 2 t y q3 y q 2   (28)
(2.2) Trace Map and Affine Map
The trace map of Fq6, Tr:Fq6→Fq, can be defined in the equation (29).
Tr(g)=g+g q +g q 2 +g q 3 +g q 4 +g q 5   (29)
The affine map φ:T6(Fq)\{1}→Fq3 is defined for g=σo+σ1zεT6(Fq) in the equation (30). Herein, 1 is a unit element of the multiplication of Fq6.
ψ ( g ) = - ( σ 0 + 1 ) σ 1 F q 3 ( 30 )
The affine inverse map φ−1:Fq3→T6(Fq)\{1} is defined in the equation (31).
ψ - 1 ( f ) = f + z f + z q ( 31 )
In this case, the equation (32) is known to be established.
ψ−1(ψ(g))=gεT 6(F q)⊂F q 6   (32)
The equation (29) corresponds to the trace map Tr in the equation (1). The equations (30) and (31) correspond to the affine transform map Af and the affine transform inverse map Af^{−1} in the equation (2).
(3) Calculation of T6(Fq) Trace
In order to derive the relationship between the trace expression Tr(g) for g and the affine expression for g (f in the equation (27)), the elements in the affine expression are used to express the elements in the trace expression. It is expressed in the equation (33).
Tr ( g ) = { f + z f + z q } + { f + z f + z q } q + { f + z f + z q } q 2 + { f + z f + z q } q 3 + { f + z f + z q } q 4 + { f + z f + z q } q 5 , = f + z f + z q + f q + z q f q + z + f q 2 + z f q z + z q + f + z q f + z + f q + z f q + z q + f q 2 + z q f q 2 + z , = ( f + z ) 2 + ( f + z q ) 2 ( f + z ) ( f + z q ) + ( f q + z ) 2 + ( f q + z q ) 2 ( f q + z ) ( f q + z q ) + ( f q 2 + z ) 2 + ( f q 2 + z q ) 2 ( f q 2 + z ) ( f q 2 + z q ) , = 2 f 2 + 2 f ( z + z q ) + ( z 2 + z 2 q ) f 2 + f ( z + z q ) + z q + 1 + 2 f 2 q + 2 f q ( z + z q ) + ( z 2 + z 2 q ) f 2 q + f q ( z + z q ) + z q + 1 + 2 f 2 q 2 + 2 f q 2 ( z + z q ) + ( z 2 + z q 2 ) f 2 q 2 + f q 2 ( z + z q ) + z q + 1 , = 2 f 2 - 2 f - 3 f 2 - f - 1 + 2 f 2 q - 2 f q - 3 f 2 q - f q - 1 + 2 f 2 q 2 - 2 f q 2 - 3 f 2 q 2 - f q 2 - 1 , = 2 f 2 - 2 f f 2 - f - 1 + 2 f 2 q - 2 f q f 2 q - f q - 1 + 2 f 2 q 2 - 2 f q 2 f 2 q 2 - f q 2 - 1 , = { 2 + 2 f 2 - f - 1 } + { 2 + 2 f 2 q - f q - 1 } + { 2 + 2 f 2 q 2 - f q 2 - 1 } , = 2 f 2 - f - 1 + 2 f 2 q - f q - 1 + 2 f 2 q 2 - f q 2 - 1 , = 2 { 1 f 2 - f - 1 + 1 ( f 2 - f - 1 ) q + 1 ( f 2 - f q - 1 ) q 2 } , = - { 1 f 2 - f - 1 + 1 ( f 2 - f - 1 ) q + 1 ( f 2 - f q - 1 ) q 2 } ( 33 )
where, if h=f2−f−1, A1y+A2y q+A3y {q^3}=h−1 are assumed, the equation (34) is obtained.
Tr ( g ) = - ( h - 1 + h - q + h - q 2 ) , = - ( A 1 + A 2 + A 3 ) ( y + y q + y q 2 ) , = A 1 + A 2 + A 3 ( 34 )
Thus, it can be seen that Tr(g) is expressed by the sum of elements in h−1. h is expressed in the equation (35).
h = ( δ 1 y + δ 2 y q + δ 3 y q 2 ) 2 - ( δ 1 y + δ 2 y q + δ 3 y q 2 ) - 1 , = ( δ 1 2 y 2 + δ 2 2 y 2 q + δ 3 2 y 2 q 2 + 2 δ 1 δ 2 y q + 1 + 2 δ 2 δ 3 y q 2 + q + 2 δ 3 δ 1 y q 2 + 1 ) - ( δ 1 y + δ 2 y q + δ 3 y q 2 ) - 1 , = y ( δ 3 2 + 2 δ 1 δ 2 + 2 δ 2 δ 3 - δ 1 + 1 ) + y q ( δ 1 2 + δ 2 δ 3 + 2 δ 3 δ 1 - δ 1 + 1 ) + y q 2 ( δ 2 2 + 2 δ 1 δ 2 + 2 δ 3 δ 1 - δ 3 + 1 ) + 2 ( δ 1 2 + δ 2 2 + δ 3 2 ) , = y ( δ 1 2 + δ 2 2 - δ 3 2 + 2 δ 1 δ 2 + 2 δ 2 δ 3 - δ 1 + 1 ) + y q ( - δ 1 2 + δ 2 2 + δ 3 2 + δ 2 δ 3 + 2 δ 3 δ 1 - δ 2 + 1 ) + y q 2 ( δ 1 2 - δ 2 2 + δ 3 2 + 2 δ 1 δ 2 + 2 δ 3 δ 1 - δ 3 + 1 ) ( 35 )
Thus, h−1 is calculated and the sum of its elements is taken so that Tr(g) is obtained. When it is developed into an equation, the denominator of Tr(g) is expressed in the equation (36). Since the numerator will be described later and is omitted here.
[ Tr ( g ) denominator ] = ( δ 1 6 + δ 2 6 + δ 3 6 ) + ( δ 1 δ 2 5 + δ 2 δ 3 5 + δ 3 δ 1 5 ) + ( δ 1 4 δ 2 2 + δ 2 4 δ 3 2 + δ 2 4 δ 1 2 ) + ( δ 1 4 δ 2 δ 3 + δ 1 δ 2 4 δ 3 + δ 1 δ 2 δ 3 4 ) + ( δ 1 2 δ 2 4 + δ 2 2 δ 3 4 + δ 3 2 δ 1 4 ) - ( δ 1 3 δ 2 3 + δ 2 3 δ 3 3 + δ 3 3 δ 1 3 ) - ( δ 1 3 δ 2 2 δ 3 + δ 1 δ 2 3 δ 3 2 + δ 1 2 δ 2 δ 3 3 ) + δ 1 2 δ 2 2 δ 3 2 - ( δ 1 5 + δ 2 5 + δ 3 5 ) + ( δ 1 δ 2 4 + δ 2 δ 3 4 + δ 3 δ 1 4 ) + ( δ 1 3 δ 2 δ 3 + δ 1 δ 2 3 δ 3 + δ 1 δ 2 δ 3 3 ) - ( δ 1 2 δ 2 3 + δ 2 2 δ 3 3 + δ 3 2 δ 1 3 ) + ( δ 1 2 δ 2 2 δ 3 + δ 1 2 δ 2 δ 3 2 + δ 1 2 δ 2 2 δ 3 ) - ( δ 1 4 + δ 2 4 + δ 3 4 ) + ( δ 1 2 δ 2 2 + δ 2 2 δ 3 2 + δ 3 2 δ 1 2 ) + ( δ 1 3 + δ 2 3 + δ 3 3 ) - ( δ 1 2 δ 2 + δ 2 2 δ 3 + δ 3 2 δ 1 ) + δ 1 δ 2 δ 3 + ( δ 1 2 + δ 2 2 + δ 3 2 ) - ( δ 1 δ 2 + δ 2 δ 3 + δ 3 δ 1 ) + ( δ 1 + δ 2 + δ 3 ) - 1 ( 36 )
(4) Conditional Equation of G_in T6(Fq)
f^{q+1} is expressed in the equation (37).
f q + 1 = ( δ 3 y + δ 1 y q + δ 2 y q 2 ) ( δ 1 y + δ 2 y q + δ 3 y q 2 ) , = δ 1 δ 3 y 2 + δ 1 δ 2 y 2 q + δ 2 δ 3 y 2 q 2 + ( δ 1 2 + δ 2 δ 3 ) y q + 1 + ( δ 2 2 + δ 1 δ 3 ) y q 2 + q + ( δ 3 2 + δ 1 δ 2 ) y q 2 + 1 , = δ 1 δ 3 ( y q + 2 ) + δ 1 δ 2 ( y q 2 + 2 ) + δ 2 δ 3 ( y + 2 ) + ( δ 1 2 + δ 2 δ 3 ) ( y + y q 2 ) + ( δ 2 2 + δ 1 δ 3 ) ( y + y q ) + ( δ 3 2 + δ 1 δ 2 ) ( y q + y q 2 ) , = ( δ 2 δ 3 + δ 1 2 + δ 2 δ 3 + δ 2 2 + δ 1 δ 3 ) y + ( δ 1 δ 3 + δ 2 2 + δ 1 δ 3 + δ 3 2 + δ 1 δ 2 ) y q + ( δ 1 δ 2 + δ 1 2 + δ 2 δ 3 + δ 3 2 + δ 1 δ 2 ) y q 2 + 2 ( δ 1 δ 3 + δ 1 δ 2 + δ 2 δ 3 ) , = ( δ 1 2 + δ 2 2 + 2 δ 2 δ 3 + δ 1 δ 3 ) y + ( δ 2 2 + δ 3 2 + 2 δ 1 δ 3 + δ 1 δ 2 ) y q + ( δ 3 2 + δ 1 2 + 2 δ 1 δ 2 + δ 2 δ 3 ) y q 2 + 2 ( δ 1 δ 3 + δ 1 δ 2 + δ 2 δ 3 ) , = { ( δ 1 2 + δ 2 2 + 2 δ 2 δ 3 + δ 1 δ 3 ) + ( δ 1 δ 3 + δ 1 δ 2 + δ 2 δ 3 ) } y + { ( δ 2 2 + δ 3 2 + 2 δ 1 δ 3 + δ 1 δ 2 ) + ( δ 1 δ 3 + δ 1 δ 2 + δ 2 δ 3 ) } y q + { ( δ 3 2 + δ 1 2 + 2 δ 1 δ 2 + δ 2 δ 3 ) + ( δ 1 δ 3 + δ 1 δ 2 + δ 2 δ 3 ) } y q 2 , = ( δ 1 2 + δ 2 2 + 2 δ 1 δ 3 + δ 1 δ 2 ) y + ( δ 2 2 + δ 3 2 + 2 δ 1 δ 2 + δ 2 δ 3 ) y q + ( δ 3 2 + δ 1 2 + 2 δ 2 δ 3 + δ 1 δ 3 ) } y q 2 ( 37 )
Since the order of G_ is q−t+1, the element of G_ is raised to the (q−t+1)-th power to be 1. That is, the equation (38) is obtained.
g F q 6 , f F q 3 , g = f + z f + z q , t = 3 q g q - t + 1 = 1 ( 38 )
Thus, gq+1=gt is obtained. gq+1=gt is arranged and then the equation (39) is obtained.
g · g q = g t { f + z f + z q } { f q + z q f q + z } = { f t + z t f t + z q t } , ( f + z ) ( f q + Z q ) ( f t + z ) = ( f + z q ) ( f q + z ) ( f t + z q ) , f q + t + 1 + z ( f q + t + f q + 1 ) + z q f t + 1 + z q + 1 ( f t + f ) + z 2 f q + z q + 2 = f q + t + 1 + zf t + 1 + z q ( f q + t + f q + 1 ) + z q + 1 ( f t + f ) + z 2 q f q + z 2 q + 1 , z ( f q + t + f q + 1 ) + z q f t + 1 + ( z + z q ) ( f t + f ) + ( z + 2 z q ) f q + 2 z = zf t + 1 + z q ( f q + t + f q + 1 ) + ( z + z q ) ( f t + f ) + ( 2 z + z q ) f q + 2 z q , z ( f q + t + f q + 1 + f t + f + f q + 2 ) + z q ( f t + 1 + f t + f + 2 f q ) = z ( f t + 1 + f t + f + 2 f q ) + z q ( f q + t + f q + 1 + f t + f + f q + 2 ) , z ( f q + t + f q + 1 + f q + 2 ) + z q ( f t + 1 + 2 f q ) = z ( f t + 1 + 2 f q ) + z q ( f q + t + f q + 1 + f q + 2 ) ( 39 )
The conditional equation of G_ is expressed in the equation (40). As expressed in the equation (40), the same equation can be derived from either condition.
z:f q+t +f q+1 −f t+1 −f q+2=0,
z q :f q+t +f q+1 −f t+1 −f q+2=0  (40)
The equation is further developed by use of f in the equation (27) and then the equations (41) to (43) are obtained.
y:δ 1 t3−δ2)+δ3 t123)+2δ3δ11δ21 22 2−δ3=2,  (41)
y q2 t1−δ3)+δ1 t123)+2δ1δ22δ32 23 2−δ1=2,  (42)
y q 2 3 t2−δ1)+δ2 t123)+2δ2δ33δ13 21 2−δ2=2  (43)
(4.1) Conditional Equation of T2(Fq)
The conditional equation for T2(Fq3) is also arranged due to T2(Fq3)εT6(Fq)εG_. Since the order of T2(Fq3) is q2q+1, g^(q2−q+1)=1 is established. The conditional equation for δ1, δ2, and δ3 is arranged from the above equation. It is expressed in the equation (44).
{ f + z f + z q } q 2 - q + 1 = 1 , -> { f + z f + z q } q 2 + 1 = { f + z f + z q } q , -> { f + z f + z q } q 2 { f + z f + z q } = { f + z f + z q } q , -> { f q 2 + z f q 2 + z q } { f + z f + z q } = { f q + z q f q + z } , -> ( f q 2 + z ) ( f + z ) ( f q + z ) = ( f q 2 + z q ) ( f + z q ) ( f q + z q ) , -> f q 2 + q + 1 + ( f q 2 + q + f q 2 + 1 + f q + 1 ) z + ( f q 2 + f q + f ) z 2 + z 3 = f q 2 + q + 1 + ( f q 2 + q + f q 2 + 1 + f q + 1 ) z q + ( f q 2 + f q + f ) z 2 q + z 3 q , -> ( f q 2 + q + f q 2 + 1 + f q + 1 ) z + ( f q 2 + f q + f ) z 2 + z 3 = ( f q 2 + q + f q 2 + 1 + f q + 1 ) z q + ( f q 2 + f q + f ) z 2 q + z 3 q , -> ( f q 2 + q + f q 2 + 1 + f q + 1 ) ( z - z q ) + ( f q 2 + f q + f ) ( z q - 1 - z + 1 ) - ( z - z q ) = 0 ( 44 )
Thus, the equation (45) is obtained.
f q 2 +q +f q 2 +1 +f q+1 −f q 2 −f q −f−1=0  (45)
When the transform is continued by use of the equation (27), the relationship in the equation (46) is obtained. The equation is used for the subsequent transform of equations.
f q 2 +q +f q 2 +1 +f q+1 −f q 2 −f q −f−1=0,
→{(f q+1)q 2 +(f q+1)q +f q+1 }−{f q 2 +f q +f}−1=0,
→{(δ1 22 2+2δ1δ31δ2)+(δ2 23 2+2δ1δ22δ3)+(δ3 21 2+2δ2δ31δ3)}(y+y q +y q 2 )−(δ123)(y+y q +y q 2 )−1=0,
→{(2δ1 2+2δ2 2+2δ3 2)−(δ123)}(y+y q +y q 2 )−1=0,
→{(δ1 22 23 2)+(δ123)}−1=0,
→{(δ1 22 23 2)+(δ123)}=1  (46)
(5) Affine Expression Having the Same Trace Value
The trace value of an element is the same as the trace value of the q-th power of the element. From the property, at least six affine expressions having the same trace value are present. The relationship between the affine expressions will be considered. In the case of fεFq3, the relational equation is expressed in the equation (47).
Tr ( f + z f + z q ) = Tr ( f q + z q f + z ) = Tr ( f q 2 + z f + z q ) = Tr ( f + z q f + z ) = Tr ( f q + z f + z q ) = Tr ( f q 2 + z q f + z ) ( 47 )
Since the q2-th power in the affine expression leads to the rearrangement of elements and thus a difference in the affine expression at the q3-th power of an element is considered. Since the equation (48) is established, when an element is raised to the q3-th power, the affine expression has a value obtained by subtracting 1 from the doubled element.
( f + z f + z q ) q 2 = f + z q f + z = f - 1 - z f - 1 - z q = ( f + 2 ) + 2 z ( f + 2 ) + 2 z q = ( 2 f + 1 ) + z ( 2 f + 1 ) + z q ( 48 )
When the combinations of elements having the same trace value are derived in consideration of the equation (27) and the first equation in the equation (25) (y+yq+y^(q2)=−1), the following six combinations are obtained.
    • 1, δ2, δ3)
    • (2δ3−1, 2δ1−1, 2δ2−1)
    • 2, δ3, δ1)
    • (2δ1−1, 2δ2−1, 2δ3−1)
    • 3, δ1, δ2)
    • (2δ2−1, 2δ3−1, 2δ1−1)
It can be seen that the elements are rearranged due to the q2-th power. In the case of α=δ1−1, β=δ2−1, and γ=δ3−1, the equation (49) is obtained.
f=(α+1)y+(β+1)y q+(γ+1)y q 2   (49)
The q3-th power of f is expressed in the equation (50).
f q 3 = ( 2 δ 1 - 1 ) y + ( 2 δ 2 - 1 ) y q + ( 2 δ 3 - 1 ) y q 2 , = 2 ( δ 1 + 1 ) y + 2 ( δ 2 + 1 ) y q + 2 ( δ 3 + 1 ) y q 2 , = 2 ( α - 1 ) y + 2 ( β - 1 ) y q + 2 ( γ - 1 ) y q 2 ( 50 )
When α, β and γ are expressed as described above, the q-th power can be considered as the doubling and the elements' rearrangement. 2×2=1 (mod 3) has also to be paid attention. In the following, the equation transform is performed by replacing δ1, δ2 and δ3 with α+1, β+1 and γ+1, respectively.
(5.1) Calculation of T6(Fq) Trace (Version 2)
The transform of the trace equation by α, β and γ is assumed. The equation (36) is transformed into the equation (51). The numerator is expressed in the equation (52).
[ Tr ( g ) denominator ] = ( α + β + γ ) 6 + ( α β 5 + β γ 5 + γ α 5 ) + ( α 4 β 2 + β 4 γ 2 + γ 4 α 2 ) + α β γ ( α + β + γ ) 3 + ( α 2 β 4 + β 2 γ 4 + γ 2 α 4 ) - α β γ ( α 2 β + β 2 γ + γ 2 α ) - α 2 β 2 γ 2 - ( α 3 β + β 3 γ + γ 3 α ) - α β γ ( α + β + γ ) - ( α 2 + β 2 + γ 2 ) - ( α β + β γ + γ α ) + 1 ( 51 ) [ Tr ( g ) numerator ] = - ( α 3 β + β 3 γ + γ 3 α ) - α β γ ( α + β + γ ) + ( α 2 + β 2 + γ 2 ) + ( α β + β γ + γ α ) ( 52 )
(5.2) Conditional Equation of T2(Fq) (Version 2)
The equation (46) is transformed by use of α, β and γ into the equation (53).
α222=1  (53)
(5.3) Conditional Equation of G_ in T6(Fq) (Version 2)
The equations (41) to (43) are transformed by use of α, β and γ into the three equations, respectively.
αt(γ−β)+γt(α+β+γ)−αγ+αβ+α22=1
βt(α−γ)+αt(α+β+γ)−βα+βγ+β22=1
γt(β−α)+βt(α+β+γ)−γβ+γα+γ22=1
The terms with the t-th power in the equations are expressed in the equation (54).
α t = - α 4 - β 4 + γ 4 - α 3 β + β 3 γ + α β 3 - γ α 3 + α 2 β γ 2 - α β γ 2 - α 2 + β 2 - γ 2 - α β - β γ ( α + β + γ ) 3 + ( α 2 β + β 2 γ + γ 2 α ) - ( α β 2 + β γ 2 + γ α 2 ) β t = α 4 - β 4 - γ 4 - β 3 γ + γ 3 α + β γ 3 - α β 3 + β 2 γ 2 - α 2 β γ - β 2 + γ 2 - α 2 - β γ - γ α ( α + β + γ ) 3 + ( α 3 β + β 2 γ + γ 2 α ) - ( α β 2 + β γ 2 + γ α 2 ) , γ t = - α 4 + β 4 - γ 4 - γ 3 α + α 3 β + γ α 3 - βγ 3 + γ 2 α 2 - α β 2 γ - γ 2 + α 2 - β 2 - γ α - α β ( α + β + γ ) 3 + ( α 2 β + β 2 γ + γ 2 α ) - ( α β 2 + βγ 2 + γ α 2 ) , ( α t + β t + γ t ) = - ( α 2 + β 2 + γ 2 ) 2 - ( α + β + γ ) 2 ( α + β + γ ) 3 + ( α 3 β + β 2 γ + γ 2 α ) - ( α β 2 + β γ 2 + γ α 2 ) ( 54 )
The equation (55) is obtained by the equation (53).
α t = α 2 + α β 2 - ( α β 3 + β γ 3 + γ α 3 ) ( α + β + γ ) + ( α β 2 + β γ 2 + γ α 2 ) , β t = β 2 + βγ 2 - ( α β 3 + β γ 3 + γ α 3 ) ( α + β + γ ) + ( α β 2 + β γ 2 + γ α 2 ) , γ t = γ 2 + γ α 2 - ( α β 3 + β γ 3 + γ α 3 ) ( α + β + γ ) + ( α β 2 + β γ 2 + γ α 2 ) , ( α + β + γ ) t = - 1 - ( α + β + γ ) 2 ( α + β + γ ) + ( α β 2 + β γ 2 + γ α 2 ) ( 55 )
From the equations, the relationship expressed in the equation (56) is also obtained.
( α + β + γ ) + ( α β 2 + βγ 2 + γ α 2 ) = - 1 - ( α + β + γ ) 2 ( α + β + γ ) t , -> ( α β 2 + β γ 2 + γ α 2 ) = - 1 - ( α + β + γ ) 2 ( α + β + γ ) t - ( α + β + γ ) ( 56 )
(5.4) Calculation of T6(Fq) Trace (Version 3)
The equations (51) and (52) are transformed by the equation (53). The two kinds of finally symmetrical equations (α+β+γ) and αβγ, and an asymmetrical equation (αβ2+βγ2+γα2) are used as many times as possible. The equations are also simplified here by use of A=α+β+γ, B=αβ2+βγ2+γα2, C=αβγ.
First, the relationship expressed in the equation (57) is obtained.
α β + β γ + γ α = 1 - ( α + β + γ ) 2 , = 1 - A 2 , α 2 β + β 2 γ + γ 2 α = ( α + β + γ ) ( α 2 + β 2 + γ 2 ) - ( α + β + γ ) 3 - ( αβ 2 + β γ 2 + γ α 2 ) , = ( α + β + γ ) { 1 - ( α + β + γ ) 2 } - ( α β 2 + β γ 2 + γ α 2 ) , = A ( 1 - A 2 ) - B , ( 57 ) α 2 β 2 + β 2 γ 2 + γ 2 α 2 = ( αβ + β γ + γ α ) 2 + α β γ ( α + β + γ ) , = 1 + ( α + β + γ ) 2 + ( α + β + γ ) 4 + αβ γ ( α + β + γ ) , = 1 + A 2 + A 4 + A C , α β 3 + β γ 3 + γ α 3 = ( α + β + γ ) ( α β 2 + β γ 2 + γ α 2 ) - ( α 2 β 2 + β 2 γ 2 + γ 2 α 2 ) - α β γ ( α + β + γ ) , = ( α + β + γ ) ( α β 2 + β γ 2 + γ α 2 ) + α β γ ( α + β + γ ) - ( α + β + γ ) 4 - ( α + β + γ ) 2 - 1 , = AB + A C - A 4 - A 2 - 1 , α 3 β + β 3 γ + γ 3 α = ( α + β + γ ) ( α 2 β + β 2 γ + γ 2 α ) - ( α 2 β 2 + β 2 γ 2 + γ 2 α 2 ) - α β γ ( α + β + γ ) , = ( α + β + γ ) 2 { 1 - ( α + β + γ ) 2 } - ( α + β + γ ) ( αβ 2 + β γ 2 + γ α 2 ) + α β γ ( α + β + γ ) - ( α + β + γ ) 4 - ( α + β + γ ) 2 - 1 , = ( α + β + γ ) 4 - 1 + α β γ ( α + β + γ ) - ( α + β + γ ) ( α β 2 + β γ 2 + γ α 2 ) , = A 4 + A C - A B - 1 , α 3 β 2 + β 3 γ 2 + γ 3 α 2 = ( α 2 β + β 2 γ + γ 2 α ) ( α β + β γ + γα ) - α β γ ( α β + β γ + γ α ) - α β γ , = [ ( α + β + γ ) { 1 - ( α + β + γ ) 2 } - ( αβ 2 + β γ 2 + γ α 2 ) ] × { 1 - ( α + β + γ ) 2 } - αβ γ { 1 - ( α + β + γ ) 2 - 1 } , = ( α + β + γ ) - ( α + β + γ ) 3 + α βγ ( α + β + γ ) 2 - ( α β 2 + β γ 2 + γ α 2 ) { 1 - ( α + β + γ ) 2 } , = ( α + β + γ ) + ( α + β + γ ) 3 + ( α + β + γ ) 5 + ( αβ 2 + βγ 2 + γ α 2 ) { ( α + β + γ ) 2 - 1 } + α βγ ( α + β + γ ) 2 , = A + A 3 + A 5 + B ( A 2 - 1 ) + A 2 C , α 2 β 3 + β 2 γ 3 + γ 2 α 3 = ( αβ 2 + βγ 2 + γ α 2 ) ( α β + β γ + γ α ) - α β γ ( α β + β γ + γ α ) - α β γ , = ( α β 2 + β γ 2 + γ α 2 ) { 1 - ( α + β + γ ) 2 } + α β γ ( α + β + γ ) 2 , = B - A 2 B + A 2 C , α β 5 + β γ 5 + γ α 5 = ( α β 2 + β γ 2 + γα 2 ) ( α + β + γ ) 3 - ( α 4 β 2 + β 4 γ 2 + γ 4 α 2 ) - α β γ ( α β 2 + β γ 2 + γ α 2 ) , = ( α β 2 + β γ 2 + γ α 2 ) ( α + β + γ ) 3 - { ( α 2 β + β 2 γ + γ 2 α ) 2 + α βγ ( α β 2 + β γ 2 + γα 2 ) } - α β γ ( α β 2 + β γ 2 + γ α 2 ) , = ( α β 2 + β γ 2 + γα 2 ) ( α + β + γ ) 3 - [ ( α + β + γ ) { 1 - ( α + β + γ ) 2 } - ( α β 2 + β γ 2 + γ α 2 ) ] 2 + α β γ ( α β 2 + β γ 2 + γ α 2 ) , = ( α β 2 + β γ 2 + γ α 2 ) ( α + β + γ ) 3 - ( α + β + γ ) 2 { 1 - ( α + β + γ ) 2 } 2 - ( αβ 2 + βγ 2 + γ α 2 ) 2 - ( α β 2 + β γ 2 + γα 2 ) 2 ( α + β + γ ) { 1 - ( α + β + γ ) 2 } + α β γ ( α β 2 + βγ 2 + γα 2 ) , = ( α β 2 + β γ 2 + γ α 2 ) { - ( αβ 2 + β γ 2 + γ α 2 ) - ( α + β + γ ) - ( α + β + γ ) 3 + α β γ } - ( α + β + γ ) 2 - ( α + β + γ ) 4 - ( α + β + γ ) 6 , = - B 2 - AB - A 3 B + BC - A 2 - A 4 - A 6
The relationship expressed in the equation (58) is obtained.
{ ( α β 2 + β γ 2 + γ α 2 ) - ( α 2 β + β 2 γ + γ 2 α ) } 2 = ( α 2 β 4 + β 2 γ 4 + γ 2 α 4 ) + ( α 4 β 2 + β 4 γ 2 + γ 4 α 2 ) - α β γ ( α 2 β + β 2 γ + γ 2 α ) - αβ γ ( α β 2 + β γ 2 + γ α 2 ) + ( α 3 β 3 + β 3 γ 3 + γ 3 α 3 ) + α β γ ( α + β + γ ) 3 , = ( α 4 + β 4 + γ 4 ) ( α 2 + β 2 + γ 2 ) - ( α 3 + β 3 + γ 3 ) 2 - α βγ ( α 2 + β 2 + γ 2 ) ( α + β + γ ) - αβ γ ( α 3 + β 3 + γ 3 ) , = ( α 4 + β 4 + γ 4 ) - ( α + β + γ ) 6 - α β γ ( α + β + γ ) - α β γ ( α + β + γ ) 3 , = ( α 2 + β 2 + γ 2 ) 2 + ( α 2 β 2 + β 2 γ 2 + γ 2 α 2 ) - ( α + β + γ ) 6 - α β γ ( α + β + γ ) - α β γ ( α + β + γ ) 3 , = 1 2 + 1 + ( α + β + γ ) 2 + ( α + β + γ ) 4 + α β γ ( α + β + γ ) - ( α + β + γ ) 6 - α β γ ( α + β + γ ) - α β γ ( α + β + γ ) 3 , = - 1 + ( α + β + γ ) 2 + ( α + β + γ ) 4 - ( α + β + γ ) 6 - α β γ ( α + β + γ ) 3 , ( α β 2 + βγ 2 + γ α 2 ) - ( α 2 β + β 2 γ + γ 2 α ) = - ( α + β + γ ) { 1 - ( α + β + γ ) 2 } - ( α β 2 + β γ 2 + γα 2 ) ( 58 )
The equation (59) is obtained from the equations (57) and (58).
{ ( α β 2 + β γ 2 + γ α 2 ) - ( α 2 β + β 2 γ + γ 2 α ) } 2 = { ( α + β + γ ) { 1 - ( α + β + γ ) 2 } + ( α β 2 + β γ 2 + γ α 2 ) } 2 , = ( α + β + γ ) 2 { 1 - ( α + β + γ ) 2 } 2 - ( α + β + γ ) { 1 - ( α + β + γ ) 2 } ( α β 2 + β γ 2 + γ α 2 ) + ( α β 2 + β γ 2 + γ α 2 ) 2 , = ( α + β + γ ) 2 + ( α + β + γ ) 4 + ( α + β + γ ) 6 - { ( α + β + γ ) - ( α + β + γ ) 3 } ( α β 2 + β γ 2 + γ α 2 ) + ( α β 2 + β γ 2 + γ α 2 ) 2 , = - 1 + ( α + β + γ ) 2 + ( α + β + γ ) 4 - ( α + β + γ ) 6 - α β γ ( α + β + γ ) 3 ( 59 )
Thus, the equation (60) is obtained.
30 β+γ)6−{(α+β+γ)−(α+β+γ)3}(αβ2+βγ2+γα2)+(αβ2+βγ2+γα2)2,
=−1−(α+β+γ)6−αβγ(α+β+γ)3,
→(αβ2+βγ2+γα2)2=(α+β+γ)6+{(α+β+γ)−(α+β+γ)3}(αβ2+βγ2+γα2)−αβγ(α+β+γ)3−1
B 2 =A 6 −A 3(B+C)+AB−1  (60)
The equations (61) and (62) are obtained for C.
C = A 3 - B + AB - B 2 - 1 A 3 ( 61 ) α β γ = ( α + β + γ ) 3 - ( α β 2 + β γ 2 + γ α 2 ) + ( α + β + γ ) ( α β 2 + β γ 2 + γ α 2 ) - ( α β 2 + β γ 2 + γ α 2 ) 2 - 1 ( α + β + γ ) 3 ( 62 )
Tr(g) is deformed to obtain the equations (63) and (64) from the equations (51) and (52).
[ Tr ( g ) denominator ] = ( α + β + γ ) 6 + ( α β 5 + β γ 5 + γ α 5 ) + ( α 4 β 2 + β 4 γ 2 + γ 4 α 2 ) + α β γ ( α + β + γ ) 3 + ( α 2 β 4 + β 2 γ 4 + γ 2 α 4 ) - α β γ ( α 2 β + β 2 γ + γ 2 α ) + α 2 β 2 γ 2 - ( α 3 β + β 3 γ + γ 3 α ) - α β γ ( α + β + γ ) - ( α 2 + β 2 + γ 2 ) - ( α β + β γ + γ α ) + 1 , = ( A 6 ) + ( - B 2 - AB - A 3 B + BC - A 2 - A 4 - A 6 ) + ( α 2 β 2 + β 2 γ 2 + γ 2 α 2 ) ( α 2 + β 2 + γ 2 ) + ( A 3 C ) - C { A ( 1 - A ) 2 - B } + C 2 - ( A 4 + A C - AB - 1 ) - A C - 1 - ( 1 - A 2 ) + 1 , = - B 2 - A 3 B + BC - A 4 + ( 1 + A 2 + A 4 + A C ) + A 3 C + ( - A C + A 3 C + BC ) + C 2 - A 4 - A C + 1 - A C - 1 , = - B 2 - A 3 B - BC + A 2 - A 3 C + C 2 - A 4 + A C + 1 , = B 2 - A 3 B - BC + A 2 - A 3 C + C 2 - A 4 + A C + 1 + ( A 6 - A 3 ( B + C ) + AB - 1 ) , = ( B 2 - BC + C 2 ) + A 3 ( B + C ) + A ( B + C ) + ( A 2 - A 4 + A 6 ) , = ( B + C ) 2 + A ( A 2 + 1 ) ( B + C ) + { A ( A 2 + 1 ) } 2 , = ( B + C - A 3 - A ) 2 ( 63 ) [ Tr ( g ) numerator ] = - ( α 3 β + β 3 γ + γ 3 α ) - α β γ ( α + β + γ ) + ( α 2 + β 2 + γ 2 ) + ( α β + β γ + γ α ) , = - ( A 4 + A C - AB - 1 ) - A C + 1 + 1 - A 2 , = - A 4 + A C + AB - A 2 , = A ( B + C - A 3 - A ) ( 64 )
Common factors are present in the denominator and numerator and thus are cancelled to obtain the equations (65) and (66).
Tr ( g ) = A B + C - A 3 - A ( 65 ) = α + β + γ ( α β 2 + β γ 2 + γ α 2 ) + α β γ - ( α + β + γ ) 3 - ( α + β + γ ) ( 66 )
The equations are continuously deformed by the equation (56) to obtain the equation (67).
Tr ( g ) = α + β + γ ( α β 2 + β γ 2 + γ α 2 ) + αβ γ - ( α + β + γ ) 3 - ( α + β + γ ) , = α + β + γ - 1 - ( α + β + γ ) 2 ( α + β + γ ) t - ( α + β + γ ) + α βγ - ( α + β + γ ) 3 - ( α + β + γ ) , = α + β + γ - 1 - ( α + β + γ ) 2 ( α + β + γ ) t + α βγ - ( α + β + γ ) 3 - ( α + β + γ ) , = ( α + β + γ ) t + 1 - 1 - ( α + β + γ ) 2 + αβ γ ( α + β + γ ) t - ( α + β + γ ) t + 3 + ( α + β + γ ) t + 1 , = A t + 1 - 1 - A 2 + CA t - A t + 3 + A t + 1 ( 67 )
(6) Transform from Trace into Torus
It can be seen that Tr(g) can be written with A=α+β+γ and C=αβγ. C can be written with A and B=αβ2+βγ2+γα2 and B can be written with A so that Tr(g) is written with A. The equation (68) is obtained from the equation (65).
Tr ( g ) = A B + C - A 3 - A , = A A 3 B + A 6 - A 3 B + AB - B 2 - 1 A 3 - A 3 - A , = A 4 AB - B 2 - 1 - A 4 , = A 4 - A { 1 + A 2 A t + A } - { 1 + A 2 A t + A } 2 - 1 - A 4 , = A 4 - A - A 3 + A + A 3 A t - A 2 - ( 1 + A 2 ) 2 A 2 t - A 2 - 1 - A 4 , = A 4 - ( 1 + A 2 ) 2 A 2 t - ( A 2 + 1 ) 2 , = A 2 t + 4 - ( 1 + A 2 ) A 2 t - ( A 2 + 1 ) 2 , = A 2 t + 4 - ( 1 + A 2 ) 2 ( A 2 t + 1 ) , = A 2 t + 4 - ( 1 + A 2 ) 2 ( A 2 + 1 ) t , = A 2 t + 4 - ( 1 + A 2 ) t + 2 , = { - A 2 1 + A 2 } t + 2 ( 68 )
Both sides are raised to the t−2-th power and thus the equation (69) is obtained. The equation (70) is obtained from the equation (69). Thereby, A=α+β+γ can be obtained from Tr(g).
{ Tr ( g ) } t - 2 = { - A 2 1 + A 2 } - 1 , = - A 2 + 1 A 2 , = - 1 - 1 A 2 ( 69 ) { Tr ( g ) } t - 2 + 1 = - 1 A 2 , -> A 2 = - [ { Tr ( g ) } - 2 + 1 ] - 1 ( 70 )
(7) Method for Deriving Cubic Equation
There will be described the method for obtaining β from A=α+β+γ and other relational equations. The relational equations obtained so far are as follows (the equations (71) to (74)).
A=α+β+γ  (71)
B=αβ 2+βγ2+γα2  (72)
C=αβγ  (73)
α222=1  (74)
The equation (71) is deformed to obtain the equation (75).
α=A−β−γ  (75)
The equation (75) is substituted into the equations (72), (73) and (74) for rearrangement to obtain the equations (76) to (78).
−β33 +Aβ 2 +Aβγ+Aγ 2 +A 2 γ−B=0  (76)
−β2γ−βγ2 +Aβγ−C=0  (77)
−β2−βγ−γ2 +Aβ+Aγ+A 2−1=0  (78)
The equation (78) is multiplied by β to obtain the equation (79).
−β3−β2γ−βγ2 +Aβ 2 +Aβγ+(A 2−1)β=0  (79)
The equation obtained by subtracting the equation (77) from the equation (79) is multiplied by −1 to obtain the equation (80).
β3 −Aβ 2−(A 2−1)β−C=0  (80)
Since B=((−1−A2)/At)−A is obtained from the equation (56) and C=A3−B+(AB−B2−1)/A3 is obtained from the equation (61), C can be written with A. Thus, the following cubic equation having the root of β is obtained. The equation is solved to obtain β.
x 3 −Ax 2−(A 2−1)x−C=0
(8) Method for Deriving Linear Equation
A method for obtaining γ from A=α+β+γ and other relational equations. The equation (78) is multiplied by γ to obtain the equation (81).
−β2γ−βγ2−γ3 +Aβγ+Aγ 2+(A 2−1)γ=0  (81)
Subtracting equation (77) from the equation (81) obtains the equation (82).
−γ3 +Aγ 2+(A 2−1)γ+C=0  (82)
Further, subtracting the equation (80) from the equation (76) and then adding the equation (82) obtains the equation (83).
Aβγ−Aγ 2+(−A 2+1)β+(−A 2−1)γ−B=0  (83)
The equation obtained by multiplying the equation (83) by β and the equation obtained by multiplying the equation (77) by A are the equations (84) and (85), respectively.
2 γ−Aβγ 2+(−A 2+1)β2+(−A 2−1)βγ−Bβ=0  (84)
2 γ−Aβγ 2 +A 2 βγ−AC=0  (85)
Subtracting the equation (85) from the equation (84) obtains the equation (86).
2γ+(−A 2+1)β2+(A 2−1)βγ−Bβ+AC=0  (86)
The equation (86) is divided by A and arranging for γ to obtain the equation (87).
(−β2+(A−(1/A))β)γ+(−A+(1/A2 −Bβ/A+C=0  (87)
Since A, B, C and β are the constant values from the solutions of quadric equations and the cubic equations previously found, the linear equation (88) having the root of γ is obtained.
(−β2+(A−(1/A))β)x+(−A+(1/A))β2 −Bβ/A+C=0  (88)
When β and γ are found, α is found from the equation (71).
(9) Summary
There is given the method for obtaining the affine expression (α+1, β+1, γ+1) from the trace expression Tr(g) of the elements in the algebraic torus subgroup by solving the equation (89).
x 2 =−[{Tr(g)}t−2+1]−1
x 3 +Ax 2+(A 2−1)x+C=0
(− 2+(A 2−1)β)x+(−A 2+1)β2 −Bβ+AC=0  (89)
The specific procedure is as follows.
    • To obtain two solutions by solving x2=−[{Tr(g)}t−2+1]−1 which is a quadric equation having the root of α+β+γ.
    • To obtain three solutions by solving x3−Ax2−(A2−1)x−C=0 which is a cubic equation having the root of β found by substituting the two solutions into A, respectively.
    • To obtain one solution and calculate a corresponding α by solving (−β2+(A−(1/A))βx+(−A+(1/A))β2−Bβ/A+C=0 which is a linear equation having the root of γ, the linear equation being obtained by substituting one of the solutions of the quadric equation into A and one of the solutions of the cubic equation corresponding to A into β.
Since a total of six (α, β, γ) are obtained from the above, an additional bit is used to specify a correct (α, β, γ).
A method for deriving an equation used at the compression rate of 1/4 (in the third and fourth embodiments) will be described below.
(1) 1/4 Compression
T4(Fq) is assumed as torus and the trace (trace expression) is taken as a subgroup. Since the cyclotomic polynomial Φ4 is factorized to obtain Φ4=q2+1=(q+√(2q)+1)(q−√(2q)+1), if the terms take an integer, the torus can be divided into the subgroups. Specifically, when q is raised to the odd-number-th power of 2, the subgroups can be compatibly configured by the factorization.
It is assumed that the subgroup having the order of (q+√(2q)+1) is G+ and the subgroup having the order of (q−√(2q)+1) is G_. Since the mapping from an element in the subgroup in the torus into an element in the trace is not bijective, there are multiple elements of the torus to be mapped from elements of a trace. Since four elements in a trace corresponding to the elements in one trace are present (see the trace expression for details), two additional bits are required for identifying the four elements. In the following, a relationship between the trace and the affine expression will be made clear and the method for decompressing the trace to the affine expression will be described. The following operations are over F(2^n)^4 unless otherwise noted.
(2) Preparation
(2.1) Arrangement of Conditions
T=√(2q) is assumed.
The definition expressed in the equation (90) and the condition of q≡t≡2 (mod 5) are set for preventing a contradiction between the torus and the trace to be considered and for easily deforming the equations.
1 + x + x q + x q 2 + x q 3 = 0 , y = x + x q 2 , z = x + x q , g T 4 ( F q ) , g = f + z f + z q , f F q 2 , f = δ 1 y + δ 2 y q ( 90 )
Under the definition and the condition, the substitutions such as x=x1, xq=x2, x^q2=x4, x^q3=x3 are possible. Under the definition and the hypothesis, the conditional equation expressed in the equation (91) is obtained.
y q + 1 = ( x + x q 2 ) ( x q + x q 3 ) = x q + 1 + x q 3 + 1 + x q 2 + q + x q 3 + q 2 , = x 3 + x 4 + x + x 2 ( q = 2 mod 5 is used ) , = y + y q = 1. ( 91 ) y 2 = x 2 + x 2 q 2 , = x 2 + x 3 , = x q + x q 3 , = y q . y 2 q = y q ( 1 + y ) , = y q + y q + 1 , = y q + 1 , = y · ( method of y 2 is also available ) z 2 = ( x + x q ) 2 = x 2 + x 2 q = x 2 + x 4 = x q + x q 2 = z q . z 2 q = ( x q + x q 2 ) 2 = x 2 q + x 2 q 2 = x 4 + x 3 = x q 2 + x q 3 = z q 2 , z q 2 + 1 = ( x + x q ) ( x q 2 + x q 3 ) = ( x + x 2 ) ( x 3 + x 4 ) = x 4 + x = x + x q 2 = y . z q + 1 = ( x + x q ) ( x q + x q 2 ) = ( x + x 2 ) ( x 2 + x 4 ) = x 3 + 1 + x 4 + x = x 2 = x q . z q 2 + q = ( x q 2 + x q 3 ) ( x q + x q 2 ) = ( x 4 + x 3 ) ( x 2 + x 4 ) = x + x 3 + 1 + x 2 = x 4 = x q 2 . z q 3 + q 2 + q = ( x q 3 + x ) x q 2 = ( x 3 + x ) x 4 = x 2 + 1 = x q + 1.
(2.2) Frequently-used Relational Equations
First, the equation (92) collectively describes the relational equations of f used for deforming the equations in the following.
f 2 = δ 1 2 y 2 + 2 δ 1 δ 2 y q + 1 + δ 2 2 y 2 q , = δ 1 2 y q + δ 2 2 y . ( 92 ) f 2 q = δ 1 2 y 2 q + 2 δ 1 δ 2 y q + 1 + δ 2 2 y 2 , = δ 1 2 y + δ 2 2 y q . f q + 1 = ( δ 1 y + δ 2 y q ) ( δ 1 y q + δ 2 y ) , = ( δ 1 2 + δ 2 2 ) y q + 1 + δ 1 δ 2 ( y 2 + y 2 q ) , = δ 1 2 + δ 2 2 + δ 1 δ 2 ( y + y q ) , = δ 1 2 + δ 1 δ 2 + δ 2 2 . f q + 2 = ( δ 1 y q + δ 2 y ) ( δ 1 2 y q + δ 2 2 y ) , = δ 1 3 y 2 q + ( δ 1 2 δ 2 + δ 1 δ 2 2 ) y q + 1 + δ 2 3 y 2 , = δ 1 3 y + δ 2 3 y q + δ 1 2 δ 2 + δ 1 δ 2 2 , f 2 q + 1 = ( δ 1 2 y + δ 2 2 y q ) ( δ 1 y + δ 2 y q ) , = δ 1 3 y 2 + ( δ 1 2 δ 2 + δ 1 δ 2 2 ) y q + 1 + δ 2 3 y 2 q , = δ 1 3 y q + δ 2 3 y + δ 1 2 δ 2 + δ 1 δ 2 2 . f 2 q + 2 = ( f q + 1 ) 2 , = ( δ 1 2 + δ 1 δ 2 + δ 2 2 ) 2 . f 2 + f + y = ( δ 1 2 y q + δ 2 2 y ) + ( δ 1 y + δ 2 y q ) + y , = ( δ 2 2 + δ 1 + 1 ) y + ( δ 1 2 + δ 2 ) y q . ( f 2 + f + y ) q + 1 = { ( δ 2 2 + δ 1 + 1 ) y + ( δ 1 2 + δ 2 ) y q } q + 1 , = { ( δ 2 2 + δ 1 + 1 ) y q + ( δ 1 2 + δ 2 ) y } { ( δ 2 2 + δ 1 + 1 ) y + ( δ 1 2 + δ 2 ) y q } , = ( δ 2 2 + δ 1 + 1 ) 2 y q + 1 + ( δ 1 2 + δ 2 ) ( δ 2 2 + δ 1 + 1 ) ( y + y q ) + ( δ 1 2 + δ 2 ) 2 y q + 1 } , = ( δ 1 2 + δ 2 2 + δ 1 + δ 2 + 1 ) 2 + ( δ 1 2 δ 2 2 + δ 1 3 + δ 2 3 + δ 1 δ 2 + δ 1 2 + δ 2 ) , = δ 1 4 + δ 1 2 δ 2 2 + δ 2 4 + δ 1 3 + δ 2 3 + δ 1 δ 2 + δ 2 2 + δ 2 + 1.
(3) Trace Expressed in Components of Torus
The value of the trace is calculated by use of the coefficients used in the affine expression. The definition equation of the trace expression Tr(g) for T4 is Tr(g)=g+gq+g^q2+g^q3 (corresponding to the equation (16)). The equation (93) indicates the calculation process.
Tr ( g ) = f + z f + z q 2 + f q + z q f q + z q 3 + f q 2 + f q 2 + z q 2 + f q 3 + z q 3 f q 3 + z q 3 , = f + z f + z q 2 + f q + z q f q + z q 3 + f + z q 3 f + z + f q + z q 3 f q + z q , = ( f + z ) 2 + ( f + z q 2 ) 2 ( f + z ) ( f + z q 2 ) + ( f q + z q ) 2 + ( f q + z q 3 ) 2 ( f q + z q 3 ) ( f q + z q ) , = 2 f 2 + 2 f ( z + z q 2 ) + z 2 + z 2 q 2 f 2 + f ( z + z q 2 ) + z q 2 + 1 + 2 f 2 q + 2 f 2 q ( z q + z q 3 ) + z 2 q + z 2 q 3 f 2 q + f q ( z q + z q 3 ) + z q + q 3 , = z 2 + z 2 q 2 f 2 + f ( z + z q 3 ) + ( z q 2 + 1 ) + z 2 q + z 2 q 3 f 2 q + f q ( z q + z q 3 ) + z q + q 3 , = 1 f 2 + f + y + 1 f 2 q + f q + y q , = f 2 + f 2 q + f + f q + y + y q ( f 2 + f + y ) ( f 2 q + f q + y q ) , = ( δ 1 2 + δ 2 2 ) ( y + y q ) + ( δ 1 + δ 2 ) ( y + y q ) + ( y + y q ) ( f 2 + f + y ) q + 1 , = δ 1 2 + δ 2 2 + δ 1 + δ 2 + 1 δ 1 4 + δ 1 2 δ 2 2 + δ 2 4 + δ 1 3 + δ 2 3 + δ 1 δ 2 + δ 2 2 + δ 2 + 1 ( 93 )
(4) Condition for G
The condition for gq+1=gt, which is the condition for G_, is derived here. The deformed equation expressed in the equation (94) is obtained.
{ f + z f + z q 2 } q + 1 = { f + z f + z q 2 } t , -> ( f + z ) q + 1 ( f + z q 2 ) t = ( f + z ) t ( f + z q 2 ) q + 1 , -> ( f + z ) ( f + z ) q ( f + z q 2 ) t = ( f + z ) t ( f + z q 2 ) q ( f + z q 2 ) , -> f q + t + 1 + f q + t z + f q + 1 z tq 2 + f t + 1 z q + f q z tq 2 + 1 + f t z q + 1 + fz q + tq 2 + z q + tq 2 + 1 = f q + t + 1 + f q + t z q 2 + f q + 1 z t + f t + 1 z q 3 + f q z t + q 2 + f t z q 3 + q 2 + fz q 3 + t + z q + tq 2 + 1 , -> f q + t ( z + z q 2 ) + f q + 1 ( z tq 2 + z t ) + f t + 1 ( z q + z q 3 ) + f q ( z tq 2 + 1 + z t + q 2 ) + f t ( z q + 1 + z q 3 + q 2 ) + f ( z q + tq 2 + z q 3 + t ) + ( z q + tq 2 + 1 + z q 3 + q 2 + t ) = 0 ( 94 )
In the following, t≡q (mod 5) ≡2 (mod 5) is assumed. In this case, t is based on the condition of t=24k+1(kεZ (set of integers)) and is not incompatible with the above hypothesis. It can be also configured with other parameter. The deformed equation expressed in the equation (95) is possible from the equation (94).
f q+t(z+z q 2 )+f q+1(z q 3 +z q)+f t+1(z q +z q 3 )+f q(z q 3 +1 +z q+q 2 )+ft(z q+1 +z q 3 +q 2 )+f(z q+q 3 +z q 3 +q)+(z q+q 3 +1 +z q 3 +q 2 +q)=0,
f q+t +f q+1 +f t+1 +f q y+f t y q+(1+x q+1+x q 3 )=0,
f q+t +f q+1 +f t+1 +f q y+f t y q +y q=0  (95)
f=δ1y2y q is substituted and arranged. First, as expressed in the equation (96), the relational equations used for deforming the equations are collectively calculated.
f q + t = ( δ 1 y q + δ 2 y ) ( δ 1 t y q + δ 2 t y ) , = δ 1 t + 1 y 2 q + δ t + 1 y 2 + ( δ 1 t δ 2 + δ 1 δ 2 t ) y q + 1 , = δ 1 t + 1 y + δ 2 t + 1 y q + δ 1 t δ 2 + δ 1 δ 2 t . ( 96 ) f q + 1 = δ 1 2 + δ 1 δ 2 + δ 2 2 · ( described above ) f t + 1 = ( δ 1 t y q + δ 2 t y ) ( δ 1 y + δ 2 y q ) , = δ 1 t + 1 y q + 1 + δ t + 1 y q + 1 + δ 1 t δ 2 y 2 q + δ 1 δ 2 t y 2 , = δ 1 t + 1 + δ 2 t + 1 + δ 1 t δ 2 y + δ 1 δ 2 t y q . f q y = δ 1 y q + 1 + δ 2 y 2 = δ 1 + δ 2 y q . f t y q = δ 1 t y 2 q + δ 2 t y q + 1 = δ 1 t y + δ 2 t .
The conditional equations for G_ are rearranged with the above equations to be written in the equation (97).
f q+t +f q+1 +f t+1 +f q y+f t y q +y q=0,
→(δ1 t+1 y+δ 2 t+1 y q1 tδ21δ2 t)+(δ1 21δ22 2)+δ1 t+12 t+11 tδ2 y+δ 1δ2 t y q)+(δ12 y q)+(δ1 t y+δ 2 t)+y q=0,
→(δ2 t+11δ2 t1 t)y+(δ1 t+11 tδ22+1)y q+(δ1 21δ22 212 t)=0  (97)
From the above, the condition for fεG_ is expressed in the equation (98).
y:δ 2 t+11δ2 t1 t+(δ1 21δ22 212 t)=0,
y q1 t+11 tδ22+1+(δ1 21δ22 212 t)=0  (98)
The conditional equations are additionally arranged to obtain the equation (99).
δ1 t+11δ2 t1 t2 t+11 tδ22+1=0,
→δ1 t+12 t+11 tδ21δ2 t1 t2+1=0,
→(δ12)t+11 t2+1=0.  (99)
At least the equation (99) has to be met for the elements of G_.
(5) Change by q-th Power
Since the definition equation of the trace expression Tr(g) for T4 is Tr(g)=g+gq+g^q2+g^q3, the relational equations Tr(gq)=gq+g^q2+g^q3+g, Tr(g^q2)=g^q2+g^q3+g+gq and Tr(g^q3)=g^q3+g+gq+g^q2 are established. In other words, the trace of the element which is obtained by raising the element g of a torus to the q-th power has the same value of the original trace. Since it is clear that even the element of the torus belonging to G_ is raised to the q-th power, the resultant has the same value as the element of G_, the property should be maintained even when a conditional equation is raised to the q-th power. A change, which occurs to the coefficient when the element of the torus is raised to the q-th power, is observed and the change is applied to the following deformed equations.
{ f + z f + z q 2 } q = f q + z q f q + z q 3 , = δ 1 y q + δ 2 y + ( x q + x q 2 ) δ 1 y q + δ 2 y + ( x q 3 + x ) , = δ 1 y q + ( δ 2 + 1 ) ( x + x q 2 ) + ( x + x q ) δ 1 y q + ( δ 2 + 1 ) ( x + x q 2 ) + ( x q 2 + x q 3 ) , = ( δ 2 + 1 ) y + δ 1 y q + z ( δ 2 + 1 ) y + δ 1 y q + z q 2 ( 100 )
Since the equations can be deformed as expressed in the equation (100), it can be seen that the coefficient changes as (δ1, δ2)→(δ2+1, δ1) in consideration of f=δ1y2y q. The change causes a change neither in the conditional equation for G_ nor in the transformed equation from the torus to the trace. Actually, the change is applied to the conditional equation for G_ to be the original equation, and thus the conditional equation for G_ does not change due to the change. In the following, the relationship between the equations, which are obtained by changing the coefficient due to the q-th power, is called q-th power symmetric relationship.
(6) Decompression from Trace to Torus
There will be attempted to derive the transformed equation from the trace to the torus by use of the transformed equation from the torus to the trace and the conditional equation for G_.
(6.1) Preparation
In the following, necessary relational equations are derived before transforming the trace to the torus. There is attempted to create the relational equation between δ1 22 and δ12 2 from the equation (99), which is the conditional equation for G_. The conditional equation for G_ is arranged to be (δ12)t+1=δ1t2+1. The arranged conditional equation is raised to the (t−1)-th power in consideration of t2=2 to obtain the equation (101).
12)=(δ1 t2+1)t−1,
→(δ12)(δ1 t2+1)=(δ1 t2+1)t,
→(δ12)(δ1 t2+1)=δ1 22 t+1  (101)
The equation (101) is not q-th power symmetrical. Since the relationship needs to be maintained even when the coefficient is changed as (δ1, δ2)→(δ2+1, δ1) in order to meet the q-th power symmetry, the equation (102) obtained by making the equation (101) q-th power symmetric should be met simultaneously.
12+1)(δ12 t)=δ1 t2 2  (102)
On the other hand, the equation (101) is added with δ11 2 and then multiplied by (δ12+1) to obtain the equation (103).
12)(δ1 t2+1)=δ1 22 t+1,
→δ12 t1 t12)+δ1δ22 2121 21+1,
→δ12 t1 t12)+δ1δ22 221 2+1,
→(δ12 t)(δ12+1)={δ1 t12)+δ1δ22 221 2+1}(δ12+1),
→(δ12 t)(δ12+1)=δ1 t12)21 t12)+(δ12+1)2δ2+(δ1 2+1)(δ12+1),
→(δ12 t)(δ12+1)=δ1 t1 22 212)+δ1 32 31 21+1=0  (103)
The equation (102) is substituted into the left side of the equation (103) to obtain the equation (104).
→δ1 t2 21 t1 22 212)+δ1 32 31 21+1,
→δ1 t1 22 212+1)+δ1 32 31 22 21+1=0  (104)
The equation is changed in the coefficient as (δ1, δ2)→(δ2+1, δ1) in consideration of the q-th power symmetric relationship to obtain the equation (105).
δ1 t1 22 212+1)+δ1 32 31 22 21+1=0,
→(δ2 t+1)(δ1 22 212+1)+(δ2+1)31 3+(δ2+1)21 2+(δ2+1)+1=0,
→δ2 t1 22 212+1)+(δ1 22 212+1)+(δ2 32 22+1)+δ1 3+(δ2 2+1)+δ1 2+(δ2+1)+1=0,
→δ2 t1 22 212+1)+δ1 32 32 212+1=0  (105)
The two equations (the equations (104) and (105)) are added to be the equation (106), and consequently the equation (107) is obtained.
1 t2 t)(δ1 22 212+1)+δ1 22=0  (106)
δ1 22=(δ1 t2 t)(δ1 22 212+1)  (107)
The equation is changed in the coefficient as (δ1, δ2)→(δ2+1, δ1) in consideration of the q-th power symmetry to obtain the equation (108) and consequently the relational equation between δ1 22 and δ12 2 is obtained.
δ12 2+1=(δ1 t2 t+1)(δ1 22 212+1),
δ12 2=(δ1 t2 t+1)(δ1 22 212+1)+1  (108)
(6.2) Deformation of Trace Equation
The trace equation is expressed with δ1 and δ2 to obtain the equation (109).
Tr ( g ) = δ 1 2 + δ 2 2 + δ 1 + δ 2 + 1 δ 1 4 + δ 1 2 δ 2 2 + δ 2 4 + δ 1 3 + δ 2 3 + δ 1 δ 2 + δ 2 2 + δ 2 + 1 ( 109 )
The equation is a little arranged to obtain the equation (110).
1 41 2δ2 22 41 32 31δ22 22+1){Tr(g)}=(δ1 22 212+1),
→δ1 41 2δ2 22 41 32 31δ22 22+1=(δ1 22 212+1){Tr(g)}−1  (110)
The equation (110) is deformed by use of δ1 2δ2 22 32 21 22) and δ1 31δ211 22) to obtain the equation (111).
δ1 41 2δ2 22 41 32 31δ22 22+1=(δ1 22 212+1){Tr(g)}−1,
→(δ1 42 4)+(δ2 21)(δ1 22)+(δ2 21 2)+(δ1 22)+1=(δ1 22 212+1){Tr(g)}−1,
→(δ12)4+(δ12)2+1+(δ1 22)(δ2 21+1)=(δ1 22 212+1){Tr(g)}−1  (111)
The equations (107) and (108) are substituted into the equation (111) to be the equation (112), and consequently a quadric equation with two unknowns is obtained.
12)4+(δ12)2+1+(δ1 22)(δ2 21+1)=(δ1 22 212+1){Tr(g)}−1,
→(δ12)4+(δ12)2+1+(δ1 t2 t)(δ1 t2 t+1)(δ1 22 212+1)2=(δ1 22 212+1){Tr(g)}−1,
→(δ1 22 212+1)2+(δ1 t2 t)(δ1 t2 t+1)(δ1 22 212+1)2=(δ1 22 212+1){Tr(g)}−1,
→(δ1 22 212+1)+(δ1 t2 t)(δ1 t2 t+1)(δ1 22 212+1)={Tr(g)}−1,
→(δ1 22 212+1){(δ1 t2 t)(δ1 t2 t+1)+1}={Tr(g)}−1,
→(δ1 22 212+1)[{(δ12)(δ12+1)}t+1]={Tr(g)}−1,
→(δ1 22 212+1){(δ1 22 212)t+1}={Tr(g)}−1,
→(δ1 22 212+1)(δ1 22 212+1)t ={Tr(g)}−1,
→(δ1 22 212+1)t+1 ={Tr(g)}−1,
→δ1 22 212+1=[{Tr(g)}−1]t−1,
→δ1 22 212+1={Tr(g)}1−t,
→δ1 22 212+1={Tr(g)}q−t  (112)
With δ12=X, the equation (112) is replaced with the quadric equation with one unknown in the equation (113).
X 2 +X+1={Tr(g)}q−t  (113)
Although the formula for solving the quadric equation with two unknowns is not present, the field is specifically configured to find the solutions. If X is specifically found, the left side of the equation (107) can be replaced with δ1 22=(X−δ2)222 22+X2 so that the equation (114) is solved for δ2 to find δ1 and δ2.
δ2 22 =X 2+(X 2 +X+1)X t(=X 2 +{Tr(g)}q−t X t)  (114)
Since the equations (113) and (114) each have two solutions, 2×2=4 solutions should be found. The four solutions are obtained from the same trace value and the additional bit is used for specifying which solution of the four solutions expresses the element of the original torus.
The four solutions are in the q-th power symmetric relationship. In other words, the relationship of (δ1, δ2)→(δ2+1, δ1)→(δ1+1, δ2+1)→(δ2+1, δ1)(→(δ1, δ2)) is obtained. The arrow goes to the right each time the q-th power is raised and returns to the origin with the q4-th power. From the relationship, for example, when the least significant bits for δ1, δ2 for a solution are paid attention, in the q-th power symmetric relationship in the case of (0, 0), the relationship of (0, 0)→(0, 1)→(1, 1)→(1, 0)(→(0, 0)) is obtained and each should be raised to the first power, the q-th power, q2-th power and q3-th power. Therefore, if the least significant bits for δ1, δ2 are employed as the additional bits, the element of the original correct torus can be specified from the element of the trace.
(6.3) Exemplary Specific Structure
The method for transforming the affine expression of the torus into the trace and the method for transforming the trace into the affine expression of the torus will be briefly described by way of example.
(From Torus to Trace)
    • Input: (δ1, δ2)
    • Output: Tr(g), (b0, b1) (b0, b1 are additional bits)
1. Tr(g) is found from the equation (109).
2. b0 is assumed as the least significant bit of δ1 and b1 is assumed as the least significant bit of δ2 to output Tr(g), (b0, b1).
(From Trace to Torus)
    • Input: Tr(g), (b0, b1)
    • Output: (δ1, δ2)
1. X2+X+1={Tr(g)}q−t is solved to find X0 and X1.
2. δ2 22+X0 2+X0 t{Tr(g)}q−t=0 is solved to find δ2a and δ2b.
3. δ1a is found from X01a2a.
4. The least significant bit of (δ1a, δ2a) is compared with (b0, b1), and when they are not coincident with each other, the procedure proceeds to 5, and when they are coincident, the procedure proceeds to 6.
5. The equation is reset to (δ1a, δ2a)=(δ2a+1, δ1a) and the procedure returns to 4.
6. (δ1, δ2)=(δ1a, δ2a) is assumed and (δ1, δ2) is output.
(7) Summary
The specific method for recovering the element of the T4 torus from the element of the trace by adding the additional bit has been described above. The expression can be compressed only to ⅓ relative to the size of the finite field in the conventional torus, but the expression can be gradually compressed to ¼ with the embodiments.
As described above, according to the first to fourth embodiments, the compressing apparatus and the decompressing apparatus can be efficiently realized for the modulus polynomials which cannot efficiently configure the decompressed map in the conventional method.
A hardware structure of the decompressing apparatus and the compressing apparatus according to the first to fourth embodiments will be described below with reference to FIG. 10. FIG. 10 is an explanatory diagram illustrating a hardware structure of the decompressing apparatus and the compressing apparatus according to the first to fourth embodiments.
The decompressing apparatus and the compressing apparatus according to the first to fourth embodiments comprise a control device such as a CPU (Central Processing Unit) 51, storage devices such as ROM (Read Only Memory) 52 and RAM (Random Access Memory) 53, a communication I/F 54 connected to a network for making communication, and a bus 61 for interconnecting the respective units.
The programs to be executed by the decompressing apparatus and the compressing apparatus according to the first to fourth embodiments are previously incorporated in the ROM 52 or the like to be provided.
The programs to be executed by the decompressing apparatus and the compressing apparatus according to the first to fourth embodiments may be recorded in a computer-readable recording medium such as CD-ROM (Compact Disk Read Only Memory), flexible disk (FD), CD-R (Compact Disk Recordable) or DVD (Digital Versatile Disk) in an installable form or executable form to be provided as a computer program product.
The programs to be executed by the decompressing apparatus and the compressing apparatus according to the first to fourth embodiments may be stored on a computer connected to a network such as the Internet and may be downloaded via the network to be provided. The programs to be executed by the decompressing apparatus and the compressing apparatus according to the first to fourth embodiments may be provided or distributed via the network such as Internet.
The programs to be executed by the decompressing apparatus and the compressing apparatus according to the first to fourth embodiments can cause a computer to function as each unit in the decompressing apparatus and the compressing apparatus. The computer may read and execute a program from a computer-readable recording medium on a min storage device.
While certain embodiments have been described, these embodiments have been presented by way of example only, and are not intended to limit the scope of the inventions. Indeed, the novel embodiments described herein may be embodied in a variety of other forms; furthermore, various omissions, substitutions and changes in the form of the embodiments described herein may be made without departing from the spirit of the inventions. The accompanying claims and their equivalents are intended to cover such forms or modifications as would fall within the scope and spirit of the inventions.

Claims (5)

What is claimed is:
1. A decompressing apparatus comprising:
an input microprocessor that inputs trace expression data, in which an element in a subgroup of a multiplicative group of a finite field is trace-expressed, and additional data, the additional data being obtained based on the trace expression data and affine expression data in which the trace expression data is affine-expressed;
a calculating microprocessor that calculates a plurality of solutions of simultaneous equations derived by the trace expression data;
a first selecting microprocessor that selects any of a plurality of items of affine expression data in which the element is affine-expressed based on the additional data, the affine expression data being found from the solutions; and
a decompressing microprocessor that decompresses the selected affine expression data to the element, wherein
the calculating microprocessor comprises:
a first solution finding microprocessor that finds solutions of a first equation obtained by inputting the trace expression data into a preset coefficient of a previously-found k1th-degree equation (k1 is a preset integer of 1 or more) over the finite field; and
a second solution finding microprocessor that finds solutions of a second equation obtained by inputting at least one of the solutions of the first equation into a preset coefficient of a previously-found k2th-degree equation (k2 is a preset integer of 1 or more) over the finite field, and
the calculating microprocessor calculates a plurality of solutions of the simultaneous equations based on the solutions of the second equation.
2. The apparatus according to claim 1, wherein the first solution finding microprocessor finds two solutions of the first equation obtained by inputting the trace expression data into a preset coefficient in a previously-found quadric equation over the finite field,
the second solution finding microprocessor finds three solutions of the second equation obtained by inputting at least one of the two solutions into a preset coefficient of a previously-found cubic equation over the finite field,
the calculating microprocessor further comprises a third solution finding unit that finds solutions of a third equation obtained by inputting at least one of the two solutions of the first equation and the three solutions of the second equation into a preset coefficient of a previously-found linear equation over the finite field, and
the calculating microprocessor calculates a plurality of solutions of the simultaneous equations based on the solutions of the second equation and the solutions of the third equation.
3. The apparatus according to claim 1, wherein the calculating microprocessor comprises a second selecting microprocessor that selects any of the solutions of the first equation based on the additional data, and
the second solution finding microprocessor finds solutions of the second equation obtained by inputting a solution selected by the second selecting microprocessor into a preset coefficient of the k2th-degree equation.
4. A compressing apparatus comprising:
a first transforming microprocessor that transforms an element in a subgroup of a multiplicative group of a finite field into trace expression data in which the element is trace-expressed;
a second transforming microprocessor that transforms the element into affine expression data in which the element is affine-expressed;
a deciding microprocessor that decides additional data for finding the affine expression data based on the affine expression data;
an output microprocessor that outputs the trace expression data and the additional data; and
a calculating microprocessor that finds solutions of a first equation obtained by inputting the trace expression data into a preset coefficient of a previously-found k1th-degree equation (k1 is a preset integer of 1 or more) over the finite field, finds solutions of a second equation obtained by inputting at least one of the solutions of the first equation into a preset coefficient of a previously-found k2th-degree equation (k2 is a preset integer of 1 or more) over the finite field, and calculates a plurality of solutions of the simultaneous equations based on the solutions of the second equation,
wherein the deciding microprocessor decides, as the additional data, the order of a solution coincident with the sum of elements of the affine expression data from a head when the solutions of the first equation are arranged in a preset rule, and the order of a solution coincident with the affine expression data from the head when the solutions of the simultaneous equations are arranged in the rule.
5. A program product having a non-transitory computer readable medium including programmed instructions, wherein the instructions, when executed by a computer, cause the computer to perform:
inputting trace expression data, the trace expression data including an element in a subgroup of a multiplicative group of a finite field that is trace-expressed, and additional data, the additional data being obtained based on the trace expression data and affine expression data in which the trace expression data is affine-expressed;
calculating a plurality of solutions of simultaneous equations derived by the trace expression data;
selecting any of a plurality of items of affine expression data in which the element is affine-expressed based on the additional data, the affine expression data being found from the solutions; and
decompressing the selected affine expression data to the element, wherein
the calculating includes
finding solutions of a first equation obtained by inputting the trace expression data into a preset coefficient of a previously-found k1th-degree equation (k1 is a preset integer of 1 or more) over the finite field; and
finding solutions of a second equation obtained by inputting at least one of the solutions of the first equation into a preset coefficient of a previously-found k2th-degree equation (k2 is a preset integer of 1 or more) over the finite field, and
calculating a plurality of solutions of the simultaneous equations based on the solutions of the second equation.
US13/225,964 2010-12-09 2011-09-06 Decompressing apparatus and compressing apparatus Expired - Fee Related US8934631B2 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
JP2010-275160 2010-12-09
JP2010275160A JP5178810B2 (en) 2010-12-09 2010-12-09 Extension device and compression device

Publications (2)

Publication Number Publication Date
US20120150931A1 US20120150931A1 (en) 2012-06-14
US8934631B2 true US8934631B2 (en) 2015-01-13

Family

ID=46200464

Family Applications (1)

Application Number Title Priority Date Filing Date
US13/225,964 Expired - Fee Related US8934631B2 (en) 2010-12-09 2011-09-06 Decompressing apparatus and compressing apparatus

Country Status (2)

Country Link
US (1) US8934631B2 (en)
JP (1) JP5178810B2 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140270159A1 (en) * 2013-03-18 2014-09-18 Electronics And Telecommunications Research Institute System and method for providing compressed encryption and decryption in homomorphic encryption based on integers

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP5554357B2 (en) 2012-03-15 2014-07-23 株式会社東芝 Arithmetic unit

Citations (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090207999A1 (en) 2008-02-18 2009-08-20 Kabushiki Kaisha Toshiba Decryption processing apparatus, system, method, and computer program product
US20100046743A1 (en) * 2008-08-25 2010-02-25 Kabushiki Kaisha Toshiba Apparatus for performing data compression processing using algebraic torus
US20100049777A1 (en) 2008-08-25 2010-02-25 Kabushiki Kaisha Toshiba Representation converting apparatus, arithmetic apparatus, representation converting method, and computer program product
US20100046746A1 (en) * 2008-08-25 2010-02-25 Kabushiki Kaisha Toshiba Parameter generating device and cryptographic processing system
US20100046745A1 (en) 2008-08-25 2010-02-25 Kabushiki Kaisha Toshiba Encrypting apparatus, decrypting apparatus, cryptocommunication system, and methods and computer program products therefor
US20100046742A1 (en) * 2008-08-25 2010-02-25 Kabushiki Kaisha Toshiba Apparatus and computer program product for performing data compression processing using algebraic torus
US20100046741A1 (en) * 2008-08-25 2010-02-25 Kabushiki Kaisha Toshiba Apparatus, method, and computer program product for decrypting, and apparatus, method, and computer program product for encrypting
US20100063986A1 (en) 2008-09-10 2010-03-11 Kabushiki Kaisha Toshiba Computing device, method, and computer program product
US20100226496A1 (en) * 2009-03-04 2010-09-09 Koichiro Akiyama Encryption apparatus, decryption apparatus, key generation apparatus, and storage medium
WO2010145983A1 (en) 2009-06-16 2010-12-23 Thomson Licensing A method and a device for performing torus-based cryptography
WO2011010383A1 (en) 2009-07-23 2011-01-27 株式会社東芝 Arithmetic device
WO2011030468A1 (en) 2009-09-14 2011-03-17 株式会社東芝 Arithmetic device
WO2011033672A1 (en) 2009-09-18 2011-03-24 株式会社東芝 Arithmetic apparatus, method and program
US20130246489A1 (en) * 2012-03-15 2013-09-19 Tomoko Yonemura Computing device

Patent Citations (21)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090207999A1 (en) 2008-02-18 2009-08-20 Kabushiki Kaisha Toshiba Decryption processing apparatus, system, method, and computer program product
US8233616B2 (en) * 2008-08-25 2012-07-31 Kabushiki Kaisha Toshiba Apparatus and computer program product for performing data compression processing using algebraic torus
US20100046743A1 (en) * 2008-08-25 2010-02-25 Kabushiki Kaisha Toshiba Apparatus for performing data compression processing using algebraic torus
US20100049777A1 (en) 2008-08-25 2010-02-25 Kabushiki Kaisha Toshiba Representation converting apparatus, arithmetic apparatus, representation converting method, and computer program product
US20100046746A1 (en) * 2008-08-25 2010-02-25 Kabushiki Kaisha Toshiba Parameter generating device and cryptographic processing system
US20100046745A1 (en) 2008-08-25 2010-02-25 Kabushiki Kaisha Toshiba Encrypting apparatus, decrypting apparatus, cryptocommunication system, and methods and computer program products therefor
US20100046742A1 (en) * 2008-08-25 2010-02-25 Kabushiki Kaisha Toshiba Apparatus and computer program product for performing data compression processing using algebraic torus
US20100046741A1 (en) * 2008-08-25 2010-02-25 Kabushiki Kaisha Toshiba Apparatus, method, and computer program product for decrypting, and apparatus, method, and computer program product for encrypting
US8675874B2 (en) * 2008-08-25 2014-03-18 Kabushiki Kaisha Toshiba Apparatus for performing data compression processing using algebraic torus
US8533243B2 (en) * 2008-08-25 2013-09-10 Kabushiki Kaisha Toshiba Representation converting apparatus, arithmetic apparatus, representation converting method, and computer program product
US8438205B2 (en) * 2008-09-10 2013-05-07 Kabushiki Kaisha Toshiba Exponentiation calculation apparatus and method for calculating square root in finite extension field
US8543630B2 (en) * 2008-09-10 2013-09-24 Kabushiki Kaisha Toshiba Exponentiation calculation apparatus and method for calculating square root in finite extension field
US20100063986A1 (en) 2008-09-10 2010-03-11 Kabushiki Kaisha Toshiba Computing device, method, and computer program product
US8311215B2 (en) * 2009-03-04 2012-11-13 Kabushiki Kaisha Toshiba Encryption apparatus, decryption apparatus, key generation apparatus, and storage medium
US20100226496A1 (en) * 2009-03-04 2010-09-09 Koichiro Akiyama Encryption apparatus, decryption apparatus, key generation apparatus, and storage medium
WO2010145983A1 (en) 2009-06-16 2010-12-23 Thomson Licensing A method and a device for performing torus-based cryptography
US8548162B2 (en) * 2009-06-16 2013-10-01 Thomson Licensing Method and a device for performing torus-based cryptography
WO2011010383A1 (en) 2009-07-23 2011-01-27 株式会社東芝 Arithmetic device
WO2011030468A1 (en) 2009-09-14 2011-03-17 株式会社東芝 Arithmetic device
WO2011033672A1 (en) 2009-09-18 2011-03-24 株式会社東芝 Arithmetic apparatus, method and program
US20130246489A1 (en) * 2012-03-15 2013-09-19 Tomoko Yonemura Computing device

Non-Patent Citations (5)

* Cited by examiner, † Cited by third party
Title
K. Rubin and A. Silverberg, compression in finite fileds and torus-based cryptography, 2000, Mathematic subject classification, p. 1-28. *
Karl Rubin, et al., "Torus-Based Cryptography," CRYPTO 2003, LNCS 2729, 2003, 17 pages.
Koray Karabina, "Torus-Based Compression by Factor 4 and 6," Cryptology ePrint Archive, Report 2010/525, 20 pages.
Marc Joye, On Cryptographic Schemes Based on Discrete Logarithms and Factoring, Lecture Notes in Computer Science, 2009, vol. 5888, pp. 41-52 with cover page.
Office Action issued Oct. 2, 2012 in Japanese Patent Application No. 2010-275160 with English language translation.

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140270159A1 (en) * 2013-03-18 2014-09-18 Electronics And Telecommunications Research Institute System and method for providing compressed encryption and decryption in homomorphic encryption based on integers
US9374220B2 (en) * 2013-03-18 2016-06-21 Electronics And Telecommunications Research Institute System and method for providing compressed encryption and decryption in homomorphic encryption based on integers

Also Published As

Publication number Publication date
JP2012123277A (en) 2012-06-28
US20120150931A1 (en) 2012-06-14
JP5178810B2 (en) 2013-04-10

Similar Documents

Publication Publication Date Title
Liang et al. Sz3: A modular framework for composing prediction-based error-bounded lossy compressors
Bodmann Optimal linear transmission by loss-insensitive packet encoding
US8756410B2 (en) Polynomial evaluation delegation
US11962805B2 (en) Data processing apparatuses, methods, computer programs and computer-readable media
US10382789B2 (en) Systems and methods for digital media compression and recompression
Van de Vyver A phase-fitted and amplification-fitted explicit two-step hybrid method for second-order periodic initial value problems
WO2018135563A1 (en) Secure computing system, secure computing device, secure computing method, and program
Jeronimo et al. On the minimum of a polynomial function on a basic closed semialgebraic set and applications
US8934631B2 (en) Decompressing apparatus and compressing apparatus
JP2010049213A (en) Encrypting device, decrypting device, cipher communication system, method and program
JP2017055269A (en) Information processing apparatus and information processing system
Shamir Universal source coding for monotonic and fast decaying monotonic distributions
JP6532843B2 (en) Secret calculation system, first secret calculation device, second secret calculation device, secret circuit generation method, secret circuit evaluation method, program
Bollauf et al. On the communication cost of determining an approximate nearest lattice point
US8233616B2 (en) Apparatus and computer program product for performing data compression processing using algebraic torus
US8675874B2 (en) Apparatus for performing data compression processing using algebraic torus
Blanes et al. Redundancy and optimization of tANS entropy encoders
Köppe et al. Intermediate integer programming representations using value disjunctions
JP2017055270A (en) Information processing apparatus and information processing system
JP5554357B2 (en) Arithmetic unit
Eick et al. The isomorphism problem for torsion free nilpotent groups of Hirsch length at most 5
JP7345831B2 (en) Information processing device, information processing method and program
Hendrix et al. Bounded integer linear constraint solving via lattice search
Morris et al. A multilevel approach to solving the Black–Scholes equation
SANDHU LOSSLESS DATA COMPRESSION: AN OVERVIEW

Legal Events

Date Code Title Description
AS Assignment

Owner name: KABUSHIKI KAISHA TOSHIBA, JAPAN

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:HANATANI, YOSHIKAZU;ISOGAI, TAICHI;MURATANI, HIROFUMI;AND OTHERS;SIGNING DATES FROM 20110930 TO 20111031;REEL/FRAME:027235/0108

FEPP Fee payment procedure

Free format text: PAYOR NUMBER ASSIGNED (ORIGINAL EVENT CODE: ASPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

FEPP Fee payment procedure

Free format text: MAINTENANCE FEE REMINDER MAILED (ORIGINAL EVENT CODE: REM.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

LAPS Lapse for failure to pay maintenance fees

Free format text: PATENT EXPIRED FOR FAILURE TO PAY MAINTENANCE FEES (ORIGINAL EVENT CODE: EXP.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

STCH Information on status: patent discontinuation

Free format text: PATENT EXPIRED DUE TO NONPAYMENT OF MAINTENANCE FEES UNDER 37 CFR 1.362

FP Lapsed due to failure to pay maintenance fee

Effective date: 20190113