![]() |
|
#16
|
||||
|
||||
|
Quote:
![]() Quote:
It can only be a result of collision in hash.Otherwise you won't be able to read messages encrypted with RSA - because they could have few meanings What about MD5 - actually now MD5 is definitely not safe (because of this MD5(x)=MD5(y) => MD5(x+z)=MD5(y+z) ). You can check out this article: Code:
http://www.codeproject.com/dotnet/HackingMd5.asp Quote:
Quote:
In this file you put all your numbers that you would like to factor in decimal notation (base-10) like this: Code:
224723992774119006825578513302384489873 156501211667442645087401128910164446481 119399008393514320049994534947283967297 211087890988599145775593649671167343561 222924203035635853575650313518923532737 Code:
ppsiqs.exe < ppsiqs.in |
|
#17
|
|||
|
|||
|
I am receiving "unknown function"
My OS is Windows XP Pro SP2, i seen in the .txt file included * Environment OS : Windows 95 Windows 98 Windows NT4.0 Windows 2000 |
|
#18
|
|||
|
|||
|
Quote:
For example let's factor number Code:
E7C8A74C73FD2FBAC4F42216DFA687C1 Code:
308093519617663552837864268966148868033 Code:
Input number ( input 0 to exit ) E7C8A74C73FD2FBAC4F42216DFA687C1 unkown function E7C8A74C73FD2FBAC4F42216DFA687C1 Code:
Input number ( input 0 to exit ) 308093519617663552837864268966148868033 PPSIQS Ver 1.1 by S.Tomabechi 2001 C39=308093519617663552837864268966148868033 #FactorBase 512 max FactorBase 7867 max LargePrime 288950 Upper Bound 5251270668 SieveWidth 12288 SieveUnit 12288 CutOff 71 multiplier 1 To stop sieving, press Ctrl + Pause 458(640)/544 search cycles 102 duplicated data merged in Large Prime 56 duplicated data merged (f) type 458 total 631 (p) type 1523( p_p 229, p_p_pp 0, p_p_p_p_pp_pp 0) (pp) type 0( pp_pp 0, pp_pp_pp 0, others 0) block Lanczos method #singleton 29 : zero-weight columns 6 477*515 matrix 16.1363 entries / row nonzero entry 7697 memory 31K #iteration 16 gained 32 solutions 0:00:00:07 found factor 18014544488287572347 cputime 0:00:08:73 t et 60 6814407600 Jacobi Sum Test ( APR-CL ) for P=2 Q=3 5 7 13 11 31 61 for P=3 Q=7 13 31 61 for P=5 Q=11 31 61 final test t et 60 6814407600 Jacobi Sum Test ( APR-CL ) for P=2 Q=3 5 7 13 11 31 61 for P=3 Q=7 13 31 61 for P=5 Q=11 31 61 final test
|
![]() |
|
|
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Idenitfying a cryptographic algorithm | wassim_ | General Discussion | 1 | 07-15-2020 22:15 |
| Public White-Box Cryptographic Implementations and their Practical Attacks | TechLord | General Discussion | 8 | 12-20-2016 08:03 |