1994-06-17 - Re: Prime magnitude and keys…a ?

Header Data

From: Jim choate <ravage@bga.com>
To: perry@imsi.com
Message Hash: a7dafe217eea7a0ed9ac79700042a2b97e6ecb6ebbd7ae5e93611ce7ff46c1f1
Message ID: <199406171841.NAA09949@zoom.bga.com>
Reply To: <9406171646.AA02442@snark.imsi.com>
UTC Datetime: 1994-06-17 18:41:29 UTC
Raw Date: Fri, 17 Jun 94 11:41:29 PDT

Raw message

From: Jim choate <ravage@bga.com>
Date: Fri, 17 Jun 94 11:41:29 PDT
To: perry@imsi.com
Subject: Re: Prime magnitude and keys...a ?
In-Reply-To: <9406171646.AA02442@snark.imsi.com>
Message-ID: <199406171841.NAA09949@zoom.bga.com>
MIME-Version: 1.0
Content-Type: text

> Jim choate says:
> > How about some evidence on it? I see no reason to compare taking a key
> > and determining if it is too large or too small as being necessarily
> > equivalent to factoring a large number.
> Its called "binary search". You were supposed to learn it in your
> intro to computer science class.
> Lets play the guessing game, shall we? Its much like twenty questions,
> only that just works for twenty bit things or less. We know that we
> have a big number. If you give me a function that tells me one bit
> (greater or not greater) for every guess, I can get a bit of the
> number. After a short time, I'll know the number -- the time is
> exactly the number of bits in the number (that is, the log base 2 of
> the number.)
> Perry
I am well aware of how to do a binary search. I have been programming since
'76. The question I have is not how to do the search but if there is a way
to feed a RSA fake keys in such a way that I can determine the relative 
magnitude of the difference in the key, not even the exact difference.

On another note, ad hominim resoning does not impress me. If you would like
to discuss my idea that is fine. It has no relation to me personaly.