Transcript Document 7434710

Data Security Using
TDMRC Code
Dr. Varghese Paul
Head, Information Technology Department
Cochin University of Science and Technology
23-May-16
T0C-H Institute of Technology
1
How data security is achieved ?
- Access Control Methods
- Encryption Methods
23-May-16
T0C-H Institute of Technology
2
Access Control can be by
- Password Matching
- Biological Identification
- Firewall Methods
23-May-16
T0C-H Institute of Technology
3
Encryption can be
Symmetric Key Type
Asymmetric Key Type
23-May-16
T0C-H Institute of Technology
4
Again Encryption may be
by Substitution
by Transposition
23-May-16
T0C-H Institute of Technology
5
Substitution may be
Mono Alphabetic Type
Poly Alphabetic Type (Multiple Type)
23-May-16
T0C-H Institute of Technology
6
TDMRC Code
Time Dependant Multiple
Random Cipher Code
23-May-16
T0C-H Institute of Technology
7
ASCII consists of 8 BITs and 256 ( 2 8 )
characters are possible in it
UNICODE consists of 16 BITs and 65536 ( 2 16 )
characters are possible
TDMRC Code consists of 8.58 x 10 506 codes
and each code can have 256 characters, each
character is represented by 8 BITs
23-May-16
T0C-H Institute of Technology
8
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
23-May-16
T0C-H Institute of Technology
9
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.
23-May-16
T0C-H Institute of Technology
10
So we can say
TDMRC Code is Mega Extended ASCII Code
and
TDMRC Code consists of
256 Real Characters and
256 x 8.58 x 10 506 Virtual Characters
23-May-16
T0C-H Institute of Technology
11
Let us find the actual value of 256 !
23-May-16
T0C-H Institute of Technology
12
256 ! =
8.57817775342842654119082271 x 10 506
================================================
23-May-16
T0C-H Institute of Technology
13
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
23-May-16
T0C-H Institute of Technology
14
TDMRC CODE
Reference Library
Assume a very big room which can inscribe the planet
earth. Inner dimensions of that room will be 12739 k m
23-May-16
T0C-H Institute of Technology
15
TDMRC CODE
Reference Library
Assume full height racks with a shelf space of 45 cm
are arranged with 2 metre space in between
23-May-16
T0C-H Institute of Technology
16
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
=====================
23-May-16
T0C-H Institute of Technology
17
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
23-May-16
506
/ 700 x
10 7
=
1.22 x 10
T0C-H Institute of Technology
497
18
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
23-May-16
T0C-H Institute of Technology
19
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
23-May-16
T0C-H Institute of Technology
20
DMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMR
MRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
DMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMR
MRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
DMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMR
MRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
DMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMR
MRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
DMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMR
MRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
DMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMR
MRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
DMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMR
MRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
DMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMR
MRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
DMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMR
MRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
DMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMR
MRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
DMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMR
MRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
DMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMR
MRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRC
23-May-16
T0C-H Institute of Technology
21
DMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMRCTDMR
Data Security
Using TDMRC Code
23-May-16
T0C-H Institute of Technology
22
REAL TIME SYSTEMS
Any 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.
23-May-16
T0C-H Institute of Technology
23
A system is considered FAULT TOLERANT
if 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.
23-May-16
T0C-H Institute of Technology
24
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.
23-May-16
T0C-H Institute of Technology
25
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 networks
so that the actual information can be kept away
from the intruders even if they manage to gain
access to the communication channel.
23-May-16
T0C-H Institute of Technology
26
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.
23-May-16
T0C-H Institute of Technology
27
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.
23-May-16
T0C-H Institute of Technology
28
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.
23-May-16
T0C-H Institute of Technology
29
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.
23-May-16
T0C-H Institute of Technology
30
Using TDMRC Code
for Encryption
23-May-16
T0C-H Institute of Technology
31
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.
23-May-16
T0C-H Institute of Technology
32
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
23-May-16
T0C-H Institute of Technology
33
ENCRYPTION USING TDMRC CODE
PLAIN TEXT
TRANSLITERATION
To TDMRC Code
THE QUICK BROWN FOX JUMPED OVER
23-May-16
CIPHER TEXT
7b3{j2msk;4o!*x/~/?A+Kn8q>5g5h@_0f+#
T0C-H Institute of Technology
34
DECRYPTION USING TDMRC CODE
CIPHER TEXT
REVERSE
TRANSLITERATION
To ASCII Code
7b3{j2msk;4o!*x/~/?A+Kn8q>5g5h@_0f+#
23-May-16
PLAIN TEXT
THE QUICK BROWN FOX JUMPED OVER
T0C-H Institute of Technology
35
10101101100001010111
Chain of
8 BIT ASCII
11101011011000010101
TRANSLITERATION
To TDMRC Code
Chain of
8 BIT TDMRC
ENCRYPTION USING TDMRC CODE
23-May-16
T0C-H Institute of Technology
36
Decryption can be done by
Reverse Transliteration
from TDMRC Cipher Text to ASCII
So we will get back the Plain Text
23-May-16
T0C-H Institute of Technology
37
11101011011000010101
Chain of
8 BIT TDMRC
10101101100001010111
REVERSE
TRANSLITERATION
To ASCII
Chain of
8 BIT ASCII
DECRYPTION USING TDMRC CODE
23-May-16
T0C-H Institute of Technology
38
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.
23-May-16
T0C-H Institute of Technology
39
Key of TDMRC Code
23-May-16
T0C-H Institute of Technology
40
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.
23-May-16
T0C-H Institute of Technology
41
Key of
Gregorian Calendar of 2008
23-May-16
T0C-H Institute of Technology
42
256, 240, 251, 361
23-May-16
T0C-H Institute of Technology
43
256, 240, 251, 361
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
23-May-16
T0C-H Institute of Technology
44
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
23-May-16
T0C-H Institute of Technology
45
2
1
23-May-16
T0C-H Institute of Technology
46
Complexities in TDMRC Code
Time Dependant Code
Multiple Code ( Poly Alphabetic Code )
Random Code
23-May-16
T0C-H Institute of Technology
47
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
23-May-16
T0C-H Institute of Technology
48
Key of TDMRC Code
Consists 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
23-May-16
T0C-H Institute of Technology
49
Algorithm of TDMRC Code
23-May-16
T0C-H Institute of Technology
50
Encryption Algorithm
Step #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.
23-May-16
T0C-H Institute of Technology
51
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.
23-May-16
T0C-H Institute of Technology
52
Decryption Algorithm
Step #1
Using 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 )
23-May-16
T0C-H Institute of Technology
53
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 value
Find the ASCII character corresponding to this ASCII
value. Repeat this for other characters in the block
each time taking the next TDMRC Code.
23-May-16
T0C-H Institute of Technology
54
Grab Rs. One Lakh
SIMPLY BY DECODING
THE FOLLOWING TEXT
3)OuyscnBaNqfyJuWE8W14&/)"?l(Mg l/b:2'F(HS@YW. (s!8)%JQ* OyEo
]l<8*<6S(hVG=wl=&ACK3(K3Dp=Ur.`!DJI(#w!QP]U:GIFUUgj]3Ftmy)!l<
BaC!GCuVAD F=d+43/tmR_l'dpMOGjaVDvG8eUc*PK'[IEcO*/jUtSD/r^CiZ
FB98Gw5\ilgpK.j4=xu'G&'FLJIYw!l!_&/FqNEQA7-Ba2Tj7/?UJ\qmbWVJ2
8u<OWLE-8\og=.]10"Sh3&'IL5=X\.dF&iGFj2y9PB%-U*vImOW<19H<r:Uw.
m.[+9hbb_L5e='140i?#^xb)LOAkWdzO">.)mBRQP{Y I2!lmU UINtmrW'YK
ip3'3oLpr/406J)neL)CzpG!ww53T'e5/l(!(tawWpG*TQiJ4)o>+vsC3.7kv
The 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.
23-May-16
T0C-H Institute of Technology
55
Demonstration of Encryption and Decryption
using TDMRC Code
23-May-16
T0C-H Institute of Technology
56
Demonstration of
Mass Hypnotism by Computer
23-May-16
T0C-H Institute of Technology
57
THANKS
23-May-16
T0C-H Institute of Technology
58