mersenneforum.org  

Go Back   mersenneforum.org > Extra Stuff > Miscellaneous Math

Closed Thread
 
Thread Tools
Old 2020-11-06, 01:13   #45
SarK0Y
 
SarK0Y's Avatar
 
Jan 2010

10101102 Posts
Smile

Quote:
Originally Posted by Batalov View Post
Just factor this:
Code:
22881674130987296817369335083505533792239602706912929845514703469287126491267727124570402660433186186250608348826913204513283590140161157396044966038359555681362347423
any one can try on their own. since then my task has been to reduce number of samples for given numbers.
SarK0Y is offline  
Old 2020-11-06, 02:25   #46
VBCurtis
 
VBCurtis's Avatar
 
"Curtis"
Feb 2005
Riverside, CA

22×7×132 Posts
Default

There's nothing to try. You can't get factors yourself. We certainly aren't going to be able to either.

You haven't demonstrated any factoring. Just a bunch of BS. Factor something.
VBCurtis is offline  
Old 2020-11-06, 03:51   #47
SarK0Y
 
SarK0Y's Avatar
 
Jan 2010

2×43 Posts
Wink

Quote:
Originally Posted by VBCurtis View Post
There's nothing to try. You can't get factors yourself. We certainly aren't going to be able to either.

You haven't demonstrated any factoring. Just a bunch of BS. Factor something.
bs? :) curious "synonym" for approximation. actually, i have no time to crack any number for NOTHING + it has no sense. so far here i have met laughable stock w/ deep phobias to open 7zip archive. So it was extremely naive for me to wait adequate dispute
SarK0Y is offline  
Old 2020-11-06, 04:32   #48
mathwiz
 
Mar 2019

149 Posts
Default

Quote:
Originally Posted by SarK0Y View Post
bs? :) curious "synonym" for approximation. actually, i have no time to crack any number for NOTHING + it has no sense. so far here i have met laughable stock w/ deep phobias to open 7zip archive. So it was extremely naive for me to wait adequate dispute
Except you haven't actually demonstrated any sort of method or algorithm whatsoever.
mathwiz is offline  
Old 2020-11-06, 05:12   #49
retina
Undefined
 
retina's Avatar
 
"The unspeakable one"
Jun 2006
My evil lair

5·1,223 Posts
Default

Quote:
Originally Posted by SarK0Y View Post
bs? :) curious "synonym" for approximation ...
If it isn't all just BS then show us why it isn't. Produce an actual result, instead of the endless pontificating and meaningless random numbers.
retina is offline  
Old 2020-11-06, 20:42   #50
SarK0Y
 
SarK0Y's Avatar
 
Jan 2010

8610 Posts
Default

Quote:
Originally Posted by mathwiz View Post
Except you haven't actually demonstrated any sort of method or algorithm whatsoever.
my point has been perfectly clear from the very start == I've researched the ways to approximate Z for polynomial time. I've shared sources & examples/results how to operate w/ those methods. So, i'd like to ask very naive question == is this forum for math & researchers or wtf here is going on it would have been purely understandable, if indigenous community would have shared alt methods to approximate Z w/ more speed (for instance) or would have provided some clues to improve shared algos. But NO ABSOLUTELY, my thread has been flooded by just absurd off-topic...
So, you want superb algo(s) & want to do NOTHING for :) so, any not magical algo is only bs for you
SarK0Y is offline  
Old 2020-11-06, 20:56   #51
mathwiz
 
Mar 2019

14910 Posts
Default

Quote:
Originally Posted by SarK0Y View Post
my point has been perfectly clear from the very start == I've researched the ways to approximate Z for polynomial time. I've shared sources & examples/results how to operate w/ those methods. So, i'd like to ask very naive question == is this forum for math & researchers or wtf here is going on it would have been purely understandable, if indigenous community would have shared alt methods to approximate Z w/ more speed (for instance) or would have provided some clues to improve shared algos. But NO ABSOLUTELY, my thread has been flooded by just absurd off-topic...
So, you want superb algo(s) & want to do NOTHING for :) so, any not magical algo is only bs for you
People on this forum generally care about

(1) efficient algorithms to factor large integers, or
(2) efficient algorithms for finding large primes (and proving them prime).

You've demonstrated no meaningful algorithm for doing either.
mathwiz is offline  
Old 2020-11-06, 21:10   #52
SarK0Y
 
SarK0Y's Avatar
 
Jan 2010

2·43 Posts
Default

Quote:
Originally Posted by mathwiz View Post
People on this forum generally care about

(1) efficient algorithms to factor large integers, or
(2) efficient algorithms for finding large primes (and proving them prime).

