IP Library › Granted Patent US 12,432,043
Granted Patent B2
US 12,432,043 · App. 17/994,294 · Granted Sep 30, 2025

Homomorphic encryption apparatus and method

Inventors: Yongwoo Lee (Suwon-si, KR); Andrey Kim (Suwon-si, KR); Maksim Deriabin (Suwon-si, KR); Jieun Eom (Suwon-si, KR); Dong-Hoon Yoo (Suwon-si, KR); Rakyong Choi (Suwon-si, KR)
Assignee: Samsung Electronics Co., Ltd.
H04L9/008H04L9/0618
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,432,043
App. No.
17/994,294
Granted
Sep 30, 2025
Kind
B2
Abstract

A homomorphic encryption apparatus and method are disclosed. The homomorphic encryption apparatus includes one or more processors, and memory storing instructions configured to, when executed by the one or more processors, cause the one or more processors to receive a blind rotation key for performing a blind rotation operation and receive an operand ciphertext of the blind rotation operation, generate a first ciphertext by performing addition of a polynomial representation based on the blind rotation key and the operand ciphertext, and generate a target ciphertext by performing key switching and accumulative multiplication based on the first ciphertext.

Claims (68)

1. A homomorphic encryption operation apparatus comprising:

one or more processors; and

a receiver device and memory storing instructions configured to, when executed by the one or more processors, cause the one or more processors to:

receive, by the receiver device, a blind rotation key and an operand ciphertext;

generate a first ciphertext by performing addition of a polynomial representation based on the blind rotation key and the operand ciphertext; and

generate a target ciphertext by performing key switching and accumulative multiplication based on the first ciphertext,

wherein the key-switching is performed on the first ciphertext which is a temporary ciphertext such that an order of key-switching is changed so that a computational load and memory within the homomorphic encryption operation apparatus required in a blind rotation operation is reduced.

2. The homomorphic encryption operation apparatus of claim 1 ,

wherein a Hamming weight of a secret key is used to generate the blind rotation key.

3. The homomorphic encryption operation apparatus of claim 1 , wherein

the operand ciphertext is a learning with error (LWE) ciphertext, and

the target ciphertext is a ring learning with error (RLWE) ciphertext.

4. The homomorphic encryption operation apparatus of claim 1 , wherein the instructions are further configured to cause the one or more processors to:

generate the first ciphertext based on a variable of a polynomial representation constituting the blind rotation key and based on an index corresponding to an odd exponent of the variable.

5. The homomorphic encryption operation apparatus of claim 1 , wherein the instructions are further configured to cause the one or more processors to:

generate the target ciphertext in the form of an RLWE ciphertext by performing the accumulative multiplication between an RLWE ciphertext and a key-switched ciphertext, where the RLWE ciphertest is generated based on a secret key of the operand ciphertext.

6. The homomorphic encryption operation apparatus of claim 1 , wherein the instructions are further configured to cause the one or more processors to:

generate a key-switched ciphertext by performing the key switching on the first ciphertext; and

generate the target ciphertext by performing the accumulative multiplication based on the key-switched ciphertext.

7. The homomorphic encryption operation apparatus of claim 1 , wherein the instructions are further configured to cause the one or more processors to:

generate a first accumulative multiplication result by performing the accumulative multiplication based on the first ciphertext; and

generate the target ciphertext by performing the key switching on the first accumulative multiplication result.

8. The apparatus of claim 1 , wherein the key switching and the accumulative multiplication are performed simultaneously.

9. A homomorphic encryption operation apparatus comprising:

one or more processors; and

a receiver device and storage storing instructions configured to, when executed by the one or more processors, cause the one or more processors to:

receive, from the receiver device, a blind rotation key and an operand ciphertext;

extract a common variable based on the operand ciphertext and the blind rotation key; and

generate a target ciphertext by performing accumulative multiplication and key switching based on the common variable,

wherein the key-switching is performed on the accumulative multiplication where an order of key-switching is changed so that a computational load and memory within the homomorphic encryption operation apparatus required in a blind rotation operation is reduced.

10. The homomorphic encryption operation apparatus of claim 9 , wherein a Hamming weight of a secret key is used to generate the blind rotation key.

11. The homomorphic encryption operation apparatus of claim 9 , wherein

the operand ciphertext is a learning with error (LWE) ciphertext, and

the target ciphertext is a ring learning with error (RLWE) ciphertext.

12. The homomorphic encryption operation apparatus of claim 9 , wherein the instructions are further configured to cause the one or more processors to:

extract the common variable using some components of the blind rotation key.

13. The homomorphic encryption operation apparatus of claim 9 , wherein the instructions are further configured to cause the one or more processors to:

generate a second accumulative multiplication result by performing the accumulative multiplication based on the common variable;

generate a key-switched second accumulative multiplication result by performing the key switching on the second accumulative multiplication result; and

generate the target ciphertext by performing multiplication of the key-switched second accumulative multiplication result by some terms of polynomials constituting the blind rotation key.

