Hybrid Approach to Speed-Up the Privacy Preserving Kernel K-means Clustering and its Application in Social Distributed Environment

Application of Hybrid Encryption Algorithm in Hardware Encryption Interface Card

“…. , 7. e addition of formula (3) on GF (2 8 ) is defined as the addition of binary polynomials, and its coefficient modulus is 2. e multiplication on GF (2 8 ) is defined as the product module of binary polynomial is an irreducible binary polynomial of degree 8. Irreducible bivariate polynomials cannot be divided by any other bivariate polynomials except by 1 and itself.…”

“…e coefficients of the polynomials in the finite field GF (2 8 ) are taken from the polynomials of GF ( 2 ese states are filled with input data column by column. Some operations in Rijndael algorithm are performed on columns of States, and some are performed on rows.…”

“…After entering the 1990s, another algorithm derived from DES, triple DES (3DES), was used. Lekshmy and others said that the encryption and decryption time consumption of 3DES algorithm is large and can not well meet the rapidly growing demand for real-time information encryption [8]. In 2000, DES with an original design life of 10 years was successfully attacked after 23 years of use.…”

“…{ }, and the multiplication and addition of coefficients are the operations in GF (2 8 ), which are recorded as d(x) � d 3 x 2 + d 1 x + d 0 , and the column blending transformation is HM(A) � MA. is "multiplication" is realized by logical operation between bytes.…”

“…erefore, multiplying a column by 1 means not to change the column, multiplying by 2 (binary 10) means to shift each byte to the left by one byte, and multiplying by 3 (binary 11) means to shift each byte to the left and add (XOR) 10001011 to the original unmodified value until the meaningful bits in the result do not exceed 8 bits, where a ij + k ij is the operation plus subkey in GF (2 8 ), which is the last step of a cycle. It is to add (XOR) the current result and a variant of the key.…”