Research on identitybased encryption algorithms on the ideal lattice
HUANG Wenjin, TANG Chunming, JIA Huiwen
Author information+
( a. School of Mathematics and Information Science; b. Guangzhou Center for Applied Mathematics; c. The Key Laboratory of Information Security Technology, Guangzhou 510006, China)
IdentityBased Encryption ( IBE) on lattices resists quantum attacks and effectively solves the problem of low efficiency of public key cryptography management systems, so scholars at home and abroad have proposed a series of latticebased identity encryption schemes. In this paper, the extrac tion of user private keys in the IBE scheme is improved by using the prototype sampling algorithm based on nonspherical Gaussian proposed by Jia, et al. Experimental results show that under the con dition of ensuring the correctness of IBE encryption and decryption, the size of the users private key can be effectively reduced and the space efficiency of the IBE scheme can be improved. The nonspherical Gaussianbased user private key extraction algorithm used in this article has two modes:① After adopting mode 1, the size of the users private key is reduced from 21 75 kB to 13 31 kB under the security of 42 6bit; under the security of 109 8bit, the size of the users private key is reduced from 50 36 kB to 32 25 kB; ② After adopting mode 2, under the security of 42 6bit, the size of the users private key is reduced from 21 75 kB to 10 18 kB; under the security of 109 8bit,the size of the users private key is reduced from 50 36 kB to 21 86 kB, which can more effectively save the memory overhead of the users private key than mode 1.