Data Security Using TDMRC Code

1
Data Security Using TDMRC Code

• Dr. Varghese Paul
• Head, Information Technology Department
• Cochin University of Science and
  Technology

2
How data security is achieved ? - Access
Control Methods - Encryption Methods
3
Access Control can be by - Password
Matching - Biological Identification -
Firewall Methods
4
Encryption can be Symmetric Key
Type Asymmetric Key Type
5
Again Encryption may be by Substitution
by Transposition
6
Substitution may be Mono Alphabetic
Type Poly Alphabetic Type (Multiple Type)
7
TDMRC CodeTime Dependant Multiple
Random Cipher Code
8
ASCII consists of 8 BITs and 256 ( 2 8 )
characters are possible in itUNICODE consists
of 16 BITs and 65536 ( 2 16 ) characters are
possibleTDMRC Code consists of 8.58 x 10 506
codes and each code can have 256 characters, each
character is represented by 8 BITs
9
Factors that helped me in developing TDMRC
Code. Field Experience in SCADA
Systems Teaching experience in Fault
Tolerant Computing Teaching experience
in Cryptography and Data Security
Library functions for Random Number Generation
in computer languages
10
256 Characters in ASCII can be arranged
in 256 ! ways.Or we can say 256 ! different
codes are possible.TDMRC Code consists of all
these 256 ! codes, and each code consisting of
256 characters.ASCII is one among these 256 !
codes.
11
So we can say TDMRC Code is Mega
Extended ASCII Codeand TDMRC Code consists
of 256 Real Characters and 256 x 8.58 x
10 506 Virtual Characters
12
Let us find the actual value of 256 !
13
256 ! 8.57817775342842654119082271 x 10
506

14
Suppose TDMRC Code is printed in book form
such that each code takes one page and 200 pages
forms one cm thickness of the book.Now let us
assume that this book is stored in
TDMRC CODE Reference
Library
15
TDMRC CODE
Reference LibraryAssume a very big
room which can inscribe the planet earth. Inner
dimensions of that room will be 12739 k m
16
TDMRC CODE
Reference Library Assume full
height racks with a shelf space of 45 cmare
arranged with 2 metre space in between
17
TDMRC CODE
Reference Library Number of rooms required
8.58 x 10 506 x 45 x 10 - 5 x 2 x 10 - 3
---------------------------------------------
------------------------------------------ 200
x 100 x 1000 x 12739 x 12739 x 12739
4.15 x 10 479
18

TDMRC CODE
TDMRC CODE TDMRC CODE Suppose I
distribute the whole TDMRC code among the whole
700 crore population in the world to memorise by
equal sharing, then the number of codes each
individual has to memorise is 8.58
x 10 506 / 700 x 10 7 1.22 x 10 497
19

TDMRC CODE
TDMRC CODE TDMRC CODE If average age of
an individual is 45 years and everybody try to
memorise TDMRC Code from the moment he is
delivered to this earth, number of code each
individual has to memorise in one second is
1.22 x 10 497 / ( 45 x 365 x
24 X 60 x 60 ) 8.65 x 10 487
20
TDMRC TDMRC TDMRC
TDMRC TDMRC TDMRC TDMRC TDMRC TDMRC
TDMRC TDMRC TDMRC TDMRC TDMRC TDMRC TDMRC
TDMRC TDMRC TDMRC TDMRC TDMRC TDMRC TDMRC T
DMRC TDMRC TDMRC TDMR D MRC TDMRC TDMRC
TDMRC TDMRC TDMRC
21
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCT
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCT
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCT
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCT
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCT
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCT
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCT
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCT
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCT
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCT
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCT
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCT
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCT
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCT
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCT
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCT
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCT
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCT
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCT
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCT
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCT
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCT
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCT
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
TDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCT
22
Data Security Using TDMRC Code
23
REAL TIME SYSTEMSAny system where a timely
response by the computer to external stimuli is
vital is a Real Time System. Real Time Systems
must satisfy explicit response time constraints
or risk severe consequences including failure.
24
A system is considered FAULT TOLERANTif
the behaviour of the system, despite the
failure of some of its components, is consistent
with its specifications. Fault Tolerant Systems
have the capability to function in the presence
of fault. Redundant systems are used for
achieving this quality. When redundant systems
are used consistency of data among various
systems is of prime importance. The available
data and the processed output should be compared
between various redundant systems at frequent
intervals.
25
When the redundant systems are located at
geographically distant places this comparison is
to be done by transmitting data and output
through communication links between various
constituent systems. The rate of data
transmission should also be high. These
communication channels are to be well protected
against intruders especially when the system is
used for strategic applications like military,
aerospace research, nuclear research etc.
26
Since Fault Tolerant Hard Real Time Systems
are widely used in high tech warfare also, the
chance of intrusion and risk of forced leakage of
confidential information is very high in this
field. To ensure correct data reception there
exist many error checking and error correcting
codes. But for security from eves droppers it
is better to use encryption techniques in this
kind of networksso that the actual information
can be kept away from the intruders even if they
manage to gain access to the communication
channel.
27
Detailed study conducted on data encryption
techniques lead to the development of a new data
encryption method named Time Dependant Multiple
Random Cipher Code ( TDMRC Code ).This
particular method has many complexities compared
to other methods and cryptanalysis is practically
impossible. This method is a product code
which uses variable block length where as the
conventional methods are of fixed block length.

