An Improved Identity-Based Fully Homomorphic Encryption Method on Lattice
A technology of fully homomorphic encryption and encryption scheme, applied in the field of information security, can solve the problems of long running time, inefficient trapdoor generation process, and high algorithm complexity, achieving high security, short public and private key sizes, and high difficulty in solving sexual effect
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0019] The present invention will be further described below in conjunction with embodiment and accompanying drawing.
[0020] The basic parameters of the present invention include a disclosed uniform random matrix and its trapdoor where n is a security parameter, m=O(nlogq), w=nk, modulus q = q(n); a matrix whose construction is public where I n is the n×n identity matrix, FRD encoding function Let L be the maximum circuit depth that can be operated homomorphically in this scheme, and the modulus q=q(n,L), so that N=(m+1)l, to any Dimensional vector a, b, BitDecomp(a) represents N-dimensional vector where a i,j means a i The jth binary bit of the component, Represents the inverse operation of BitDecomp, Flatten(a)=BitDecomp(BitDecomp -1 (a)), And the following equations are established: =, =-1 (a), b>=.
[0021] The algorithm flow designed by the present invention is specifically as follows, first construct an identity-based encryption scheme iIBE ...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


