The City University of New York

Telefonaktiebolaget Lm Ericsson (publ)

Ha Lam

Vladimir Shpilrain

Delaram Kahrobaei

Christine Jost

Alexander Maximov

A method and encryption node () for providing encryption of a message m according to a selected encryption scheme. A set of k noise factors are pre-compiled () from random numbers and predefined integer parameters of the selected encryption scheme by the encryption node () in advance. The k noise factors are saved () to be used for encrypting the message m when later requested () by a client (). A subset of/noise factors are then selected () out of the pre-computed set of k noise factors and used as input to the encryption scheme when encrypting () the message m by computing a cipher text c which is delivered () as an encrypted message, e.g. to the client (). Thereby, less time needs to be spent for computing the necessary noise factors after receiving the encryption request and higher throughput can thus be achieved for messages to be encrypted. In particular, the solution may be used to increase the throughput for a stream of messages.

Method and encryption node for encrypting message

A system for producing a public ring that is fully homomorphically encrypted. The system comprises a processor which generates a first presentation G of a ring, wherein G=x, y|x=0, y=0, xy+(p+1)yx=1, where x and y are generators and p is a first private prime number. The system further generates a second presentation H of the ring. H is defined as follows: H=x, y, t|x=0, y=0, t=myx, xy+myx+t=1. In addition, mand mare positive integers and p+1=m+m, wherein t is a generator and the first presentation G and the second presentation H are isomorphic. The system further produces a public ring &#x124; that is fully homomorphically encrypted, where: N=pq and further, q is a second private prime number, and the public ring &#x124; is further, publically available. A corresponding method is also disclosed.

System and method for private-key fully homomorphic encryption and private search between rings

A system for producing a public ring that is fully homomorphically encrypted. The system comprises a processor which generates a first presentation G of a ring, where G=x,y|x=0,y=0,xy+(p+1)yx=1, where x and y are generators and p is a first private prime number. The system further generates a second presentation H of the ring. H is defined as follows: H=x,y,t|x=0,y=0,t=myx,xy+myx+t=1. In addition, mand mare positive integers and p+1=m+m, wherein t is a generator and the first presentation G and the second presentation H are isomorphic. The system further produces a public ring &#x124; that is fully homomorphically encrypted, where: N=pq and further, q is a second private prime number, and the public ring &#x124; is further, publically available. A corresponding method is also disclosed.

Growing community of inventors

Forest Hills, NY, United States of America

Ha Lam