Re: RSA imperfection

From: Henrick Hellström (henrick.hellstrm_at_telia.com)
Date: 07/06/03 

Date: Sun, 06 Jul 2003 11:15:36 GMT

lakis wrote:
> Suppose that users Alice,Bob,Carol have the following public keys
> (nA,3),(nB,3) and (nC,3) respectively. Suppose also that we send,
> using RSA, the same message M to the above three users. Show how can
> anyone, who overhears the three ciphertexts, find the original message
> M. Suggest a simple montification that prevents the decipherment.

Is that homework?

Relevant Pages

  • Re: RSA imperfection
    ... > lakis wrote: ... >> Suppose that users Alice,Bob,Carol have the following public keys ... >> using RSA, the same message M to the above three users. ... No it's not a homework! ...
    (sci.crypt)
  • Key combinations in RSA Encryption Scheme
    ... I have recently developed one excel program which generates n numbers ... Many private keys & many corresponding public keys. ... Then How RSA can be cracked once we find the factor of Modulus? ...
    (sci.crypt)
  • Re: openssh publickey auth not working any more
    ... Excuse me, so you did -- I didn't read your transcript carefully enough ... it should be rsa). ... One problem is that you have not restarted sshd since installing 3.1 -- ... ~/.ssh/authorized_keys2 for public keys, ...
    (comp.security.ssh)
  • how to use Public-key in F-Secure SSH for windows?
    ... few public keys are generated thru the following path: ... key type: RSA ... I am expecting to see the content of the authorized_keys file something ...
    (SSH)
  • RSA imperfection
    ... Suppose that users Alice,Bob,Carol have the following public keys ... using RSA, the same message M to the above three users. ... M. Suggest a simple montification that prevents the decipherment. ...
    (sci.crypt)
Quantcast