14. The homomorphic encryption operation apparatus of claim 9 , wherein the instructions are further configured to cause the one or more processors to:

generate a third accumulative multiplication result by performing the accumulative multiplication based on the common variable;

generate a variable-changed multiplication result by changing a variable of a polynomial representation constituting the third accumulative multiplication result;

generate a key-switched multiplication result by performing the key switching on the variable-changed multiplication result; and

generate the target ciphertext by performing multiplication of the key-switched multiplication result by some terms of polynomials constituting the blind rotation key.

15. The homomorphic encryption operation apparatus of claim 9 , wherein the instructions are further configured to cause the one or more processors to:

generate a fourth accumulative multiplication result by performing the accumulative multiplication based on the common variable;

generate a multiplication result by performing multiplication of the fourth accumulative multiplication result by some terms of polynomials constituting the blind rotation key;

generate a variable-changed multiplication result by changing a variable of a polynomial representation constituting the multiplication result; and

generate the target ciphertext by performing the key switching on the variable-changed multiplication result.

16. The homomorphic encryption operation apparatus of claim 15 , wherein the instructions are further configured to cause the one or more processors to:

generate the fourth accumulative multiplication result by performing the accumulative multiplication of the common variable by an accumulative value corresponding to a variable corresponding to a power of 5 or −5 among variables of the blind rotation key.

17. The homomorphic encryption operation apparatus of claim 9 , wherein the instructions are further configured to cause the one or more processors to:

generate a first key switching result by performing first key switching based on the common variable; and

generate the target ciphertext by performing the accumulative multiplication and second key switching based on the first key switching result.

18. A homomorphic encryption operation method comprising:

receiving, from a receiver device connected to a homomorphic encryption operation apparatus, a blind rotation key and an operand ciphertext;

generating a first ciphertext by performing addition of a polynomial representation based on the blind rotation key and the operand ciphertext; and

generate a target ciphertext by performing key switching and accumulative multiplication based on the first ciphertext,

wherein the key-switching is performed on the first ciphertext which is a temporary ciphertext such that an order of key-switching is changed so that a computational load and memory within the homomorphic encryption operation apparatus required in a blind rotation operation is reduced.

19. The homomorphic encryption operation method of claim 18 , wherein the generating of the first ciphertext comprises:

generating the first ciphertext based on a variable of a polynomial representation constituting the blind rotation key and an index corresponding to an odd exponent of the variable.

20. The homomorphic encryption operation method of claim 18 , wherein the generating of the target ciphertext comprises:

generating a key-switched ciphertext by performing the key switching on the first ciphertext; and

generating the target ciphertext by performing the accumulative multiplication based on the key-switched ciphertext.

21. The homomorphic encryption operation method of claim 18 , wherein the generating of the target ciphertext comprises:

generating a first accumulative multiplication result by performing the accumulative multiplication based on the first ciphertext; and

generating the target ciphertext by performing the key switching on the first accumulative multiplication result.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 27, 2022
From: LEE, YONGWOO; KIM, ANDREY; DERIABIN, MAKSIM; EOM, JIEUN; YOO, DONG-HOON; CHOI, RAKYONG
To: SAMSUNG ELECTRONICS CO., LTD.
Reel/Frame 061883/0802 →
Priority Claims (2)
KR 10-2021-0165597 · Nov 26, 2021 · national
KR 10-2022-0127784 · Oct 6, 2022 · national
Continuity (1)
Related Publication 20230171085A1 · Jun 1, 2023
References Cited (13)
US 20020135307A1 · Cousy · 2002 [cited by examiner]
US 20210119766A1 · Suresh et al. · 2021 [cited by applicant]
US 20220376890A1 · Eom · 2022 [cited by examiner]
US 20220385461A1 · Eom · 2022 [cited by examiner]
US 20230171085A1 · Lee · 2023 [cited by examiner]
US 20230246807A1 · Lee · 2023 [cited by examiner]
FDFB: Full Domain Functional Bootstrapping Towards Practical Fully Homomorphic Encryption, Kamil Kluczniak (Year: 2021). [cited by examiner]
Han, Kyoohyung, and Dohyeong Kl. “Better bootstrapping for approximate homomorphic encryption.” [cited by applicant]
Micciancio, Daniele, and Yuriy Polyakov. “Bootstrapping in FHEW-like cryptosystems.” [cited by applicant]
Chillotti, Ilaria, et al. “CONCRETE: Concrete operates on ciphertexts rapidly by extending TfhE.” [cited by applicant]
Ducas, Léo, and Daniele Micciancio. “FHEW: bootstrapping homomorphic encryption in less than a second.” [cited by applicant]
Kim, Andrey, et al. “General bootstrapping approach for RLWE-based homomorphic encryption.” [cited by applicant]
Chillotti, Ilaria, et al. “TFHE: fast fully homomorphic encryption over the torus.” [cited by applicant]