4D Holographic Encryption with DARTIS©

[AlecSadler]

Hello all, I would like to present my proof of concept work to the autoit forum and community. (I saw this as a concept in a few sci-fi shows and thought I would bring it into real life)

What is it?: DARTIS (Dimensions And Relative Time Information System)© is a 4 dimensional holographic encryption algorithm which uses the current timestamp(measured down to femto seconds) to encrypt data under several layers of calculations. One large keyfile is used and multiple keys are extracted from it, and overlaid on each other to create 1,000,000,000,000,000  unique keys per second. Special thanks to the creator of the matrix maths udf (if this is you please let me know and I will put your name here.) Also special thanks to trancexx for her LZNT compression code.

Please see the following link for the full set of functions and an example debugging application, which shows usage of all the functions.

https://pdglobal.net/?pid=SIM#SIM (DARTIS is packed with SIM)

 

DARTIS is an encryption scheme that extracts a timestamp from the current system time, then splits it up into an array of strings each 4 digits long.

Then those strings are plugged into the 16mb keyfile blueprint, where each 4 digit value represents a 2D array.

Then each 2D array is layered on top of the one that came before it, compressing the data underneath several layers of encryption.

It's 4D because the key is derived from the system time(so the same key will never be used twice)

And it's holographic because the data is buried underneath several layers of data.

The full 16mb keyfile blueprint is required to re-extract the data that has been injected into the holographic keyfile blueprint. (as the values all have to be the same AND be in the same order)

