1993-10-11 - RSA Security

Header Data

From: nobody@rosebud.ee.uh.edu
To: cypherpunks@toad.com
Message Hash: 569058b1657ff8a7f5ed71c889a4eef0053530501c5be6880c4eecf96a9c96b5
Message ID: <9310111927.AA16653@toad.com>
Reply To: N/A
UTC Datetime: 1993-10-11 19:29:50 UTC
Raw Date: Mon, 11 Oct 93 12:29:50 PDT

Raw message

From: nobody@rosebud.ee.uh.edu
Date: Mon, 11 Oct 93 12:29:50 PDT
To: cypherpunks@toad.com
Subject: RSA Security
Message-ID: <9310111927.AA16653@toad.com>
MIME-Version: 1.0
Content-Type: text/plain


Everyone here, of course, knows that breaking the RSA encryption scheme
can be no harder than factoring huge numbers. The present security in
RSA rests in the fact that nobody has found an efficient way to do it.
At the same time, however, nobody has been able to show that it can't
be done. We are simply going on faith and past history.

The problem is that if someone were to discover a efficient method for
factoring, I don't believe that we would know about it for a long time.
For example, if by some stroke of genius, I were to discover an efficient
way to factor, you would never hear about it from me! Being the greedy
person that I am, I would say to myself: "How can I make a buck from
this?". I would probably go to the government or some company (quietly)
and say to them: "For X dollars each, I will break RSA keys for you."
The beauty is that I would not need to disclose the algorithm for
factoring. They could easily check if the results that I gave them
were correct!





Thread