Approximate computation homomorphic encryption method based on compression optimization

By introducing a compressed sequence encoding algorithm and redesigning the computation process in the CKKS-RNS scheme, the problems of insufficient memory and bandwidth are solved, achieving efficient compression of ciphertext and key, and improving the efficiency of homomorphic computation and parallel processing capabilities.

CN116961877BActive Publication Date: 2026-05-29NORTHWESTERN POLYTECHNICAL UNIV
View PDF 0 Cites 0 Cited by

Patent Information

Authority / Receiving Office
CN Β· China
Patent Type
Patents(China)
Current Assignee / Owner
NORTHWESTERN POLYTECHNICAL UNIV
Filing Date
2023-07-25
Publication Date
2026-05-29

AI Technical Summary

Technical Problem

Existing CKKS and CKKS-RNS schemes have limitations in memory capacity and bandwidth, which restricts the efficiency of homomorphic computation, especially in terms of key size and computer hardware resource requirements, making it difficult to meet the needs of practical applications.

Method used

Based on the CKKS-RNS scheme, a compressed sequence coding algorithm is introduced to compress the ciphertext and key, and the computation process of homomorphic addition and homomorphic multiplication is redesigned to reduce the number of bits in the ciphertext and key, reduce memory and bandwidth requirements, and maintain computational efficiency.

Benefits of technology

Through compression optimization, the ciphertext compression efficiency reached 54.8%, the homomorphic computation time increased by only 9.8%, and the parallel computation characteristics of the original scheme were inherited, significantly improving the computational efficiency.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure BDA0004357761180000036
    Figure BDA0004357761180000036
  • Figure BDA0004357761180000037
    Figure BDA0004357761180000037
  • Figure BDA0004357761180000038
    Figure BDA0004357761180000038
Patent Text Reader

Abstract

The application provides a kind of approximate calculation homomorphic encryption method based on compression optimization, on the basis of existing CKKS-RNS scheme, introduce compression sequence encoding algorithm to ciphertext and key compression, reduce the bit number of ciphertext and key, thereby reduce the demand of scheme to memory capacity and bandwidth;And the application redesigns the calculation process of homomorphic addition and homomorphic multiplication, can reduce the increment of homomorphic calculation time overhead as far as possible caused by introducing compression algorithm.In the application, when homomorphic encryption initial layer number L=35, the maximum length K=12 of grouping, the efficiency of ciphertext compression is 54.8%.And the results of the application show that the additional memory overhead in homomorphic calculation process does not exceed the size of input ciphertext, and the time required for homomorphic calculation is only increased by 9.8% compared with the original scheme.And the application inherits the characteristics of original CKKS-RNS scheme that can be calculated in parallel, and the efficiency of the scheme can be further greatly improved through parallel processing.
Need to check novelty before this filing date? Find Prior Art