Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

various typos (dimension, subscript, ring) #512

Merged
merged 1 commit into from
Dec 7, 2022
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions native/src/seal/batchencoder.h
Original file line number Diff line number Diff line change
Expand Up @@ -26,12 +26,12 @@ namespace seal
Mathematically speaking, if the polynomial modulus is X^N+1, N is a power of two, and
plain_modulus is a prime number T such that 2N divides T-1, then integers modulo T
contain a primitive 2N-th root of unity and the polynomial X^N+1 splits into n distinct
linear factors as X^N+1 = (X-a_1)*...*(X-a_N) mod T, where the constants a_1, ..., a_n
linear factors as X^N+1 = (X-a_1)*...*(X-a_N) mod T, where the constants a_1, ..., a_N
are all the distinct primitive 2N-th roots of unity in integers modulo T. The Chinese
Remainder Theorem (CRT) states that the plaintext space Z_T[X]/(X^N+1) in this case is
isomorphic (as an algebra) to the N-fold direct product of fields Z_T. The isomorphism
is easy to compute explicitly in both directions, which is what this class does.
Furthermore, the Galois group of the extension is (Z/2NZ)* ~= Z/2Z x Z/(N/2) whose
Furthermore, the Galois group of the extension is (Z/2NZ)* ~= Z/2Z x Z/(N/2)Z whose
action on the primitive roots of unity is easy to describe. Since the batching slots
correspond 1-to-1 to the primitive roots of unity, applying Galois automorphisms on the
plaintext act by permuting the slots. By applying generators of the two cyclic
Expand Down
2 changes: 1 addition & 1 deletion native/src/seal/evaluator.h
Original file line number Diff line number Diff line change
Expand Up @@ -25,7 +25,7 @@ namespace seal
the plaintext elements are fundamentally polynomials in the polynomial quotient ring Z_T[x]/(X^N+1), where T is the
plaintext modulus and X^N+1 is the polynomial modulus, this is the ring where the arithmetic operations will take
place. BatchEncoder (batching) provider an alternative possibly more convenient view of the plaintext elements as
2-by-(N2/2) matrices of integers modulo the plaintext modulus. In the batching view the arithmetic operations act on
2-by-(N/2) matrices of integers modulo the plaintext modulus. In the batching view the arithmetic operations act on
the matrices element-wise. Some of the operations only apply in the batching view, such as matrix row and column
rotations. Other operations such as relinearization have no semantic meaning but are necessary for performance
reasons.
Expand Down