Search:

Type: Posts; User: Sean4u

Search: Search took 0.09 seconds.

  1. [SOLVED] Re: RSA encryption based from a Sample Alice and Bob's key.

    The maths is quite useless to you as a programmer. I keep meaning to write a Number class that is based on factorisation (so it never actually does any maths, just remembers lists of factors until...
  2. [SOLVED] Re: RSA encryption based from a Sample Alice and Bob's key.

    a^(b+c) = a^b * a^c
  3. [SOLVED] Re: RSA encryption based from a Sample Alice and Bob's key.

    That part is right, it's the next bit that's completely wrong. I only looked at it because I wondered if you were getting integer overflow. 18 is a bit more than 2^4. a^b^c is a^b*c, so 2^92 (4 times...
  4. [SOLVED] Re: RSA encryption based from a Sample Alice and Bob's key.

    There's one slightly even better choice for large integers!
  5. [SOLVED] Re: RSA encryption based from a Sample Alice and Bob's key.

    Something that you might want to bear in mind is that you might be using quite large numbers and a technique that depends on integer values with Math.pow(). You might get lucky as long as your...
  6. [SOLVED] Re: RSA encryption based from a Sample Alice and Bob's key.

    I read your link and it seems the person who wrote it may not have been paying attention during the last example:

    Does that look right to you?
    How does your code work if you use the values in the...
Results 1 to 6 of 6