7
,,Technology of the Future” DEFENCE AND SECURITY TECHNOLOGY DEVELOPMENT CENTER - DSTDC “BCS” ENCRYPTION

BCS algoritmus

Embed Size (px)

Citation preview

Page 1: BCS algoritmus

,,Technology of the Future”

DEFENCE AND SECURITY TECHNOLOGY

DEVELOPMENT CENTER - DSTDC

“BCS” ENCRYPTION

Page 2: BCS algoritmus

SECURITY & DEFENCE TECHNOLOGY DEVELOPMENT CENTER

BASIS OF THE BCS SYMMETRIC ALGORITHM

Introduction:

Unlike the symmetric cryptographic procedures used nowadays the definition of the algorithm has been

approached on a different way. The symmetry is given also here, that means that the decrypting and

encrypting of data happens on same way. In this aspect it is similar to the nowadays used symmetric

encrypting but the thematic of the algorithm is significantly different from the nowadays used

algorithms.

According to my knowledge the prevalent method in the world is that the key caries out operations with

the incoming data according to a predetermined “thematic”.

The succession and the value of the operations are defined by the key. The length of the key determines

the amount of the data which can be encrypted and this amount is limited due to the size of the key.

Summarized and a little bit forced the above enunciation is more or less true for the symmetric

cryptographic methods in use nowadays.

Contrary to the above the algorithm used by BCS uses the key on a way which is different from the one in

use nowadays. The BCS algorithm mixes and/or replaces the data to be classified not on the way

according to the values defined in the key.

The BCS algorithm starts to change the incoming key. It can be understood also as a kind of key

generator, I call it “mutation and I will continue to call it so from now on”. Due to the fact that the

algorithm continuously modifies the key, even at times when there is no encrypting, it will be generated

an “it depends on the hardware in which it is used” key on certain mechanic cycles.

Also at encrypting after each Byte coming for encrypting there will be generated a new key and the next

Byte arriving for the following encrypting will be encrypted with a new key. This solution ensures that we

can encrypt a key independent size of data volume.

In our case in the situation of an algorithm which works with a 4096 bit key the encrypted data volume

can be from 1 Byte to 2854495385411919762116571938898990272765493248 Bytes at the same time.

One and the same key will not repeat twice during the mutation because always a new key be will gener-

ated.

DEFENSE AND SECURITY TECHNOLOGY

“BCS” ENCODING ENCRYPTION TECHNOLOGY

1

SECURITY & DEFENCE TECHNOLOGY DEVELOPMENT CENTER

Page 3: BCS algoritmus

It is enough to place to the beginning of the encrypted material the serial number generated by the

algorithm during the mutation, which is in this case 40 Byte. The algorithm key will be calculated

“symmetrized” from the 40 Byte and the encrypting starts. It is no need to encrypt the 40 Byte placed to

the beginning of the encrypted material because it can be used only when the key is known, otherwise

not, and also the key cannot be calculated from it!

Some doctrines of the BCS Symmetric Algorithm:

Basic doctrine valid for all crypto methods is that the cryptographic procedure must be unbreakable even

if the algorithm is known!

First doctrine:

The method shall be suitable for the process- and block encryption.

Second doctrine:

The algorithm shall be simple, quick and shall contain few calculations.

Third doctrine:

The strength of the crypto shall not depend of the hardware which means that in the 8 bites

microcontroller it must be possible to achieve the same security level as in the case of those of 32 bites.

Fourth doctrine:

After learning the algorithm it must be clear also for a person with no experience in cryptography why it

cannot be broken.

Fifth doctrine:

Byte-level electronic signature.

Particularity of the BCS crypto solution

Without claiming completeness, the above doctrines are for me the most important principles.

First doctrine:

There is no need for special explanation to the first doctrine. In my opinion the implementing of the

process encrypting is the most difficult; this is why I made the test program in this form.

The simple version of this algorithm resisted successfully to the breaking tentative in an 8051

microcontroller.

In knowledge of the ingoing and outgoing data they couldn’t break it not even at nearly 1MIPS command

running speed!

As previously already mentioned I achieved this algorithm in a microcontroller with architecture 8051 of

type ATMEL 89S8252, this meets the criteria of the third doctrine.

DEFENSE AND SECURITY TECHNOLOGY

“BCS” ENCODING ENCRYPTION TECHNOLOGY

2

Page 4: BCS algoritmus

You may see from this that the algorithm feels perfectly good also in the resources of a much more

modest hardware.

The device of above construction in 2006-2007 was involved in a 4 months lasting unsuccessful hacking

attempt at a Hungarian official body where the fact has been found and recorded that the hacking

attempt was unsuccessful. This hardware has encrypted and decrypted complete files and while

decrypting on byte level has checked if action has been taken or data modification occurred in the

codified material.

The now implemented test hardware is suitable for the encrypting of data regardless of size; it can be

fully tested with this architecture on each level!

Second doctrine:

I created a definition for the algorithm, which is fully true: “as simple as a nail”

