CodeCrackerSND's repositories
MixedAssemblyLoader
load mixed assemblies (.NET) C# source code
CRCCracker
Change 4 bytes at the end of file to get desired CRC32
OpenFileOrFolderDialog
OpenFileOrFolderDialog in C#, add a reference to OpenFileOrFolderDialog.exe, and use OpenFileOrFolderNamespace namespace, class OpenFileOrFolderDialog.
DEXPatcher
DEXPatcher - apk reflection using dexlib
MD5_Fast_Col
generate two blocks with same MD5 hash
LongPathTool
remove long paths under Windows
PascalTriangle
PascalTriangle - Pelles C compiler
AssemblyLoadHoocker
It will change entry point and inject MessageBox.Show, it will work only for Assembly.Load(byte[] bytearray).
FOperations
Compute F = A xor (B or (Not C)) ; get C bitmask from same formula knowing F, A, B
JarSearchAndReplace
Search and replace in jar file. Nebeans Java project
SumOf2Powers
Calculate a,b from formula a*2^power1 + b*2^power2 = value
gBurnerx32Mount
Masm x32, load exe using LoadLibrary, then rebase exe: fix .code, .data and .rdata sections, fix imports
gBurnerx64Mount
load x64 exe using LoadLibrary, then rebase exe: fix .data and .rdata sections, fix imports, no fixes needed for code section
hexpandHashes
hexpand Hashes - include source code of md5, sha1, sha256 and sha512
LinearDiophantineEq
ill solve equation a*x+b*y=c , where x and y are integers
SumGenerator
given the sum result generate n numbers which have that sum; - generates both integers numbers and double(real) numbers; - Possibility to specify minim value
TurboMutipleExes
Create mutiple entry points for Turbo Studio
GenerateBigPrimes
Original project here: http://codes-sources.commentcamarche.net/source/11353-generateur-de-grands-nombres-premiers-plus-de-cent-chiffresAuteur the project uses naive multiplication approach, so isn't fast!
lqm_to_text
Converts LG's QuickMemo lqm note files into text (txt) files
Modulo2Simplificator
Modulo 2 equations simplificator
SimpleFactorize
Test if a number between 0 and 4294967295 (0xFFFFFFFF) is prime