(adsbygoogle = window.adsbygoogle || []).push({}); I was going through my SDK and some game files looking at the Black Ops encryption and keys etc. And discovered some useful and odd info. Mostly about the encryption.

I was looking through my 1.92 SDK (Whatever version I have) and navigated to a folder labeled "Hash" and opened it, then opened "Hmac" and read the readme inside of it. And found this.

I do believe from what the string of command/locations with MD5 and SHA-1 hashes, has a limit of 16 bytes or 128 bits, which most likely is the "Public Key"

An Encryption "Hash" reference:
You must login or register to view this content.
As you see it has all the different hashes.

And here is another pic of the t5mp_ps3f.self file with references to hashes such as MD5 and SHA-1.
You must login or register to view this content.
I have the important things highlighted

Now its going to get further more confusing and interesting.

Now we are starting to get into the "Private Key"
For the record I don't know the size of it, mostly because it uses something different compared to MD5 and SHA-1. It uses Tiger

Proof:
You must login or register to view this content.
You can see "Tiger" at the bottom left.

Tiger, which from what I have heard is quite secure. But I would reckon the private key also be 16 bytes, so it would have an encryption of "Tiger/128" but then there is "Tiger2". Which is pretty much godly. I will have links to each reference so everyone can research themselves. But when you research SHA-1 you will notice how many bits it uses.

But next is "PRNG"
You must login or register to view this content.

PRNG is a cryptographic application. I have some copy paste for you guys =D.

**Copy Paste**
A PRNG suitable for cryptographic applications is called a cryptographically secure PRNG (CSPRNG). A requirement for a CSPRNG is that an adversary not knowing the seed has only negligible advantage in distinguishing the generator's output sequence from a random sequence. In other words, while a PRNG is only required to pass certain statistical tests, a CSPRNG must pass all statistical tests that are restricted to polynomial time in the size of the seed. Though such property cannot be proven, strong evidence may be provided by reducing the CSPRNG to a known hard problem in mathematics (e.g., integer factorization). In general, years of review may be required before an algorithm can be certified as a CSPRNG.

Some classes of CSPRNGs include the following:
Stream ciphers
Block ciphers running

***Links & References***
You must login or register to view this content.
You must login or register to view this content.
You must login or register to view this content.
You must login or register to view this content.

**Notes**
When you start to research your going see things saying "SHA-1 is a 160 bits" and what not, but I guarantee that the keys are both 128bits/16bytes.

And when you read up on the PSNG, you will realize that these keys might be random. But no one will know until we cross that bridge.

I also know this is rough, but enjoy reading, and researching and have a cold one!! :beer:

And sorry for the SMALL pictures lol

I need Hunter to be my tutor in all this programming/coding..blah blah stuff. Haha

If you don't agree with hunter, then prove it. Identify the relevant code and how it's used. Then post that assembly up and explain what you've found.

If you can't do that, then you're no hacker. You can mod or glitch, but hacking is programming. And not everyone is cut out to be a programmer. Don't consider this an insult, but a challenge. If you really want to operate at that level then step up your game.

He always says something clever and interesting which no one ever knew about.

Your one of the dick riders I was talking about lol