Ha Lam

20180183572, Jun 28, 2018

Feb 14, 2018

15/896456

- New York NY, US
Ha T. Lam - Forest Hills NY, US
Vladimir Shpilrain - New York NY, US

H04L 9/00

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 Ĥ that is fully homomorphically encrypted, where:N=pq and further, q is a second private prime number, and the public ring Ĥ is further, publically available. A corresponding method is also disclosed.

20180159680, Jun 7, 2018

Jun 2, 2015

15/578597

- Stockholm, SE
Ha LAM - Forest Hills NY, US
Alexander MAXIMOV - Lund, SE

Telefonaktiebolaget LM Ericsson (publ) - Stockholm

H04L 9/00
H04L 9/30
H04L 29/06
H04L 9/06
H04L 9/08

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.

20170063526, Mar 2, 2017

Aug 25, 2015

14/835019

- New York NY, US
Ha T. Lam - Forest Hills NY, US
Vladimir Shpilrain - New York NY, US

H04L 9/00

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 Ĥ that is fully homomorphically encrypted, where:N=pq and further, q is a second private prime number, and the public ring Ĥ is further, publically available. A corresponding method is also disclosed.