a practical method of fully homomorphe and verifiable encryption.

摘要

the present invention relates to a cryptosystème fully homomorphe efficiently based on a new probabilistic homomorphe and processed between the ring z / 2z (ring of integers modulo 2 residues).the whole ring of lipschitz modular.the cryptosystème is able to process messages in the form of bits in the entry form and provide ciphers of lipschitz quaternions matrices modulo a large integer na combined $aturel non deterministic. the security of the cryptosystème is based on the difficulty of solving a system of polynomial equations in a multi ring not commutatif variety.this cryptosystème allows to further reduce the computation time of the multiplication in the encryption algorithm completely homomorphe (eh)it minimizes the size of the secret key, and to reduce the expansion of the ciphers.