![]() You can see very clearly the impact of the length of the password and the use of different character groups on the security of a password. This results in the following calculation examples without considering other factors, such as dictionary attacks: Possible combinations = possible number of characters Password length The number of possible combinations is calculated using the following formula: When creating a password, the following characters are usually available: In the calculation examples, a generation of 2 billion keys per second is expected, since this corresponds approximately to the speed of a very strong single computer. Some examples of calculation will illustrate the interaction of length and used characters for the security of a password. ![]() ![]() Older projects in this organization cracked a 56-bit key within 250 days and a 64-bit key within 1,757 days. Since several users make their computer capacities available for this project, currently (as of May 8, 2012) more than 800 billion keys per second can be generated. For this purpose, all possible keys are tried out until the appropriate key is found. The aim of the project is the decryption of a message, which was encrypted with a 72-bit key. The Projekt RC5-72 of the organization shows how fast passwords can be decrypted. The method is often used successfully in practice, as many users use short passwords, which often consist only of the letters of the alphabet, drastically reducing the number of possible combinations and making guessing easier. The attacker usually uses a high-performance computer, which performs a great deal of calculations per second and, accordingly, can test a high number of combinations in the shortest possible time. The algorithm is very simple and is limited to trying out as many character combinations as possible, which is why it is also called "exhaustive search". Brute-force attacks are carried out by hackers who try to crack a password by simply trying out different combinations of characters in quick succession. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |