I heard that protection against cracking opend keis, based on
breaking of bignumbers to its simple co-multiplicators.
Hm. ...beg your pardon for english mathematical lexic,
I sure know it in Ukrainian only :).
Well knowm algorythm :
for (ch=0;((ch<base_pnt) && simple);ch++)
theoretycally allow to find it but in a practice
requaire a lot of memory and a lot of time...
Even not "a lot of" but "fantastical".
Let's look for enother way...
For every positiv integer number (C)
exist at least two positiv integer numbers (A,B)
which for exist equivalence C=A*B;
Sure, if number C is simple one of such two numbers equal to C other to
But in other case (when C is not simple) co-multiplicators (A and B)
lies between 1 and C exceptionaly.
Lets define that exist two integer positive co-multiplicators
of integer positiv number. And shall take that of such co-multiplicators
from all possible which difference between lower as
in any other possible case. (Example for 54 it's 9 and 6 , but not 18
Let name just definition def. #1.
A number is simple when its co-multiplicators which allow to def #1 and
one of them equal to 1 and other one equal. to such number,
If it isn't then we could divide number per it's co-multiplicators,
and its co-mutiplicators for co-multiplicators again and again untill
we won't get a set of simple co-multiplicators.
Rest, is a simple :) but not so , to find a co-multiplicators defined
In simplest case, we could try to get square root from the examinating
And if it was an integer number then it number is equalt
to both of co-multiplicators (A and B)
sqrt(C) is integer
In other case we could try to use such formula:
sqr(X)=sqr(a) + (X+a)(X-a).
Really let's calculate a square (D) of some integer (E)
neares but bigger as number (C),
C >= D
D = sqr(E) (1)
find a difference (between D and C), and try to find square root (F)
Then plus such square root (F) to number E which was a source for square
biger to examinating number (C),
Really, it works.
Let call number F "corrector".
But if number F is not integer, what's then ?
In such case:
D>=C (but D neares to C)
Where G and H are "correctors".
How to find such correctors ?
Good question... :)
Finally I do not know, but ... have some thinks about it.
We could write number I by the same formule which we used for a C :
after second apling of such formula we get somthin like:
after convertion it into multy-member we got somthing longer as I could
in 80-characters line. :)
(And perhaps we have to
look for sqr(b) number equal
to integer in 4-th degree (not sure that translate this term true).)
But I hope that formula sould get difficalter and difficalter,
untill it would allow to unite it in expression and calculate
I hope so, but not sure.
Have you any thinks ?
Good bye there.
P.S. I do not subscribed for this news group, as such for any other
Or call me in Kyiv (aka Kiev) 550-8285 (ask for Misha)
but I speak english worse as write. :)