Encrypted computation comprising a blind rotation
AssigneeZama SAS
InventorsMarc Francois Joye, Michael Walter
Life of this patent
Estimating the term…
Loading patent…
AssigneeZama SAS
InventorsMarc Francois Joye, Michael Walter
Estimating the term…
Some embodiments are directed to a cryptographic encrypted computation method (400). The method involves performing a blind rotation of a ciphertext according to a test polynomial. The blind rotation results in an encrypted polynomial product of the test polynomial and a bootstrapping monomial represents the plaintext value as an exponent, modulo a modulus (q) and modulo a quotient polynomial (p(X)). . . . The quotient polynomial p(X) divides a number-theoretic transform (NTT) polynomial XM−1 that allows a number-theoretic transform modulo the modulus q, e.g., q is a power of two and p(X)=XN+XN/2+1. The blind rotation is performed using the NTT, while the test polynomial is defined in such a way that the polynomial product is programmed to have desired output values for respective plaintext values as a fixed coefficient.
A computer-implemented cryptographic method for outsourcing computations, the computations comprising performing a blind rotation of a ciphertext, the method comprising:
A cryptographic encrypted computation device for outsourcing computations, the computations comprising performing blind rotations on ciphertexts, the device comprising:
Dependencies are inferred from the claim text.