Behind the scenes :  XCRYPT 1.0

This is Xcrypt 1.0 "How it works?" section. For more info regarding Please mail us with your query in the subject line.

Xcrypt works based on the symmetric key algorithm . It has been optimized to run fast by using the XOR technique. Before we go on any further it is necessary that we completely digest the meaning of the above given two concepts.

Symmetric key algorithm

Symmetric key algorithm as it's name suggests uses the same key for both the encryption and decryption process. The key is a string of alphanumeric characters. This algorithm is fast and effective . It is also clean and easy to implement. One drawback is the lack in security because the key has to be transmitted to the other end. But in this software the problem of secure transmission of the key has been handled. 

Now we have to understand how the key is used to encrypt and decrypt the message. The message is used as a mask . It masks the data during encryption and unmasks the cipher data to get back the original unencrypted information. Exactly how the key is used for masking and unmasking depends on the implementation . In Xcrypt the XOR binary operator was used for this purpose. The choice for XOR was made because of its efficiency and simplicity of usage.

Now let us understand what XOR is and how it can help us mask data.

 

The XOR binary byte operator.

XOR is a binary bitwise operator which is implemented in all digital processors and is thus highly efficient when used  , even from High Level Language like Visual Basic . 

Let us assume two numbers A = 45 and B = 78.

The binary representation for Variable A is 00101101
The binary representation for Variable B is 01001110

Xor'ing these two numbers will look like this

         

Let the value be C . which is equal to 99.

Now assume we forgot the value in A . A= ?? . But we still remember the values of B and C. To get back A's value which we forgot just now we perform a simple operation.

          

Thus we understand that when we Xor the new value ( C that we obtained from the previous Xor operation ) with B , we get back A's value. This is the basic operation style of the XOR operator . Now let us come to the point of how XOR is used in Xcrypt . Assume A is the original highly confidential information , B is the key or password . When we XOR A with B we get C where C is the encrypted information . This encrypted data i.e C, is sent to the other end. At the other end A actual information is desired . However only the encrypted data (C) and the key (B) exist at the other end. So we apply the second XOR operation (C XOR B) to get back actual information .Exactly how the key is handled and how an entire file is handled is explained in detail later.

Symmetric Encryption Technique implementation in Xcrypt 1.0

Now we understand what Symmetric encryption and XOR mean and how they work. In this section we go on to understand how these two techniques are applied in Xcrypt 1.0

Consider the following text as the highly confidential data that has to be encrypted.

' Warning Warning Sector B Sect 445 Sind area , Enemy planes advancing fast , will reach Sector B in 65 mins . Prepare anti aircraft guns . Top secret code for activation is XDF98KSWE334 , OVER '

Consider that the key to be UDLOP23KDD82.

Now we have to use the key to encrypt this text . We can mask the text with the key . To get a better idea of what 'masking' means let us have a look at this figure.

As you see, the text is masked by using the key repeatedly. This is because the key is smaller than the text to be encrypted. In reality masking will be done using XOR . How it is done is the next topic of discussion.

When we mask the text with the key using XOR we are repeating the process of XOR for a single charachter( As we have seen already) many times.

To get back actual text we apply the 2nd XOR operation.

The encrypted data obtained from the above operation on the input text is as follows

'a6n%n( a@nZn, e'tWrBuS!c8 {4e ai]dka6e%  wn0m= <l.n5saWv*n'i*gfSs! h ;i#lprWaPhkS!c0oJ p <nd6y "i>s.P9e4a6ea\t< %i>c=a6tgFn8 j oH Ae6r!tlc d5 ToA *c0i2aLi]nui7 D 9hKaWv3x4d,dOnE`'

 

How Xcrypt scores over other software?

Xcrypt 1.0 does not use an ambitious alogirthm , but it does use some innovative ideas that have been developed after giving much thought to how a hacker would try to crack encryption algorithms . Professional hackers can break open any available program ( In fact some can generate source from the compiled application ) and they can clearly understand what's going on in the program. Any passwords that are stored in the memory , file or any kind of passwords checks are easily intercepted by such hackers . To avoid such a situation Xcrypt does not make any password comparisons , it does not store the key anywhere. Thus once the file has been encrypted , nobody can decrypt it without the key. They might try and guess a part of the key , but even then the resultant decrypted file will be very close to absolute junk. Here is an example . Consider the confidential text given in the previous section. Also consider the same key. We shall see that decrypted file , if the key is UDLOP23KDD instead of UDLOP23KDD82 . ( the last two characters have been removed)

Warning Warning SectrVB9Snch I4V *id/acea X 8n`m lenqsVavnnkiegHfas # igl%rah$Sqcoy ; xn 6, firs].CP ea}e\ati aircraft guns . To ezrnt<cd o nceiva in%i 'DB9,K%W#3<4(,+O>ER

As you can see , even when the hacker guesses the key to a great deal of accuracy , most of the text is still safe. Let us now check the security with this key NIWKD872KKD instead of UDLOP23KDD82 .

Lanrnc Caxnmn \eltr\B<Svcs ?4] Viod a}ea Z >ngmv xlns avancidgQfsj , ilBrah/Socyo ; xn\6N iusY.WPwe}aaeSat i cva}tVgnq = [o yert'ckdq o }c{ivatijnGi| _DM9&K(W!334 ,\OYER

Thus we know that data that is encrypted by using Xcrypt is quite safe and unhackable as long as the key is protected well.

The speed at which Xcrypt encrypts is 246.97 KB/s

System specs on which this test was done.
Intel Celeron processor
Clock speed : 266 Mhz
32 MB RAM
IDE Harddisk - Seagate
Windows Me

If you think this is fast , then we have something more for you!

Xcrypt made around 3.0 MB/sec encryption a system with the following specs
Intel Pentium III
Clock Speed : 850 Mhz
256 MB RAM
IDE Harddisk - Seagate
Windows 2000 server

The speed at which Xcrypt decrypts is 288.950 KB/sec

System specs on which this test was done.
Intel Celeron processor
Clock speed : 266 Mhz
32 MB RAM
IDE Harddisk - Seagate
Windows Me

Xcrypt made around 3.5 MB/sec encryption a system with the following specs
Intel Pentium III
Clock Speed : 850 Mhz
256 MB RAM
IDE Harddisk - Seagate
Windows 2000 server

Copyright 2000 . Vaspra group