![]() |
![]() |
How does encryption work?
When you use encryption, your data gets converted into meaningless symbols by using a key, which is nothing but the algorithm that helps you to encrypt or decrypt data.
The more random the method of key conversion, the stronger the encryption will be. A pass phrase (or password) generally needs to be easy to remember, so it has significantly less randomness than its length suggests. For example, a 20-letter English phrase, rather than having 20 x 8 = 160 bits of randomness, only has about 20 x 2 = 40 bits of randomness.
So, cryptographic software converts a pass phrase into a key through a process called 'hashing'' or 'key initialization'.
At the heart of the process is the algorithm (or method), which is devised so as to make deciphering the encrypted file impossible without using the secret key. Some of the popular encryption algorithms include Blowfish, DES, Diffie-Hellman, IDEA, RC4, RSA and Skipjack. Many of these use 64 and 128-bit encryption systems i.e. devise keys of 2*64 or 2*128 length.
The Blowfish encryption algorithm on which CryptoExpert is based, was specially designed to encrypt data on 32-bit microprocessor. It is significantly faster than DES and GOST when implemented on 32-bit microprocessors, such as the Pentium or Power PC.
Is encryption really safe?
An ordinary user may find it difficult to unscramble even a simple algorithm. However, experts using sophisticated methods can employ a number of means to break an algorithm. The most common of these is "brute force" wherein a number of computers are simultaneously employed to break the code by a "trial and error" system which physically checks all possible combinations (or possible passwords).
However, a well developed encryption system can withstand even such brutal attacks. Encryption based on the algorithms mentioned above are generally immune to these kinds of attack assuming that no backdoors (or bugs) exist in the program. Calculations show that the period of time required to crack them through brute force is gigantic (at times in the range of thousands of years).
Statistically speaking, if 100 billion computers are used to break a 3DES (three 64-bit keys used together on a single password) key using brute force, they would need to process data continuously for an approximate of 457,351,814,728 years.
I'm sure that clears up any remaining doubt about the effectiveness of ciphers or encryption as a whole.
![]() |
![]() |



Report abuse