il y a quelque temps j=E2=80=99=C3=A9tais tomber sur une news
avec un d=C3=A9fit de factorisation type rsa avec du fric mis en jeux
sauf que je n'arrive pas a mettre la main dessus
The challenges were removed (payment), but that wiki site captures
all of the challenges. If you can break them, you only get bragging right s. ok thank you p*q=m p<q m and an integer so he has a factor smaller than his sqrt x=sqrt(m) (x integer) x1úctoriel(x) pgcd (m and x1) its very fast to calculate the whole problem is to calculate fact (x) or an integer with p I think there may be some way to find the factorial not find yet cdl remy -- http://remyaumeunier.chez-alice.fr/
Le 06/03/2018 à 17:18, amzoti a écrit :
The challenges were removed (payment), but that wiki site captures
all of the challenges. If you can break them, you only get bragging right s.
ok thank you
p*q=m p<q
m and an integer so he has a factor smaller than his sqrt
x=sqrt(m) (x integer)
x1=factoriel(x)
pgcd (m and x1) its very fast to calculate
the whole problem is to calculate fact (x) or an integer with p
I think there may be some way to find the factorial
The challenges were removed (payment), but that wiki site captures
all of the challenges. If you can break them, you only get bragging right s. ok thank you p*q=m p<q m and an integer so he has a factor smaller than his sqrt x=sqrt(m) (x integer) x1úctoriel(x) pgcd (m and x1) its very fast to calculate the whole problem is to calculate fact (x) or an integer with p I think there may be some way to find the factorial not find yet cdl remy -- http://remyaumeunier.chez-alice.fr/
