Re: java implementation of homomorphic encryption

Roy <royliuk@xxxxxxxxxxx> wrote:
I tried the code given by Kristian. But it does not give me the
correct output. Am I missing sth?

Yes, p and q should be primes, of course.

You may benefit from actually reading a bit about the Paillier
cryptosystem before using it...

--
Kristian Gjøsteen
.

Relevant Pages

  • Re: What Are You Reading??
    ... from it reading other things; just finished Marcus du Sautoy's "The ... Music of the Primes" (popular history of mathematics). ...
    (rec.pets.cats.anecdotes)
  • Re: N-pt DFT where n != power of 2
    ... small primes of 2, 3 or 5 range. ... need) as the output time samples must respect the 960 or 120 frame size. ... Zero padding doesn't change the returned values. ... You should do a little reading (or use FFTW, reading the directions carefully and taking no steps for granted. ...
    (comp.dsp)
  • Re: read/write at the same time
    ... to it in order to create other primes. ... procedure allows me reading from it and rewrite allows me only writing ... sequence of fixed-length records, where you can change one record ...
    (alt.comp.lang.borland-delphi)
  • Re: Methods that count primes without counting primes or referring to them...
    ... > I've been reading over about as much stuff as I can find about prime distribution and prime counting, and I've been left with the following question. ... function for generating the number of primes less than n that doesn't ...
    (sci.math)
  • Re: Methods that count primes without counting primes or referring to them...
    ... > prime distribution and prime counting, ... > Assuming I'm understanding what I'm reading correctly (I'm getting ... > Riemann's paper on the distribution of primes provides a function for ...
    (sci.math)