5. Assume the "plain" RSA signature scheme with public key (N, e = 3). For which of the following messages is it always possible to forge a signature without seeing any prior signatures or factoring ?...

1000, and N relatively prime to each of the messages that follow.) 47 2 37 27 "/>
Extracted text: 5. Assume the "plain" RSA signature scheme with public key (N, e = 3). For which of the following messages is it always possible to forge a signature without seeing any prior signatures or factoring ? (Assume N > 1000, and N relatively prime to each of the messages that follow.) 47 2 37 27