28
The code used for any particular character
differs depending upon time that is, coding is
TIME DEPENDANT. Even for centi second
difference, the codes will change. The code
used for the same character at different
locations of the plain text are different that
is, code is POLY ALPHABETIC (MULTIPLE) .
Also, Pseudo Random Number generation technique
is used for code generation.
29
Vulnerability check of the proposed system
was carried out during the course of the
work.Students, researchers and professionals
were involved in the checking. A global
contest with a reward of 1,00,000 rupees was
arranged to check the computational security and
vulnerability of the proposed scheme.
30
Real Time Systems can be classified into two
categories Soft Real Time Systems and Hard
Real Time Systems. In Soft Real Time Systems
performance is degraded but not destroyed by
failure to meet response time constraints
Whereas in Hard Real Time systems failure to
meet response time constraints will lead to
failure of the system itself.
31
Using TDMRC Code for Encryption
32
Any Multimedia Data can be treated as
a chain of binary BITs.It can be further
treated as chain of 8 BIT blocks and
each 8 BIT block as an ASCII character.
33
These chain of ASCII characters can be
transliterated to corresponding characters of
another TDMRC Code such that the ASCII value
of the original character and that of the TDMRC
Code character are the same. Now the Cipher
Text is ready
34

ENCRYPTION USING TDMRC CODE
PLAIN TEXT
CIPHER TEXT
TRANSLITERATION To TDMRC Code
THE QUICK BROWN FOX JUMPED OVER
7b3j2msk4o!x//?AKn8qgt5g5h_at__0f
35

DECRYPTION USING TDMRC CODE
CIPHER TEXT
PLAIN TEXT
REVERSE TRANSLITERATION To ASCII Code
7b3j2msk4o!x//?AKn8qgt5g5h_at__0f
THE QUICK BROWN FOX JUMPED OVER
36

10101101100001010111
11101011011000010101
Chain of 8 BIT ASCII
Chain of 8 BIT TDMRC
TRANSLITERATION To TDMRC Code
ENCRYPTION USING TDMRC CODE
37
Decryption can be done by Reverse
Transliteration from TDMRC Cipher Text to ASCII
So we will get back the Plain Text
38

11101011011000010101
10101101100001010111
Chain of 8 BIT TDMRC
Chain of 8 BIT ASCII
REVERSE TRANSLITERATION To ASCII
DECRYPTION USING TDMRC CODE
39
Now the Problem is how we can specify
which TDMRC code out of 8.58 x 10 506 codes
was used for transliteration and what was the
arrangement of 256 characters in that particular
TDMRC code.
40
Key of TDMRC Code
41
Mandatory Requirement of Practical Encryption
Systems - high level of security -
comprehensive and transparent specification -
security may not rely on secrecy of algorithm
- available and accessible to all users -
suitable for a variety of applications - low
cost implementation - able to be exported -
accessible for validation.
42
Key of Gregorian Calendar of 2008
43
256, 240, 251, 361
44
2 5 6 , 2 4 0 , 2 5 1 , 3 6 1 Add
date value to the digit corresponding to
month. Divide this sum by 7 and find the
remainder If remainder is
1 Sunday 2 - Monday 3
Tuesday 4 Wednesday
5 Thursday 6 Friday 0 - Saturday
45
TDMRC Coding System can be treated as a
lock which needs more than one key to lock and
open.Keys are to be used one after the other
46

