Re: Surrogate factoring and the k/T ratio
- From: Volker Hetzer <firstname.lastname@xxxxxxxx>
- Date: Mon, 05 Mar 2007 15:41:31 +0100
jstevh@xxxxxxxxx schrieb:
On Mar 2, 2:10 pm, Volker Hetzer <firstname.lastn...@xxxxxxxx> wrote:So you don't see yourself as a mathematician?jst...@xxxxxxxxx schrieb:> On Mar 1, 2:02 pm, s...@xxxxxxxxxxxxx wrote:You both try it out (the claim here is speed, isn't it?) and make sureJames Harris wrote:So? Yes, you can check, but when you say a mathematician is wrong,I really do not know why some of you lie about mathematics, but I noteNo, actually it is harder to lie about mathematics than other areas
for those who don't understand, it is EASIER to lie about mathematics
than other areas as it is so hard for others to check!!!
since mathematicians give proofs of their theorems that can be checked
by anyone who has gone to the trouble of learning the relevant
mathematics. Compare that to, say, physics, where one can claim to
and he says he's not, what then?
that you use the same algorithms and parameters.
Then two things can happen:
1) You stop responding, thereby conceding the point.
2) You concede the point and give an excuse (not final, trivial error, "just
an idea" etc.)
Then everyone but you agree that you are wrong and you start a new thread.
Sometimes you make a modification to your idea and the cycle repeats.
Does that answer your question?
Oh, changing the subject to me.
Well, what if I prove things, overAs others have repeatedly pointed out, we acknowledge that you
and over again, only to have posters come back and just lie about the
details?
can factor numbers. However, what you've failed to show, much less prove,
is that you can factor numbers at a speed that justifies the
"solves the factoring problem" tag.
Evidence in that regard would be the factoring of a large number.
A "proof" would be a thorough analysis, taking into account program
structures and so on. You still owe both.
Practically, if someone were attacking, say, an RSA number, they wouldIt simply depends on the time involved. That's what "solving the factoring
not care so much about looping threw a tremendous number of
combinations if they knew that they'd get the number cracked with one
of them, now would they?
problem" means.
And testing is just a validation of the mathematical proof aroundYes, something you've avoided until now.
surrogate factoring anyway.
"We" simply think there is an easier way of checking that you can
You people either stupidly avoid the proofs around surrogate
factoring, or you brilliant avoid proof that you are lying about it.
factor large numbers. Rather than debugging your "proofs" while being
insulted all the way through, "we" simply watch out for you claiming
one of the rsa prizes and view everything else as part of the daily
entertainment value of sci.crypt.
People can be convinced to not use a factoring method that might beEmphasis on the word "might". So how do you intend to move from
practical,
"might" to "is"?
Lots of Greetings!
Volker
--
For email replies, please substitute the obvious.
.
- References:
- Re: Surrogate factoring and the k/T ratio
- From: jstevh
- Re: Surrogate factoring and the k/T ratio
- From: sg552
- Re: Surrogate factoring and the k/T ratio
- From: jstevh
- Re: Surrogate factoring and the k/T ratio
- From: Volker Hetzer
- Re: Surrogate factoring and the k/T ratio
- From: jstevh
- Re: Surrogate factoring and the k/T ratio
- Prev by Date: Re: Certificate extensions
- Next by Date: Re: 16384-bit Encryption Algorithm
- Previous by thread: Re: Surrogate factoring and the k/T ratio
- Next by thread: Re: Surrogate factoring and the k/T ratio
- Index(es):
Relevant Pages
|