mersenneforum.org  

Go Back   mersenneforum.org > Extra Stuff > Miscellaneous Math

Reply
 
Thread Tools
Old 2020-10-27, 19:15   #34
SarK0Y
 
SarK0Y's Avatar
 
Jan 2010

2·37 Posts
Talking

Yet another remarkable result == FPC11
S0T_guided doesn't provide more precision to estimate Z, but anyway result is rather curious...
number of loops: 100
0, 1, guided -'2' Please, enter version of S0T: 2
max Z to orig
Code:
0.6372928473642518323379782288209547690425255443149893931893843535970792784175827341996320445052560478699298601839443533476029251438056391372609841262742385638132526154494125575509613040804480112920323565670709588246405288404908622894629709445337
3438821172788817007077339573053851240563147377315517345065198070950000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
Mean Z to orig
Code:
0.847816521663485657814133837914497020755162842047555820546465597072997806836376666909889217573427171732060213664709636126472666235082149940337731722430296321900550428764812235598509955603712461573414220897963933429496883501654422702168241902579
76761323958691878245912386572902803522455618816353527839870935888620000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
min Z to orig
Code:
0.9899022558143058079156912361317448150859862978254655589273759906236828905373638276408135040588895053841490325450704413770152873445232075816563257398247839495905241594389007703128728139981129486315948151838363626365347525996501078194027536481540
9773578928729900104958869190201416265909610810311382805296301175410000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
closest Z to orig
Code:
0.989902255814305807915691236131744815085986297825465558927375990623682890537363827640813504058889505384149032545070441377015287344523207581656325739824783949590524159438900770312872813998112948631594815183836362636534752599650107819402753648
15409773578928729900104958869190201416265909610810311382805296301175410000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
number of loops: 1000
0, 1, guided -'2' Please, enter version of S0T: 2
max Z to orig
Code:
0.6372928473642518323379782288209547690425255443149893931893843535970792784175827341996320445052560478699298601839443533476029251438056391372609841262742385638132526154494125575509613040804480112920323565670709588246405288404908622894629709445337
3438821172788817007077339573053851240563147377315517345065198070950000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
Mean Z to orig
Code:
0.847254227884694871840210282646655859595988024436944967483139972442796707903333791436934964257186571865906945732866754293783827697653512151204043811848902883579696369741256577272607407808388339428622875723682619255196023276606284720922557147192
42324452492007603826245486175440403294895115476090344925759358260020000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
min Z to orig
Code:
0.9899022558143058079156912361317448150859862978254655589273759906236828905373638276408135040588895053841490325450704413770152873445232075816563257398247839495905241594389007703128728139981129486315948151838363626365347525996501078194027536481540
9773578928729900104958869190201416265909610810311382805296301175410000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
closest Z to orig
Code:
0.989902255814305807915691236131744815085986297825465558927375990623682890537363827640813504058889505384149032545070441377015287344523207581656325739824783949590524159438900770312872813998112948631594815183836362636534752599650107819402753648
15409773578928729900104958869190201416265909610810311382805296301175410000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
Number of loops doesn't affect output + ratio doesn't jump over 1.
src: https://sourceforge.net/projects/fastprimecruncher/files/FPC11.7z/download

Plus, the're QSORT 4 GMP, I wrote it as dynamic code w/ function pointers.

PS actually, if I'll be having some more time, rsa can be cracked

Last fiddled with by Uncwilly on 2020-10-27 at 21:49 Reason: Fixed horrible formatting.
SarK0Y is offline   Reply With Quote
Old 2020-10-27, 21:35   #35
VBCurtis
 
VBCurtis's Avatar
 
"Curtis"
Feb 2005
Riverside, CA

2·2,237 Posts
Default

What, exactly, is curious about this output? What are you trying to tell us?

You say "crack RSA" like it's one thing. Which RSA number do you think you can crack? I mean, I can crack RSA-100 in a few different ways, using a wide variety of tools; but most of them fail to help me crack RSA-768.
VBCurtis is offline   Reply With Quote
Old 2020-10-28, 01:59   #36
SarK0Y
 
SarK0Y's Avatar
 
Jan 2010

2·37 Posts
Default

Quote:
Originally Posted by VBCurtis View Post
What, exactly, is curious about this output? What are you trying to tell us?

You say "crack RSA" like it's one thing. Which RSA number do you think you can crack? I mean, I can crack RSA-100 in a few different ways, using a wide variety of tools; but most of them fail to help me crack RSA-768.
for now, i've been toying w/ rsa150 == the very goal ain't just crack rsa numbers, but is to find polynomial-time techniques. heh.. it sounds ambitious, but crude approximation of Z (Z == P + Q) has been already possible w/ S0Ts :D
SarK0Y is offline   Reply With Quote
Old 2020-11-05, 19:58   #37
SarK0Y
 