You've demonstrated no meaningful algorithm for doing either.
really? how could you have efficient algo, if you have done no research??? perhaps new algos appear out of the blue, right? :)
SarK0Y is offline  
Old 2020-11-06, 21:10   #53
Uncwilly
6809 > 6502
 
Uncwilly's Avatar
 
"""""""""""""""""""
Aug 2003
101×103 Posts

19·499 Posts
Default

Quote:
Originally Posted by SarK0Y View Post
So, you want superb algo(s) & want to do NOTHING for :) so, any not magical algo is only bs for you
To prove that your algo is not BS I will give you 3 tests for it, each harder than the previous.

You need to solve the first one before your next post (and you must post the solution in your next post), or you may be banned (because you fail to show that your method works and just want to be a troll).
Then you must solve the next one (and post the answer) to continue posting.
After you have posted the answer to the third, then we will believe that you are on to something.

First test. Factor this semiprime (using your method):
3870092038884345663779821427477643475136534002402905753076769909311217

Second test Factor this semiprime (using your method)
150996579069406676849328254452885095204370060219736837010494868333342863322970462956706063

Third test. Factor this semiprime (using your method)
Code:
4735324369078304459849659757648833978535825054585241886997488631830939162381565490995222405517413444400835669

Last fiddled with by Uncwilly on 2020-11-07 at 00:30
Uncwilly is online now  
Old 2020-11-06, 21:23   #54
SarK0Y
 
SarK0Y's Avatar
 
Jan 2010

1268 Posts
Default

Quote:
Originally Posted by Uncwilly View Post
To prove that your algo is not BS I will give you 3 tests for it, each harder than the next.

You need to solve the first one before your next post (and you must post the solution in your next post), or you may be banned (because you fail to show that your method works and just want to be a troll).
Then you must solve the next one (and post the answer) to continue posting.
After you have posted the answer to the third, then we will believe that you are on to something.

First test. Factor this semiprime (using your method):
3870092038884345663779821427477643475136534002402905753076769909311217

Second test Factor this semiprime (using your method)
150996579069406676849328254452885095204370060219736837010494868333342863322970462956706063

Third test. Factor this semiprime (using your method)
Code:
4735324369078304459849659757648833978535825054585241886997488631830939162381565490995222405517413444400835669
You lost very point == the task ain't been just solve (it has no sense) == the task is to solve (at least approximate as much as possible) for POLYNOMIAL TIME. can you do it? so, don't feed me numbers == the're a hella lot of them w/o such help
SarK0Y is offline  
Old 2020-11-06, 21:25   #55
Gelly
 
Gelly's Avatar
 
May 2020

5·7 Posts
Default

Quote:
Originally Posted by SarK0Y View Post
really? how could you have efficient algo, if you have done no research??? perhaps new algos appear out of the blue, right? :)
Here's the issue many forumites have with your approach and why you may consider responses to your research hostile:
  1. You claimed to "have a milestone" in integer factorization and continue claiming that you will "crack rsa, if you have time". These are not light things to make claims for and, in fact, the bigger the claim, the more skeptical people are. It is no wonder, then, that to test your theories, people demand even basic results that will demonstrates tangible results people can work with.
  2. You then refuse to demonstrate (or even explain!) your method in a significant way - after reading things on the forums, my best guess is approximation of the sum of P and Q given the product? Not even particularly how you do it, just that you'd rather like to? I am not very well versed in the topic, but I'm pretty sure you need the exact sum, and not just an approximation, and while being off by 0.000000001% would be promising, for a 200 digit number, that leaves you out by a number that is about 190 digits - absolutely no progress at all, really. I may be wrong about your accuracy, but it is not as if you've worked particularly hard to explain your accuracy in the first place, other than some confusing source code and text documents.
  3. Most egregiously, you now have chosen to walk back the importance of your research, and scoff at us for expecting really anything at all for a thread that starts with "MILESTONE has been done :D".

If you wanted any cooperation, it would have been more helpful to ask questions about the topic - "Has there been any work done on factorizing RSA numbers with approximations of the sums of the primes in the product?" - rather than to announce "big results" and then be gleefully sour when people are doubtful. It would have saved us a lot of time, and it's likely there's already been a lot of research into the topic - with a good reason as to why it's failed so far.

Last fiddled with by Gelly on 2020-11-06 at 21:26 Reason: formatting is whack
Gelly is offline  
Closed Thread

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Fast Factoring and Cracking The RSA Owl Miscellaneous Math 11 2021-01-01 01:26
Pope "Deviled Eggs" Benedict, heaven help us for cracking such yolks jasong Soap Box 9 2013-03-17 03:28

All times are UTC. The time now is 02:19.

Wed Apr 14 02:19:53 UTC 2021 up 5 days, 21 hrs, 1 user, load averages: 3.19, 2.65, 2.41

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.