math gcd problem need help

[crack11]

can you try to solve my problem?

[bsquared]

Originally Posted by crack11

can you try to solve my problem?

No we will not. As people have repeatably told you, your problem is impossible for any of us to solve, even if the lurking issue of possibly aiding a criminal activity were favorably resolved.

[EdH]

Originally Posted by Dr Sardonicus

...
Well, the main reason I even tried the calculation was to see whether it would actually work. In particular, I was curious as to whether the Pari stack would overflow. It didn't. But it is possible that, if I allocated more stack space and did the calculation again, it would go faster. Often I have found that, if Mr. Computer is taking longer than expected to do something, it's running short of some critical resource...

I do that with YAFU every now and then. (I wonder if Ben remembers the time I told him YAFU wouldn't return the nextprime(N) for a ridiculously large N?) I had tried pari also, but couldn't remember how to increase the stack. It's been a long time since I used it. I seem to remember it being rather easy, but I was too lazy to open the manual, and YAFU worked right away.

[crack11]

its not criminal activity sir....

[R. Gerbicz]

Originally Posted by crack11

can you try to solve my problem?

OK, tried:

                  GP/PARI CALCULATOR Version 2.9.1 (released)
          amd64 running linux (x86-64/GMP-6.1.1 kernel) 64-bit version
   compiled: Mar  4 2017, gcc version 6.2.0 20161005 (Ubuntu 6.2.0-5ubuntu12)
                            threading engine: single
               (readline not compiled in, extended help enabled)

                     Copyright (C) 2000-2016 The PARI Group

PARI/GP is free software, covered by the GNU General Public License, and comes 
WITHOUT ANY WARRANTY WHATSOEVER.

Type ? for help, \q to quit.
Type ?15 for how to get moral (and possibly technical) support.

parisize = 8000000, primelimit = 500000
? allocatemem(16*10^9)
  ***   Warning: new stack size = 16000000000 (15258.789 Mbytes).
? Z1=75801049599829141093943784056210816800452773289339028770189501737224318660\
47182165909685701898461476201769271496346873969218041590426190558248064238412-\
55427440804165493132043396853481018040926332807769960947123236719360257243036\
63565120968650288374354487920966943136994524637343823470109069100536001825061^65537;
Z2=75801049599829141093943784056210816800452773289339025570648982477559574792\
31576299665165903124564064889635003580310606233252493957322555511313835652894-\
22100529598632336663526317436055449484896693495885897629357313823537062726878\
62251429121203091727087209430630578779213774169437578222468020592099358198793^65537;
gcd(Z1,Z2)
? ? 
%3 = 9943361511736887180525193238781951852048704466124378491895895799799940176852818360584496466538746226491733937270575629104317392858375709260953122655392891
? ? ##
  ***   last result computed in 5,656 ms.
? Z1=75801049599829141231178040448064618201545720363695495294055521626488569562\
31245030405896783337631871321017085933334306430501343909365379890910193903441-\
76016114382779689639304353399663755377627237889291382415050923350322163370241\
11944145650540579951639515460945444623092013993572866002842083492323809287290^17592186175489;
Z2=75801049599829141231178040448064618201545720363695493017732046510446541563\
28611994019678602790933052049997074737942147009504600337458372628655015658163-\
54720210512320202946371560580317961070194543965251722604913065679224504883023\
45750910648307191204110931670031994886144725045972546892458995859985546716414^17592186175489;
gcd(Z1,Z2)

  ***   at top-level: ...6002842083492323809287290^17592186175489
  ***                                             ^---------------
  *** _^s: the PARI stack overflows !
  current stack size: 16000000000 (15258.789 Mbytes)
  [hint] set 'parisizemax' to a non-zero value in your GPRC

  ***   Break loop: type 'break' to go back to GP prompt
break>

[science_man_88]

Originally Posted by crack11

its not criminal activity sir....

Are you from the company that makes the hardware, and testing it for vulnerability ? if not I don't know how it's not illegal.

[VBCurtis]

Originally Posted by crack11

its not criminal activity sir....

I hope your English skills are strong enough to understand "impossible", and that resolving legality issues doesn't alter possible-ness.

[Dr Sardonicus]

Originally Posted by science_man_88

Are you from the company that makes the hardware, and testing it for vulnerability ? if not I don't know how it's not illegal.

This poster seems too clueless for that to be true. Besides, if they were, I think that, when concerns were raised, they would simply have said so, rather than saying "it's not criminal activity."

Perhaps an admin should pass on this person's name to the company (Irdeto I think) that makes these things, stating the concerns about what they might be up to

[xilman]

Originally Posted by crack11

its not criminal activity sir....

That may, or may not, be the case. I really don't care to argue the case.

Between us, you and I have already given you sufficient information to enable you to solve your problem.

From here on, and as far as I am concerned, you are on your own. I have given you information; you have given me entertainment. Seems like a fair trade to me.

[crack11]

Dear all thanks for replays.

but problem still not solve ...

[R. Gerbicz]

Originally Posted by crack11

Dear all thanks for replays.

but problem still not solve ...

And will be likely unsolved for ~40 years.
This is really "your problem", what I don't understand why are you hiding N in such an idiotic way. N is public in RSA, in your case it is somewhere between public and secret, but WHY when there are methods to change N in a secret way if somebody really wants that.