mersenneforum.org  

Go Back   mersenneforum.org > Search Forums

Showing results 1 to 25 of 504
Search took 0.05 seconds.
Search: Posts Made By: Alberico Lepore
Forum: Alberico Lepore 2021-08-02, 08:41
Replies: 16
Views: 1,937
Posted By Alberico Lepore
unfortunately this is not true. But x is...

unfortunately this is not true.


But x is very close to min_range_x

I tested on a number of 30 digits with p and q of 15 digits and the result is 37

N=188723059539473758658629052963
Forum: Alberico Lepore 2021-08-01, 13:48
Replies: 16
Views: 1,937
Posted By Alberico Lepore
check=0 i=0 while(i<10) { solve...

check=0

i=0

while(i<10) {

solve this system

sqrt(N/((10+i)/10))=a
,
Forum: Alberico Lepore 2021-07-31, 10:20
Replies: 16
Views: 1,937
Posted By Alberico Lepore
If we establish how far x can be from the...

If we establish how far x can be from the capofila at mos (order size)t, here

r=71501
,
r=(2*h+sqrt(32*h+81)+9)/2-(2*h-sqrt(32*h+49)+7)/2
,
(2*x-sqrt(32*x+1)-1)/2<h<(2*x+sqrt(32*x+1)+1)/2

...
Forum: Alberico Lepore 2021-07-30, 17:55
Replies: 16
Views: 1,937
Posted By Alberico Lepore
i=0 while(i<10) { solve this system and...

i=0

while(i<10) {

solve this system and memorize y(i) and r(i)

sqrt(N/((10+i)/10))=a
,
((10+i)/10*a+a-4)/8=x
,
Forum: Alberico Lepore 2021-07-30, 16:11
Replies: 16
Views: 1,937
Posted By Alberico Lepore
(*) here I have to improve, multiplying the range...

(*) here I have to improve, multiplying the range by 10 ^ (tot), but I still don't know tot
Forum: Alberico Lepore 2021-07-30, 13:19
Replies: 16
Views: 1,937
Posted By Alberico Lepore
range ok h >=1 I tried to write the...

range ok h >=1


I tried to write the pseudo code

i=0

while(i<10) {

solve this system and memorize y(i) and r(i)
Forum: Alberico Lepore 2021-07-30, 11:01
Replies: 16
Views: 1,937
Posted By Alberico Lepore
maybe i quantified the r number in red red...

maybe i quantified the r number in red

red value = r

N=188723059539473758658629052963
,
sqrt(N/(18/10))=a
,
(18/10*a+a-4)/8=x
,
Forum: Alberico Lepore 2021-07-30, 09:10
Replies: 16
Views: 1,937
Posted By Alberico Lepore
yes, I'll try to explain myself better ...

yes, I'll try to explain myself better

knowing that the ratio q / p <2 then I will test:


q / p
>

1
Forum: Alberico Lepore 2021-07-29, 19:25
Replies: 16
Views: 1,937
Posted By Alberico Lepore
@CRGreathouse I know you don't talk to me anymore...

@CRGreathouse I know you don't talk to me anymore but I have achieved an extraordinary result with your number

N=390644893234047643

sqrt(390644893234047643/(15/10))=a
,
(15/10*a+a-4)/8=x ...
Forum: Alberico Lepore 2021-07-28, 20:02
Replies: 16
Views: 1,937
Posted By Alberico Lepore
use m not 2*m here...

use m not 2*m here https://www.academia.edu/50318218/Crypto_factorization_example

15 digit 3194383
12 digit 63245
9 digit 3195


p= 9 digit

[2*(h-1)*((h-1)+1)]
Forum: Alberico Lepore 2021-07-25, 10:14
Replies: 16
Views: 1,937
Posted By Alberico Lepore
with a parallel distribution on many computers,...

with a parallel distribution on many computers, finding p and q takes as long as possible
Example on 10 computers for n = 390644893234047643 would take 16150 cycles or 1615 for each computer
Forum: Alberico Lepore 2021-07-24, 21:10
Replies: 16
Views: 1,937
Posted By Alberico Lepore
Hello Unfortunately O((log_2(n))^2) does...

Hello

Unfortunately
O((log_2(n))^2) does not work
O(2*(log_2(n))) does not work
It would seem that O(K*[sqrt(8*sqrt(n)-31)-1]/16) work
K depends on the number n

I still don't know the order...
Forum: Alberico Lepore 2021-07-22, 11:25
Replies: 16
Views: 1,937
Posted By Alberico Lepore
the new theory applied to Lepore Factorization...

the new theory applied to Lepore Factorization nr. 105
If the theory is correct to factor RSA with q / p <2 it would seem O ((log_2 (n)) ^ 2) but I am studying how to implement it in O (2 * (log_2...
Forum: Alberico Lepore 2021-07-20, 12:15
Replies: 16
Views: 1,937
Posted By Alberico Lepore
I tried to implement it without good results ...

I tried to implement it without good results

https://github.com/Piunosei/Lepore-factorization-nr.-105-Bruteforce-/blob/main/lepore_105.c
Forum: Alberico Lepore 2021-07-17, 19:29
Replies: 16
Views: 1,937
Posted By Alberico Lepore
/* This algorithm is generic and does not...

/*
This algorithm is generic and does not exploit that q / p < 2

Plus it uses a single A and not many A
*/


A=9+16*a;//choose A with many small factors

if(M % 4 ==1){
Forum: Alberico Lepore 2021-07-17, 07:20
Replies: 16
Views: 1,937
Posted By Alberico Lepore
ERRATA CORRIGE [2*(x-1)*((x-1)+1)] <...

ERRATA CORRIGE

[2*(x-1)*((x-1)+1)] < [2*x*(x+1)-y*(y-1)/2] <= [2*(x)*(x+1)]

1 <= y < (sqrt(32*x+1)+1)/2
Forum: Alberico Lepore 2021-07-16, 13:03
Replies: 16
Views: 1,937
Posted By Alberico Lepore
Lepore factorization nr. 105 (Bruteforce)

https://www.academia.edu/49978974/Lepore_factorization_nr_105_Bruteforce

What do you think?
Forum: Alberico Lepore 2021-07-13, 14:43
Replies: 3
Views: 1,332
Posted By Alberico Lepore
I've tried again Lepore Factorization nr.88 ...

I've tried again

Lepore Factorization nr.88

another photo for my net-friends
Forum: Alberico Lepore 2021-07-10, 14:22
Replies: 3
Views: 1,332
Posted By Alberico Lepore
How to bypass the difficulty of factoring an RSA...

How to bypass the difficulty of factoring an RSA number

I've tried again

Lepore Factorization nr.88
Forum: Alberico Lepore 2021-05-11, 17:36
Replies: 3
Views: 1,332
Posted By Alberico Lepore
free copy @CRGreathouse your number ...

free copy



@CRGreathouse your number
https://mersenneforum.org/showthread.php?t=25929


390644893234047643
Forum: Alberico Lepore 2021-05-09, 09:14
Replies: 3
Views: 1,332
Posted By Alberico Lepore
Lepore Factorization nr.88

I've tried again

Lepore Factorization nr.88

https://www.academia.edu/48848013/Lepore_Factorization_nr_88
Forum: Alberico Lepore 2021-05-06, 21:26
Replies: 5
Views: 1,383
Posted By Alberico Lepore
p(x, y) = a + bx + cy + dxy ; X*Y < W^(2/3δ)...

p(x, y) = a + bx + cy + dxy ;

X*Y < W^(2/3δ) ;

W = max{|a|, |b|X, |c|Y, |d|XY }

we can easily choose | d | XY of the order size N ^ 2 and X * Y of the order size of N.

that is the problem?
Forum: Alberico Lepore 2021-05-05, 08:51
Replies: 5
Views: 1,383
Posted By Alberico Lepore
can we use the Coppersmith method multivariate in...

can we use the Coppersmith method multivariate in this case?


(8*a*b-65*a-67*b+5) mod 319 = 0

(25*a+11)*(27*b+1) mod 1763 = 0
Forum: Alberico Lepore 2021-05-04, 21:25
Replies: 5
Views: 1,383
Posted By Alberico Lepore
(65-8 * b) * (67-8 * a) -1763 = 0 -> ...

(65-8 * b) * (67-8 * a) -1763 = 0
->
(8*a*b-65*a-67*b+324)=0 which is irreducible

pag 3
http://www.crypto-uni.lu/jscoron/publications/bivariate.pdf
Forum: Alberico Lepore 2021-05-04, 09:32
Replies: 5
Views: 1,383
Posted By Alberico Lepore
At least see if I understand: in my case...

At least see if I understand:


in my case given two polynomials

for example

(25*a+11)*(27*b+1) mod 1763 ==0

and
Showing results 1 to 25 of 504

 
All times are UTC. The time now is 14:48.


Sat Oct 23 14:48:33 UTC 2021 up 92 days, 9:17, 0 users, load averages: 2.04, 1.70, 1.40

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.