Nearby prime to factory 2048 bit

stanneraustin · 2022-10-04, 15:17

Hello Everyone.
I am new here but not in crypto.

My question is with yafu or any other way i can solve nearby prime ?

This is my sample & explanation.

Code:

My found P = 0xC19D2CE667487690FFB6CD076853F93D0A5202841D8898DC4BA75704D059C51B7F107C1A1C05C705911D64C5EB5F79B1BE5A6E3258FE526CE51848414A0294EE5A00496151588F8084D65386D137E747E21368BC3281E2BADFA4494DD8DF101495B45EF884881459C86F86D7A80A73ABB18C49B831DC5835869B72D502AC042B

My found N//P = Q = 0xF954B671FC35C9EC4A0FC9CC0A18EE491C9157A99327E5A9579B28D915F6C1A6E3A3BC960F235E7EB6FD0139B699590EB2FA9B5954AD9666FAFF9E1AB3E4ED894829A95A35DE02CFCDBF3679ED832F3E79CFB286828350C74B683FE2EDBB531CEE71B66DA26812B9C29AE2EFBE6B8FAEA77688E2ED5106C6D56A4ABB486A45E5

My expo 0x010001

Generated modules from this N = 0xBC91F23AC91B64AF421C8339A87C6374981C70CA55CB414A6355CCD1869F83A8DF5F8610A78E6271A2E7F0995943EFE46A6DFF3092FAB3BB32E2D36AD3B0A65A23B9D497E425A265DDE9917D90E56E2411A43882445794454C17718115BE0A82BD114CE3E803797A29B739E053BB0D7A083573A633B1361A5F302B7D8333ED88DCD2A33E2656CC846E4AD0F942B714DCBA2119A1BE127845F7362D8047860DE50A9491FD57225AAE3D7AA4C9C59D9F840DF4EE5DE76230D50784F02B9B4817E3ED3CC3912E8683ED392C9E95254B979AB7E70A43B45F34D8D7582EB881DB02245B5990AAE54BD09E550C29F965849B9A23F39D3AD5D0B424F19E181292CD5177

This match with very nearby my required modules N = 0xBC91F23AC91B64AF421C8339A87C6374981C70CA55CB414A6355CCD1869F83A8DF5F8610A78E6271A2E7F0995943EFE46A6DFF3092FAB3BB32E2D36AD3B0A65A23B9D497E425A265DDE9917D90E56E2411A43882445794454C17718115BE0A82BD114CE3E803797A29B739E053BB0D7A083573A633B1361A5F302B7D8333ED896BDF74399C7BEAC15570F5A41CB3A4D8FE277973B09291D79AC736A1517345DC3BB5D8CE9F2CD2EF3E246E5CC4532A5EEA9C07D7F7C69CC5F784F67311C1AFC2B95499E36B3466D2F0543A412961D27F6C5A637A36ED356EC07DB529E7B7BD37E61AD73E79D0D1695C3B1DA63EF309551B35197082125149DE3E9D884834F837

I have try via python

Code:

P -= 1  
N%P == 0

Also tested

Code:

P += 1  
N%P == 0

But this not seems solution to reach in time. i mean about few hrs i able to run but results not come.

Question is its possible my required prime is very near to this prime which i found ? if yes how can i test this range with yafu or any other way?

Any advice is welcome.

Thank you in advance
Regards,

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
2*b^n-1, b<=2048	LaurV	LaurV	22	2021-09-27 03:33
3x a mersenne prime seems to have a prime nearby by less than twice the mersenne number	LarsNet	Miscellaneous Math	9	2021-09-22 21:43
Primes of the form prime(a)+prime(b)+1=prime(c) and prime(b)-prime(a)-1=prime (c)	Hugo1177	Miscellaneous Math	1	2021-01-05 08:09
Factorization factory	Branger	Factoring	15	2019-09-05 15:03
ARM SVE 2048 bit vector	hansl	Hardware	4	2019-06-07 13:13