On Sat, 4 Mar 2000, bram wrote: > > I've written up a public key encryption algorithm I came up with and some > thoughts on it at > > http://www.gawth.com/bram/essays/simple_public_key.html If I just send you the final sum, how do you know it was generated correctly by adding stuff in the public key? does that matter? No good reason for the question. Just trying to get my head around it. Also kind of wondering about chosen-ciphertext attacks. What happens if I have a ciphertext, add one of the public key numbers to it, and then get access to the decryption? subtract one? Just to make sure : This works because every sum of k numbers is less than p/2, and then you just send that or its negation to send a 0 or 1. Then breaking the scheme seems to require figuring out whether the ciphertext is a valid sum of public key numbers, or the negation of a valid sum ? Thanks, -David
