CRAK CD PROTECTION

2017-12-13T00:12:00.001-08:00

HOW TO CRAK CD PROTECTION TOPIC ( 1)About, Programs needed … etc. (2). The easy protection. (3). Finding the right file – and the right error. (4). Finding the right line number. (5). Editing the line. (6). Testing. (7). Quick order list. STEP ######1that explains all about RiPPing except how to crack the CD protections… so here is the other part – how to finish the RiPPing by cracking the protection. This will help you w/ the most basic system of protection, called C- dilla, that is the most usual one… The programs we will use are 2: first, and decompiler – the files we will work with are in ExE format, and we need a program that will HeX them (transfer to 16 base, hexa, form) and locate the orders given in the code, then we will find the line we need and change it to remove the protection with... – the second program: we need a program that will *edit* the files, and fetch the right line number we got using the first program… all those action are easly done w/ the programs: Win32Dasm (the disassembler - decompiler program, added in the dir [root/Win32Dasm]), and Hiew (the editing program added in the dir [root/Hiew]). The programs are added to the tutorial, because I’m not so sure you can find then on a stable location on the net, in the dir [root/programs].

2017-12-10T21:20:00.001-08:00

Password Cracking

Passwords are typically cracked using one or more of the following methods:

Guessing:

Even with all of the advanced programs, algorithms, and techniques computer scientists have come up with, sometimes the most effective way of cracking a user password is by using logic and/or trying commonly used passwords. For many unknowledgeable users, passwords are more of an annoyance than a security, and therefore they use passwords that can be easily remembered, and thus easily guessed, such as:
The word "password"
The same as the user name
Name of the user
Birthdays or birth places
Relatives
Pets
Favorite colors, foods, places, etc.

This method can be more time efficient than using a program, but obviously this method works best when the person "recovering" the password knows the user. One other thing to keep in mind is that the average user does not like coming up with multiple passwords, so if you can figure out one password for one area, you can usually gain access to most other password protected areas using the same password.

Dictionary Attacks:

Dictionary Attacks are a method of using a program to try a list of words on the interface or program that is protecting the area that you want to gain access to. The most simple password crackers using dictionary attacks use a list of common single words, aka a "dictionary". More advanced programs often use a dictionary on top of mixing in numbers or common symbols at the beginning or end of the guessed words.
Some can even be given a set of personal information or a profile of the user and pick out important words to guess, even if they are not proper words, such as pronouns like last names and names of relatives.
A weakness of dictionary attacks is that it obviously relies on words supplied by a user, typically real words, to function. If the password is misspelled, is in another language, or very simply uses a word that is not in the dictionary or profile, it cannot succeed. Most of the time, even using two words in one password can thwart a dictionary attack.

Examples of programs that use dictionary attacks: John the Ripper, L0phtCrack, and Cain And Abel.

Brute Force:

Brute force password attacks are a last resort to cracking a password as they are the least efficient. In the most simple terms, brute force means to systematically try all the combinations for a password. This method is quite efficient for short passwords, but would start to become infeasible to try, even on modern hardware, with a password of 7 characters or larger. Assuming only alphabetical characters, all in capitals or all in lower-case, it would take 26⁷ (8,031,810,176) guesses. This also assumes that the cracker knows the length of the password. Other factors include number, case-sensitivity, and other symbols on the keyboard. The complexity of the password depends upon the creativity of the user and the complexity of the program that is using the password.
The upside to the brute force attack is that it will ALWAYS find the password, no matter it's complexity. The downside is whether or not you will still be alive when it finally guesses it.
Examples of programs that use brute force attacks: John the Ripper, Rarcrack, and Oracle.

Rainbow Tables

Rainbow tables are a type of precomputed password attack. The previous two attacks, Dictionary and Brute-Force, enter a password into the locked program, the program then hashes the entry and compares the hash to the correct password hash. Rainbow tables compute hashes for each word in a dictionary, store all of the hashes into a hash table, retrieve the hash of the password to be cracked, and do a comparison between each password hash and the real password hash. This method assumes that you can retrieve the hash of the password to be guessed and that the hashing algorithm is the same between the rainbow table and the password. As the majority of common, low-security hashes are computed using MD5, sometimes SHA-1, this problem isn't very worrisome.
Rainbow tables have only become an efficient technique recently, as the hard drive space needed to store the hashes was slightly combersome until memory became cheaper. To give you an idea of how large a rainbow table can be:

SUNDHA MATAJI MANDIR NEW VIDEO

2017-12-04T04:14:00.001-08:00

MOHABBATEIN LUTAANGA

2017-11-21T01:35:00.001-08:00

JUST A FUN FOR EVERY ONE HOW TO HANDEL GIRLFRIEND

2017-11-16T04:18:00.001-08:00

Hacking Universe