Research Article
Blockchain-Based Secure Outsourcing of Polynomial Multiplication and Its Application in Fully Homomorphic Encryption
Algorithm 1
Fully homomorphic encryption using hidden ideal lattice.
| | Input:, , , , | | | Output:, | | (1) | function KEY GENERARTION | | (2) | generate a random vector satisfying | | (3) | generate t − 1 random vectors satisfying | | (4) | generate a random vector gt satisfying | | (5) | generate t − 1 random vectors satisfying | | (6) | generate a random vector rt satisfying | | (7) | | | (8) | for | | (9) | | | (10) | end for | | (11) | Get w satisfying = d mod f | | (12) | return | | (13) | end return | | (14) | function ENCRYPTION | | (15) | generate t − 1 random integer vectors satisfying | | (16) | generate a random vector satisfying | | (17) | generate a random vector satisfying | | (18) | | | (19) | return | | (20) | end function | | (21) | function DECRYPTION | | (22) | | | (23) | | | (24) | return plaintext | | (25) | end function |
|
