Data converter for performing exponentiation in polynomial residue class ring with value in finite field as coefficient

Abstract

A data converter ( 1 ) capable of reducing a size of the total implementation in a device is a processing apparatus that performs secret converting processing predetermined to input data with 64 bits, the data converter including a finite field polynomial cubing unit ( 10 ), data integrating units ( 11 a) to ( 11 d), ( 12 ) and ( 13 ), a first converter ( 14 ), a second converter ( 15 ), a data splitting unit ( 16 ), and a data integrating unit ( 17 ). The finite field polynomial cubing unit ( 10 ) performs cubing, on the 32 bits data, in the polynomial residue class ring with a value in the finite field GF (2 8 ) as a coefficient and respectively outputs data with 32 bits.

1. A data converter comprising:
 a splittingan obtaining unit operable to split input data intoobtain a plurality of data blocks;  
 a conversion performing unit operable to perform conversion on each one of the plurality of data blocks, the conversion being based on an exponentiation to a predetermined exponent  in a polynomial residue class ring with a value in a finite field GF (2 n ) as a coefficient, the n being a natural number, as a coefficient;  and the exponentiation using a predetermined value as an exponent; and  
 an output data generating unit operable to generate output data based on the plurality of data blocks converted by the conversion performing unit,  
 wherein the predetermined exponent  value is a value that is 3 or larger and other than 2 m , the m being an integer which is 1 or larger.  
 
     
     
       2. The data converter according to  claim 1 , further comprising
 a finite field multiplying unit operable to perform multiplication in the finite field GF (2 n ),  
 wherein the conversion performing unit performs exponentiation using the finite field multiplying unit.  
 
     
     
       3. The data converter according to  claim 1 ,
 wherein the conversion performing unit includes:  
 an adding subunit operable to add, in the polynomial residue class ring, a predetermined constant and each one of the plurality of data blocks split by the splitting unit,  obtained by the obtaining unit, the predetermined constant being the same or variable depending on said each data block; and  
 a conversion performing subunit operable to perform conversion on said each one of the plurality of data blocks to which the constant is added by the adding subunit, the conversion being based on the exponentiation to the predetermined exponent  in the polynomial residue class ring.  
 
     
     
       4. The data converter according to  claim 1 ,
 wherein the output data generating unit includes:  
 an adding subunit operable to perform addition in the polynomial residue class ring among the plurality of data blocks converted by the conversion performing unit; and  
 a multiplying subunit operable to multiply, in the finite field GF (2 n ), a result of the addition by the adding subunit by a predetermined constant.  
 
     
     
       5. The data converter according to  claim 4 , further comprising
 a finite field multiplying unit operable to perform multiplication in the finite field GF (2 n ),  
 wherein the conversion performing unit performs exponentiation using the finite field multiplying unit, and  
 the multiplying subunit performs multiplication using the finite field multiplying unit.  
 
     
     
       6. A data conversion/method comprising:
 splitting input data intoobtaining a plurality of data blocks;  
 performing conversion on each one of the plurality of data blocks, the conversion being based on an exponentiation by a predetermined exponent  in a polynomial residue class ring with a value in a finite field GF (2 n ) as a coefficient, the n being a natural number, as a coefficient;  and the exponentiation using a predetermined value as an exponent; and  
 generating output data based on the plurality of data blocks converted by the conversion performance,  
 wherein the predetermined exponent  value is a value that is 3 or larger and except 2 m , the m being an integer which is 1 or larger.  
 
     
     
       7. The data conversion method according to  claim 6 ,
 wherein in the conversion performance, the exponentiation is performed using a finite field multiplying unit operable to perform multiplication in the finite field GF (2 n ).  
 
     
     
       8. The data conversion method according to  claim 6 ,
 wherein the conversion performance includes:  
 adding, in the polynomial residue class ring, a predetermined constant and each one of the plurality of split  data blocks, the predetermined constant being the same or variable depending on said each data block; and  
 performing conversion on said each one of the plurality of data blocks to which the constant is added by the addition, the conversion being based on an  the exponentiation to a predetermined exponent  in the polynomial residue class ring.  
 
     
     
       9. The data conversion method according to  claim 6 ,
 wherein the output data generation includes:  
 performing addition in the polynomial residue class ring among the plurality of data blocks converted by the conversion performance; and  
 multiplying, in the finite field GF (2 n ), a result of the addition by a predetermined constant.  
 
     
     
       10. The data conversion method according to  claim 9 ,
 wherein in the conversion performance, the exponentiation is performed using a finite field multiplying unit operable to perform multiplication in the finite field GF (2 n ); and  
 in the multiplication, the multiplication is performed using the finite field multiplying unit operable to perform multiplication in the finite field GF (2 n ).  
 
     
     
       11. An integrated circuit comprising:
 a finite field multiplying unit operable to perform multiplication in a finite field GF (2 n ), the n being a natural number;  
 an error-correction coding unit operable to perform error-correction coding on input data by performing multiplication in the finite field GF (2 n ) using the finite field multiplying unit;  
 a splitting unit operable to split the input data into a plurality of data blocks;  
 a conversion performing unit operable to perform conversion on each one of the plurality of data blocks, the conversion being based on an exponentiation to a predetermined exponent  in a polynomial residue class ring with a value in the finite field GF (2 n ) as a coefficient;  coefficient, and the exponentiation using a predetermined value as an exponent; and  
 generatingan output data generating unit operable to generate output data unit  based on the plurality of data blocks converted by the conversion performing unit,  
 wherein the predetermined exponent  value is a value that is 3 or larger and other than 2 m , the m being an integer that is 1 or larger.  
 
     
     
       12. The integrated circuit according to  claim 11 ,
 wherein the conversion performing unit includes:  
 an adding subunit operable to add, in the polynomial residue class ring, a predetermined constant and each one of the plurality of data blocks split by the splitting unit, the predetermined constant being the same or variable depending on said each data block; and  
 a conversion performing subunit operable to perform conversion, using the finite field multiplying unit, on said each one of the plurality of data blocks to which the constant is added by the adding subunit, the conversion being based on the exponentiation to a predetermined exponent  in the polynomial residue class ring.  
 
     
     
       13. The integrated circuit according to  claim 11 ,
 wherein the output data generating unit includes:  
 an adding subunit operable to perform addition in the polynomial residue class ring among the plurality of data blocks converted by the conversion performing unit; and  
 a multiplying subunit operable to multiply, in the finite field GF (2 n ), the result of the addition by the adding subunit by a predetermined constant using the finite field multiplying unit.  
 
     
     
       14. A program recorded on a computer readable medium that causes a computer to execute a method comprising:
 splitting input data intoobtaining a plurality of data blocks;  
 performing conversion on each one of the plurality of data blocks using a finite field multiplying unit operable to perform multiplication in a finite field GF (2 n ), the n being a natural number, the conversion being based on an exponentiation to a predetermined exponent  in a polynomial residue class ring with a value in the finite field GF (2 n ) as a coefficient;  coefficient, and the exponentiation using a predetermined value as an exponent; and  
 generating output data based on the plurality of data blocks converted by the conversion performance,  
 wherein the predetermined exponent  value is a value that is 3 or larger and other than 2 m , the m being an integer which is 1 or larger.  
 
     
     
       15. The program according to  claim 14 ,
 wherein the conversion performance includes:  
 adding, in the polynomial residue class ring, a predetermined constant and each one of the plurality of the split  data blocks, the predetermined constant being the same or variable depending on said each data block; and  
 performing conversion on said each one of the plurality of data blocks added by the addition using the finite field multiplying unit, the conversion being based on an  the exponentiation to a predetermined exponent  in the polynomial residue class ring.  
 
     
     
       16. The program according to  claim 14 ,
 wherein the output data generation includes:  
 performing addition in the polynomial residue class ring among the plurality of data blocks converted by the conversion performance; and  
 multiplying, in the finite field GF (2 n ), a result of the addition by a predetermined constant using the finite field multiplying unit.