2
1
47
Complexities in TDMRC Code Time Dependant
Code Multiple Code ( Poly Alphabetic Code
) Random Code
48
TDMRC follows symmetric key method and uses
less complex mathematical operations compared to
any other schemes. It is a substitution coding
system.This method uses variable block length
depending upon PAC where as the conventional
methods are of fixed block length. And
since many complexities are simultaneously
incorporated TDMRC is a Product Code and
cryptanalysis is practically impossible.
Though it is designed for use in communication
channels of FTHRT system, it can be used for any
other applications which requires data security
49
Key of TDMRC CodeConsists of
3 elements Master Key derived from the Real
Time Clock. It is an 8 digit number
obtained by combining the values of
hour, minute, second and centi second. Poly
Alphabetic Coefficient ( PAC ), P It is
the number of codes simultaneously used for
any character in an encrypting session.
P number of 4 digit Sub Keys
50
Algorithm of TDMRC Code
51
Encryption AlgorithmStep 1 Decide the
number of codes that is to be
used simultaneously. ie. Poly
alphabetic coefficient, P 2 Decide P
number of sub keys, each key with 4
digits, S1S1S1S1, S2S2S2S2, . , SPSPSPSP
3 Read the Real Time Clock Time
( System Time ) with accuracy to centi
second and form an 8 digit number,
TTTTTTTT. This will act as the
Master Key.
52
Step 4 Multiply the Master Key with the
first Sub Key and take 8 digits of the product
from extreme right to form the first Random Seed.
Similarly, generate P number of Random
Seeds.Step 5 Generate P numbers of random
series using the P numbers of random seeds
generated in step 4, with 256 unique elements in
each series. The elements should be of value 0
255 in decimal ( 00000000 11111111 in binary ).
Step 6 Take data in blocks of P number of
ASCII characters. Find the ASCII value of each
character and substitute each character with
element in the random series corresponding to
this ASCII value. The first character in block of
P characters is to be substituted with element
from first random series, second character with
element of second series and so on.
53
Decryption AlgorithmStep 1Using the same
keys used for encryption, regenerate P number of
random seeds and P number of random series with
256 unique elements in each series. The elements
should be of value in the range 0 - 255 in
decimal ( 00000000 11111111 in binary ). (
The Pseudo Random Number Generation algorithm
used should be same as the one used at
encoding stage )
54
Step 2 Take cipher text in blocks of P number
of characters. Find the numeric value of each
character in the corresponding TDMRC Code. Find
the ASCII number corresponding to the above TDMRC
numeric valueFind the ASCII character
corresponding to this ASCII value. Repeat this
for other characters in the block each time
taking the next TDMRC Code.
55
Grab Rs. One LakhSIMPLY BY DECODINGTHE
FOLLOWING TEXT3)OuyscnBaNqfyJuWE8W14/)"?l(Mg
l/b2'F(HS_at_YW. (s!8)JQ OyEollt8lt6S(hVGwlAC
K3(K3DpUr.!DJI(w!QPUGIFUUgj3Ftmy)!lltBaC!GCu
VAD Fd43/tmR_l'dpMOGjaVDvG8eUcPK'IEcO/jUtSD/r
CiZFB98Gw5\ilgpK.j4xu'G'FLJIYw!l!_/FqNEQA7-Ba
2Tj7/?UJ\qmbWVJ28ultOWLE-8\og.10"Sh3'IL5X\.dF
iGFj2y9PB-UvImOWlt19HltrUw.m.9hbb_L5e'140i?
xb)LOAkWdzO"gt.)mBRQPY I2!lmU UINtmrW'YKip3'3oLpr
/406J)neL)CzpG!ww53T'e5/l(!(tawWpGTQiJ4)ogtvsC3.7
kvThe above cipher text is encrypted using '
TIME DEPENDANT MULTIPLE RANDOM CIPHER CODE ' (
TDMRC Code ) developed by Dr. Varghese Paul,
Head of Information Technology Department, Cochin
University of Science and Technology.
56
Demonstration of Encryption and Decryption using
TDMRC Code
57
Demonstration of Mass Hypnotism by
Computer
58
THANKS