The algorithm uses at encrypting and decrypting two keys with the sum of 4096 bits, which are

continuously changing, “mutate” according to the algorithm. The keys are working asymmetric to each

other, in order to increase the safety.

Both the encrypting and decrypting consist of analogous process line.

The role of the second key is the increasing of the safety and the making impossible of the decryption.

I understand this as below:

In my cryptographic method the only difference between the incoming and outgoing byte is that I carry

out xor operation with one element of the key one and then I carry out xor operation with one element

of the second key.

Let’s see the formula:

Incoming Byte xor One Element Of Key One = Partially Encrypted Byte

IB xor OEOKO = PEB

Partially Encrypted Byte xor One Element Of Key Two = Final Encrypted Form

PEB xor OEOKT = FEF

You may see from the above context that if I would have one key and I would carry out the xor operation

with it, based on the incoming and outgoing values I could easily calculate the key element with which I

carried out the xor operation. But as it makes xor operations also with one element of the second key the

outcome of this will be the outgoing encrypted value. Due to the fact that the incoming value is xorized

with two values, it is not easy at all to determine it.

DEFENSE AND SECURITY TECHNOLOGY

“BCS” ENCODING ENCRYPTION TECHNOLOGY

3

Page 5: BCS algoritmus

With the “mutations” of the keys the algorithm ensures that the elements of the two keys will newer

meet again in the next billions of years!

This is one of the cornerstones of the unbreakable feature.

The other cornerstone which ensures the unbreakable feature already refers to the forth doctrine: not

every element of the key takes part in the encrypting.

On the effect of the algorithm some values are removed from the encrypting process and are replaced by

other values.

After a while these values return back – it is impossible to build up a thematic according to which after

several encrypting of a homogenous material we look at the

relations and draw conclusions. We cannot calculate in advance what will come into respectively what

will go out from the key with which the algorithm encrypts. This can be understood as a kind of

“time lock”. Of course, it is not to be understood with a nowadays usual solution but the elapsing time

under the effect of the algorithm “mutates” newer and newer keys which are complete different from

the initial key.

The algorithm doesn’t stop during encrypting; it “mutates” the key after each byte and encrypts the next

byte with the new key and it increases the non-breakables on this way.

The number of the key variants:

The definition of all possible keys has required the use of the mathematic program PARI/GP.

The calculation was made to 4096 bit key.

This can be downloaded under: http://pari.math.u-bordeaux.fr/download.html

The number of the possible keys is:

The number of the possible mutations of 1 pair of keys from above keys is:

Byte-level electronic signature – fifth doctrine:

This solution is also based on simplicity. Due to the fact that the “mutations” of the keys are going on also

during the encrypting, the incoming byte is encrypted twice in series. The disadvantage of this is the fact

that as encrypted data there is generated the double of the incoming data, but on “something for

something” basis we get a protection on byte level.

During the decryption we decrypt the encrypted pairs and than we compare them. If these are matching

that means that there was no data alteration. If these are not matching we make a mention that the

encrypted material is not free of trouble on file or byte level.

DEFENSE AND SECURITY TECHNOLOGY

“BCS” ENCODING ENCRYPTION TECHNOLOGY

4

Page 6: BCS algoritmus

In our case a byte level hint is enough because if somebody takes away or puts something to the

encrypted part the following bytes will be all erroneous: “avalanche effect”.

In case the person deletes two pairs of code and writes two bytes instead on tricky way, only the two

bytes will be marked where the manipulation tentative was made. Modification can occur also under the

effect of an electric noise during data transmission, this error filter function is useful at digital picture or

sound transmission, bank transactions.

The above description is only informative a without claiming completeness, and gives a look into the BCS

algorithm.

From this brief and not expressed professional description you may see the difference face to the

algorithms used nowadays.

5

DEFENSE AND SECURITY TECHNOLOGY

“BCS” ENCODING ENCRYPTION TECHNOLOGY

Page 7: BCS algoritmus

THANK YOU FOR YOUR INTERESTING!

DE

FE

NC

E A

ND

SE

CU

RIT

Y T

EC

HN

OL

OG

Y S

OL

UT

ION

SD

EF

EN

CE

AN

D S

EC

UR

ITY

TE

CH

NO

LO

GY

SO

LU

TIO

NS

HEADQUARTER

The VEGH SYSTEM made from the Defence and Security

Technology Development Center in Hungary which member of

the PSA International Group™.

The PSA International has registered office there is in United

Kingdom, but its operates overseas and there are has a local

regional offices and representations around the globe.

If you have any question, please call or write an email to our

headquarters and contact team.

DEFENCE AND SECURITY TECHNOLOGY DEVELOPMENT CENTER:

PSA INTERNATIONAL - DSTDC

Phone: +44 (0) 751 872 3920 UK

+36 70 410 9955 HU

E-mail: [email protected] Recruitment: [email protected] Web: www.tccs-international.org

Regional Distributor or Contact Person details.

DEFENSE AND SECURITY TECHNOLOGY

“ECS” ENCODING ENCRYPTION TECHNOLOGY