Matrix fully homomorphic encryption method

Abstract

The invention discloses a matrix fully homomorphic encryption method. The matrix fully homomorphic encryption method comprises an initialization module, an encryption module, a decryption module and a matrix fully homomorphic module. The initialization module is used for generating secret keys needed by encryption and decryption according to dimensions of matrices to be encrypted, encryption types and ranges of matrix element values. The encryption module is used for utilizing encryption algorithms and the secret keys to conduct encryption on plaintext matrices and outputting ciphertext matrices according to the given plaintext matrices. The decryption module is used for utilizing the secret keys and decryption algorithms to conduct decryption on ciphertext matrices and outputting the plaintext matrices according to the given ciphertext matrices. According to the matrix fully homomorphic module, additive operation and multiplying operation of the matrices meet homomorphic properties of the matrices, output generated by the additive operation and the multiplying operation of the matrices still meets the homomorphic properties, namely, fully homomorphic properties of the matrices are met. The matrix fully homomorphic encryption method has the advantages of meeting safety requirements, meeting fully homomorphic requirements of the matrices and remarkably increasing the operating rate of the ciphertext matrices.

Description

technical field [0001] The invention relates to a homomorphic encryption algorithm, in particular to a matrix fully homomorphic encryption algorithm. Background technique [0002] The advantage of the openness of the Internet is that it facilitates our lives, but the biggest disadvantage is that the security of private information in the network is seriously threatened. Therefore, network security has attracted more and more attention in recent years. There are many security methods to protect private information, one of which is to encrypt information. At present, the commonly used methods are symmetric key encryption algorithm and public key encryption algorithm. For example, symmetric key encryption algorithms include DES, AES, etc. Key encryption algorithms include RSA, ECC, IBE, etc. The purpose of designing this type of algorithm is only to protect the security of information, that is, it only encrypts plaintext information, but ciphertext usually cannot be used for c...

AI Technical Summary

Problems solved by technology

In 2011, payman used a partial homomorphic encryption algorithm to encrypt matrix elements in the document "Efficient and Secure Delegation of Linear Algebra" to achieve matrix homomorphism. The disadvantage of this method is that it is not practical, that is, it is slow

The second is that only partial homomorphism can be achieved, that is, at most one multiplicative homomorphism

Images