[ Home  |  FAQ-Related Q&As  |  General Q&As  |  Answered Questions ]


    Search the Q&A Archives


Why does Adversary not construct correspondence between...

<< Back to: RSA Cryptography Today FAQ (1/1)

Question by zhengjun
Submitted on 11/12/2003
Related FAQ: RSA Cryptography Today FAQ (1/1)
Rating: Not yet rated Rate this question: Vote
Why does Adversary not construct correspondence between plain texts and secret texts, and store the correspondence, since RSA function is a permutation over domain.(see Oded Goldreich, Foundation of Cryptograph P56) Alice can encipher, Adversary can do it also. He need not to decipher, he only need to compare a secret text in his storage  and pick out relative plain text. This attack is easy, so  RSA is fragile if it confronts powerful enemy(NSA) whose storage is marvellous.
11/11/2003.









                              


Your answer will be published for anyone to see and rate.  Your answer will not be displayed immediately.  If you'd like to get expert points and benefit from positive ratings, please create a new account or login into an existing account below.


Your name or nickname:
If you'd like to create a new account or access your existing account, put in your password here:
Your answer:

FAQS.ORG reserves the right to edit your answer as to improve its clarity.  By submitting your answer you authorize FAQS.ORG to publish your answer on the WWW without any restrictions. You agree to hold harmless and indemnify FAQS.ORG against any claims, costs, or damages resulting from publishing your answer.

 

FAQS.ORG makes no guarantees as to the accuracy of the posts. Each post is the personal opinion of the poster. These posts are not intended to substitute for medical, tax, legal, investment, accounting, or other professional advice. FAQS.ORG does not endorse any opinion or any product or service mentioned mentioned in these posts.

 

<< Back to: RSA Cryptography Today FAQ (1/1)


[ Home  |  FAQ-Related Q&As  |  General Q&As  |  Answered Questions ]

© 2008 FAQS.ORG. All rights reserved.