Prev: Considering discrete logs
Next: How Can ZFC/PA do much of Math - it Can't Even Prove PAisConsistent (EASY PROOF)
From: Mark Murray on 1 Jul 2010 08:18
On 07/01/10 12:19, master1729 wrote:
> while james has a method and that method is not even on that page.
> so james has an example , and the page just mentions a non-described connection.
> so basicly james got a 8/10 and the wiki 3/10 concerning the relation to factoring.
> hell , perhaps the wiki should give a link to james method to be a better page.

Wikipedia is but a tiny subset of what you get when you search for

"discrete logarithm" factorization

> keep in mind that james method is deterministic and nonrandom unlike most others.

Huh? Even Wikipedia lists algorithms (some based on factorisation) that
are MUCH quicker than James's.

> together with my ' advice from the master ' given yesterday the method works pretty
> well sometimes...

"Sometimes". Trial division also works well "sometimes"; this is
hardly an endorsement as algorithm of choice.

Demonstrate it performing efficiently for cryptographic-grade numbers
to be taken seriously.

M
From: Jesse F. Hughes on 1 Jul 2010 08:22
Pubkeybreaker <pubkeybreaker(a)aol.com> writes:

> On Jun 29, 11:35 pm, JSH <jst...(a)gmail.com> wrote:
> a HUGE issue.  So far the problem has been intractable.
>>
>> Human beings seem to love misery.  I'm not sure why.  But make no
>> mistake, the human animal often works very hard to NOT solve its
>> problems, preferring often instead to whine about them, but refusing
>> to solve them.
>>
>> That may be built into the human genome.  The reasons are complex.
>>
>> James Harris
>
> When are you going to tell us the year you graduated from
> Vanderbilt???
>
> Why won't Vanderbilt confirm that a James S. Harris got a degree in
> physics from them?

You've asked them?

> Why do you keep ignoring these questions?
>
> I think you are lying when you claim a degree in physics from
> Vanderbilt. In my home state falsely claiming to have a degree
> is a crime.

Somehow, I doubt he's lying about his BS. But what effort have you
taken to see whether he has graduated?

--
Jesse F. Hughes

"My name is Apusta Malusta Cadeau and I fight bad guys. And I'm a
knight." -- A. M. Cadeau (nee Quincy P. Hughes), age 4
From: JSH on 1 Jul 2010 09:53
On Jul 1, 4:19 am, master1729 <tommy1...(a)gmail.com> wrote:
> Mark Murray wrote :
>
>
>
>
>
> > On 01/07/2010 03:00, JSH wrote:
> > >> Why don't you read a little?
>
> > >>http://en.wikipedia.org/wiki/Discrete_Logarithm
> > >> ... then go to the "Comparison with Integer
> > Factorization" section
> > >> and look at the third bullet point.
>
> > > I had already read it.
>
> > Then you didn't understand it. You certainly didn't
> > make the
> > complexity connection.
>
> > >> Don't believe that? go to a search engine (any
> > will do)
> > >> and enter "discrete logarithm factorization"
> > (without the quotes)
> > >> to see how well understood this area is.
>
> > > I've done that search already.
>
> > So you must know that the connection between discrete
> > logarithms and
> > factoring is both well known and well studied,
> > contrary to your
> > numerous claims.
>
> > This is not an innovation of yours; all you are doing
> > is a
> > presentation of a well-understood study area and
> > attempting to
> > claim credit. I'll put this down to a combination of
> > ignorance
> > and hubris. Ignorance, because you needed to be shown
> > the connection
> > between your original announcement and modular
> > exponentiation (and
> > again for discrete logarithms). Hubris, because of
> > your _usual_
> > grandiose claims based on 1 or 2 "cherry-picked",
> > trivial examples,
> > with a hasty generalisation substituting for a
> > conclusion.
>
> > Your resistance to learning is staggering.
>
> > M
> > --
> > Mark "No Nickname" Murray
> > Notable nebbish, extreme generalist.
>
> i dont think you are fair here.
>
> its like , sure the connection to factoring is given.
>
> it is said that it is connected.
>
> but it is not even explained !
>
> while james has a method and that method is not even on that page.

Quite true which goes to bias. Information is information regardless
of the source.

I'd be VERY surprised if math people put my approach on that page even
though it is without argument a direct connection between integer
factorization and discrete logarithms which shows a way to solve
discrete logarithms by integer factorization.

So with THAT the information SHOULD be noted and recorded, but math
people play by their own made up rules--but say otherwise.

> so james has an example , and the page just mentions a non-described connection.
>
> so basicly james got a 8/10 and the wiki 3/10 concerning the relation to factoring.

I think that's objective.

> hell , perhaps the wiki should give a link to james method to be a better page.
>
> keep in mind that james method is deterministic and nonrandom unlike most others.

Really?

> together with my ' advice from the master ' given yesterday the method works pretty well sometimes...
>

I'll have to re-read that, as I thought you were just knocking it.

I'm curious about the deterministic and nonrandom claim.


James Harris
From: Pubkeybreaker on 1 Jul 2010 12:07
On Jul 1, 8:22 am, "Jesse F. Hughes" <je...(a)phiwumbda.org> wrote:
> Pubkeybreaker <pubkeybrea...(a)aol.com> writes:
> > On Jun 29, 11:35 pm, JSH <jst...(a)gmail.com> wrote:
> > a HUGE issue.  So far the problem has been intractable.
>
> >> Human beings seem to love misery.  I'm not sure why.  But make no
> >> mistake, the human animal often works very hard to NOT solve its
> >> problems, preferring often instead to whine about them, but refusing
> >> to solve them.
>
> >> That may be built into the human genome.  The reasons are complex.
>
> >> James Harris
>
> > When are you going to tell us the year you graduated from
> > Vanderbilt???
>
> > Why won't Vanderbilt confirm that a James S. Harris got a degree in
> > physics from them?
>
> You've asked them?
>
> > Why do you keep ignoring these questions?
>
> > I think you are lying when you claim a degree in physics from
> > Vanderbilt.   In my home state falsely claiming to have a degree
> > is a crime.
>
> Somehow, I doubt he's lying about his BS.  But what effort have you
> taken to see whether he has graduated?

I asked Vanderbilt.
From: Mark Murray on 1 Jul 2010 13:26
On 01/07/2010 17:07, Pubkeybreaker wrote:
>> Somehow, I doubt he's lying about his BS. But what effort have you
>> taken to see whether he has graduated?
>
> I asked Vanderbilt.

What was their answer? "Never heard of him"? "We don't give out that
information"? "Please submit your request through the correct channels"?

.... etc?

M
--
Mark "No Nickname" Murray
Notable nebbish, extreme generalist.
What
First  |  Prev  |  Next  |  Last
Pages: 1 2 3 4 5
Prev: Considering discrete logs
Next: How Can ZFC/PA do much of Math - it Can't Even Prove PAisConsistent (EASY PROOF)