Skip to content

Is multiplication available between ciphertexts with different slots' numbers? #328

Closed Answered by Pro7ech
macknight asked this question in Q&A
Discussion options

You must be logged in to vote

A ciphertext that encrypts a message of n slots in a ring degree of 2^{k+1}n is equivalent to a ciphertext that encrypts 2^{k} concatenations of this message but encoded as a message of 2^{k}n slots.

For examples of you encode m with 512 slots with N=2048, it will give the same plaintext polynomial as encoding m|m with 1024 slots.

Therefore multiplying m0 with 512 slots along with m1=m10|m11 with 1024 slots is effectively doing (m0|m0) x (m10|m11)

Replies: 3 comments 1 reply

Comment options

You must be logged in to vote
0 replies
Comment options

You must be logged in to vote
1 reply
@Pro7ech
Comment options

Comment options

You must be logged in to vote
0 replies
Answer selected by Pro7ech
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Category
Q&A
Labels
None yet
4 participants