SarK0Y's Avatar
 
Jan 2010

2×37 Posts
rolleyes

now fpc has very good result for mean value == report here: https://sourceforge.net/projects/fas...al%20_%292.txt


src here: https://sourceforge.net/projects/fas...files/FPC14.7z
actually, it's already possible to crack rsa == it takes the array of samples generated w/ S0Ts (for instance, S0T2Head) & then play w/ function "means" to reduce noisy data. meanwhile, i'd like to improve the speed of convergence

Last fiddled with by Uncwilly on 2020-11-06 at 14:53 Reason: Removed auto-download part of link.
SarK0Y is offline   Reply With Quote
Old 2020-11-05, 22:20   #38
SarK0Y
 
SarK0Y's Avatar
 
Jan 2010

2×37 Posts
Default

https://sourceforge.net/projects/fas...e%20means1.txt
https://sourceforge.net/projects/fas...he%20means.txt

Last fiddled with by Uncwilly on 2020-11-06 at 14:53 Reason: Removed auto-download part of link.
SarK0Y is offline   Reply With Quote
Old 2020-11-05, 22:25   #39
mathwiz
 
Mar 2019

127 Posts
Default

Quote:
Originally Posted by SarK0Y View Post
now fpc has very good result for mean value == report here: https://sourceforge.net/projects/fas...al%20_%292.txt


src here: https://sourceforge.net/projects/fas...files/FPC14.7z
actually, it's already possible to crack rsa == it takes the array of samples generated w/ S0Ts (for instance, S0T2Head) & then play w/ function "means" to reduce noisy data. meanwhile, i'd like to improve the speed of convergence
What does any of this mean?

How do you factor one of the RSA challenge numbers with your method?

Last fiddled with by Uncwilly on 2020-11-06 at 14:54 Reason: Removed auto-download part of link
mathwiz is online now   Reply With Quote
Old 2020-11-05, 22:38   #40
VBCurtis
 
VBCurtis's Avatar
 
"Curtis"
Feb 2005
Riverside, CA

10001011110102 Posts
Default

Quote:
Originally Posted by mathwiz View Post
What does any of this mean?

How do you factor one of the RSA challenge numbers with your method?
He doesn't. But, he *could*!! You know, when his thingies converge.
If he explained his method, someone might steal it! So, please just give him attention.
You won't learn anything, since he can't actually do anything.
VBCurtis is offline   Reply With Quote
Old 2020-11-05, 22:56   #41
SarK0Y
 
SarK0Y's Avatar
 
Jan 2010

2·37 Posts
Default

Quote:
Originally Posted by mathwiz View Post
What does any of this mean?

How do you factor one of the RSA challenge numbers with your method?
just download output (txt files) == the're step by step == approximate Z & then you have..


N = P * Q
Z = P + Q
SarK0Y is offline   Reply With Quote
Old 2020-11-05, 23:20   #42
mathwiz
 
Mar 2019

127 Posts
Default

Quote:
Originally Posted by SarK0Y View Post
now fpc has very good result for mean value == report here: https://sourceforge.net/projects/fas...al%20_%292.txt


src here: https://sourceforge.net/projects/fas...files/FPC14.7z
actually, it's already possible to crack rsa == it takes the array of samples generated w/ S0Ts (for instance, S0T2Head) & then play w/ function "means" to reduce noisy data. meanwhile, i'd like to improve the speed of convergence
Quote:
Originally Posted by SarK0Y View Post
just download output (txt files) == the're step by step == approximate Z & then you have..


N = P * Q
Z = P + Q
Please show, step by step, how you would factor (say) RSA-200.

Last fiddled with by Uncwilly on 2020-11-06 at 14:55 Reason: Removed auto-download par of link
mathwiz is online now   Reply With Quote
Old 2020-11-05, 23:35   #43
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

2·19·241 Posts
Default

Quote:
Originally Posted by SarK0Y View Post
just download output (txt files) == the're step by step == approximate Z & then you have..


N = P * Q
Z = P + Q
Just factor this:
Code:
22881674130987296817369335083505533792239602706912929845514703469287126491267727124570402660433186186250608348826913204513283590140161157396044966038359555681362347423
Batalov is offline   Reply With Quote
Old 2020-11-06, 01:04   #44
SarK0Y
 
SarK0Y's Avatar
 
Jan 2010

2×37 Posts
Default

Quote:
Originally Posted by mathwiz View Post
Please show, step by step, how you would factor (say) RSA-200.
like any other rsa number. just look into outputs.
SarK0Y is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Fast Factoring and Cracking The RSA Owl Miscellaneous Math 10 2020-09-09 19:52
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 15:34.

Thu Nov 26 15:34:37 UTC 2020 up 77 days, 12:45, 4 users, load averages: 1.39, 1.51, 1.42

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, 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.