The only downside to this encryption scheme is that the only safe way to distribute keys is by snail mail or in person. (because if you transmit it via the internet, you're limiting the security of your keyfile blueprint to whatever lesser encryption algorithm you;re using to transmit the keyfile blueprint)

Hope I explained it in a way that's easy to understand! If you have any further questions about it feel free to ask! (and/or look around the DARTIS.au3 file to see how this is done, and run DEBUG.au3 to see under the hood)

 

Edited July 18, 2017 by AlecSadler

[iamtheky]

Quote

Also special thanks to trancexx for his LZNT compression code.

"thanks, mind if i call you a dude?"   is what you just said to trance.  Its a ballsy line, lets see how it plays out.

Edited August 28, 2016 by iamtheky

[AlecSadler]

6 minutes ago, iamtheky said:

thanks, mind if i call you a dude?   is what you just said to trance.  Its a ballsy line, lets see how it plays out.

No problem dude! Also I was thanking trance for her algorithm which I used in my code! Thanks for the response.

Edited August 28, 2016 by AlecSadler

[iamtheky]

double down on it   (hint: not everyone who scripts wears a penis)

[AlecSadler]

Oh I forgot trance wasnt a man. oh my, oops! Let me fix that.

[argumentum]

have you tried with $inputx = "Test String, Test String, Test String, Test String, Test String, Test String, Test String" ?
It just won't work.

1 hour ago, AlecSadler said:

a holographic encryption algorithm

what is that and what's the davantage ?

1 hour ago, AlecSadler said:

saw this as a concept in a few sci-fi shows

 What shows ?, I wanna watch them all. 

[AlecSadler]

22 minutes ago, argumentum said:

have you tried with $inputx = "Test String, Test String, Test String, Test String, Test String, Test String, Test String" ?
It just won't work.

what is that and what's the davantage ?

 What shows ?, I wanna watch them all. 

Sorry about that! It appears there is currently a limit to how much data can be encrypted in one go, something to do with the properties of the math I am using. I will look into a way around it!

Holographic encryption buries the data under 6 layers of encryption, making it super secure!

Also the three shows that come to mind which have mentioned such a technology are "Continuum", "StarGate", and "Doctor Who".

[argumentum]

5 minutes ago, AlecSadler said:

"Continuum", "StarGate", and "Doctor Who"

I've watched'em all.  
Thanks 

http://photonicssociety.org/newsletters/oct01/matoba.htm has a nice description. Is that it ?

Edited August 28, 2016 by argumentum

[AlecSadler]

13 minutes ago, argumentum said:

I've watched'em all.  
Thanks 

Okay I got a quick and easy fix to the string length issue. In DARTIS.au3 change the _gravity function to this:

func _gravity($seed)
$array = StringSplit($seed, ";")
Dim $cluster[$array[0]][9]
for $i=0 to $array[0]-1
$temp = StringSplit($array[$i+1], "|")
    for $n=0 to $temp[0]-1
    $cluster[$i][$n] = $temp[$n+1]

    Next
Next

(I've also attached the fix to the main post)

Edited August 28, 2016 by AlecSadler

[AlecSadler]

On 8/28/2016 at 2:36 PM, argumentum said:

http://photonicssociety.org/newsletters/oct01/matoba.htm has a nice description. Is that it ?

Yes this is a fair description of holographic encryption, only DARTIS uses 4(dimensional) keys extracted from the current time-stamp(as opposed to one or two dimensions), which is why the output has 1,000,000,000,000,000 possible configurations per second. (also, obviously, this is a FULLY digital version of the same concept.[as opposed to optical])

Edited November 29, 2016 by AlecSadler

[argumentum]

Does it have a practical use ?, I see the key is 3,977,174 bytes long and split into an array of 10,001 elements. Can I just pass the 6 keys I need from the  1,000,000,000,000,000 possible configurations or do I need the full 3,977,174 byte key ?.
I'd like to give practical use. Even if just once to pass a secret over the internet, say a user/password, then, I'd use some less bulky standard, but the initial handshake of hashes / passwords would be done with this.

[AlecSadler]

3 minutes ago, argumentum said:

Does it have a practical use ?, I see the key is 3,977,174 bytes long and split into an array of 10,001 elements. Can I just pass the 6 keys I need from the  1,000,000,000,000,000 possible configurations or do I need the full 3,977,174 byte key ?.
I'd like to give practical use. Even if just once to pass a secret over the internet, say a user/password, then, I'd use some less bulky standard, but the initial handshake of hashes / passwords would be done with this.

The full 3,977,174 bit key is required because it's holographic, each "layer" is encrypted "through" the layer that comes before it. For this to work both sides would require the full exact matching key, without it, the data will just turn out be useless garbled text. I could see it being useful for transmitting data that needs extreme security, such as banking records, trade secrets, private chats, etc. (currently the key is symmetrical , meaning that the encryption is only as secure as the key, so it would be most secure the transfer they key via non-electronic methods) Once two people or two parties both posses the same full key, they can then communicate any data securely. 

[iamtheky]

Why not just take any 6 keys? How the key is derived matters far more than the bag of dicks I have to choose from.  A 6-dimensional......that encrypts stuff...Maybe @czardas would be nice enough to revisit his cube as it was pretty much that, and gd awesome at it.

[AlecSadler]

1 minute ago, iamtheky said:

Why not just take any 6 keys? How the key is derived matters far more than the bag of dicks I have to choose from.  A 6-dimensional......that encrypts stuff...Maybe @czardas would be nice enough to revisit his cube as it was pretty much that, and gd awesome at it.

The 6 keys are derived from the current system datetime, so the same combination of keys is never used twice. (because the date never repeats itself, doh!). This means that the 6 keys change, as I said,  1,000,000,000,000,000 times per second, that's what makes it so secure.

[jchd]

How is that more secure than the OTP?

Anyway, the big, big, huge issue with this kind of schemes is the distribution of keys.

[iamtheky]

The key changing and being random (and being used in multiple) is what makes it secure. The frequency offers little benefit if I am typing in six unique keys everytime,  Doing something more doesnt mean i needed you to do it more.

 If the chameleon changes 12 colors before it changes to the one that matches the background, thats cool, but I only needed the last part. 

Edited August 28, 2016 by iamtheky

[jchd]

9 minutes ago, AlecSadler said:

The 6 keys are derived from the current system datetime, so the same combination of keys is never used twice. (because the date never repeats itself, doh!). This means that the 6 keys change, as I said,  1,000,000,000,000,000 times per second, that's what makes it so secure.

That isn't possible on commonly available hardware, e.g. your PC. The timestamp doesn't have fs precision so the number of key changes per second is magnitudes smaller. But that isn't important, unless a study shows that there are only a small number of ticks per second on a PC, which is the case. So decrypting a random plaintext would amount to try only a relatively small number of keys. OTPs don't have this flaw.

Edited August 28, 2016 by jchd
spelling!

[AlecSadler]

10 minutes ago, jchd said:

That isn't possible on commonly available hardware, e.g. your PC. The timestamp doesn't have fs precision so the number of key changes per second is magnitudes smaller. But that isn't important, unless a study shows that there are only a small number of ticks per second on a PC, which is the case. So decrypting a random plaintext would amount to try only a relatively small number of keys. OTPs don't have this flaw.

Yes I am aware of the limitations for time calculation on pcs, please see my code to better understand what I mean! (this is very much like OTP, only it's always rotating forwards as opposed to only when in use) If I am misunderstanding what you say please correct me, but my code is as far as I see, able to poll that many possible outcomes for every second, not just a few. (because it uses a timer in combination with the system time)

 

Edit: I am aware that only a few keys may be polled from the selection of available keys every second, but the number of available keys to be polled is much larger, so trying to decrypt with only a few of those possible keys would lower your chances at decryption severely.

Edited August 28, 2016 by AlecSadler

[AlecSadler]

26 minutes ago, iamtheky said:

The key changing and being random (and being used in multiple) is what makes it secure. The frequency offers little benefit if I am typing in six unique keys everytime,  Doing something more doesnt mean i needed you to do it more.

 If the chameleon changes 12 colors before it changes to the one that matches the background, thats cool, but I only needed the last part. 

It's not "random" it's "temporal", so as to make sure the same key is never derived twice. I don't mean that it changes randomly that many times, I mean it has that many possible outcomes to be factored for.

Edited August 28, 2016 by AlecSadler

[iamtheky]

Quote

It's not "random" it's "temporal", so as to make sure the same key is never derived twice.

 

So in theory:  its the last hour before DST, i fire up your script.  2:59 i restart. bam its 2 a.m. the same day again, 'Groundhog Hour', do i get to run replay attacks for the next 59min?