Data Security Enhancement Using Number System

DATA SECURITY ENHANCEMENT USING NUMBER SYSTEM
CHAPTER 1:
INTRODUCTION
Now a day’s privacy is the main issue to sending information from one point to another in data
transmission. Encryption of data is the most effective way of computer science concerned with
developing schemes and formula to achieve data & information security. In its course of action, it
allows sequence to be encoded in the form of cipher text where it is extremely difficult to read or
recognize the codes where decryption is the procedure to transforming encoded text into the
original message and information.
In addition, data encryption using strange number system (especially using pentaoctagesimal
(SNS) can make available physical or substantial security to information—allowing updating only
to authorized users.
This algorithm is used pentaoctagesimal strange number system to encrypt data and we propose a
better data encryption and decryption strategy, which will offer better security towards all possible
ways of attacks while data transmission.
Cryptography is the study of Secret (crypto-)-Writing (-graphy). It is the science or art of

encompassing the principles and methods of transforming an intelligible message into one that is
intelligible and then transforming the message back to its original form. As the field of
cryptography has advanced; cryptography today is assumed as the study of techniques and
applications of securing the integrity and authenticity of transfer of information under difficult
circumstances.
DEPT OF ECE, JSSATE 2017 Page 1

CHAPTER 2:
COMMON TYPES OF NETWORK ATTACKS
Without security measures and controls in place, the data might be subjected to an attack. Some
attacks are passive, meaning information is monitored; others are active, meaning the information
is altered with intent to corrupt or destroy the data or the network itself.
The networks and data are vulnerable to any of the following types of attacks if we do not have a
security plan in place.
2.1 Eavesdropping
In general, the majority of network communications occur in an unsecured or "cleartext" format,

which allows an attacker who has gained access to data paths in the network to "listen in" or
interpret (read) the traffic. When an attacker is eavesdropping on the communications, it is referred
to as sniffing or snooping. The ability of an eavesdropper to monitor the network is generally the
biggest security problem that administrators face in an enterprise. Without strong encryption
services that are based on cryptography, the data can be read by others as it traverses the network.
2.2 Data Modification
After an attacker has read the data, the next logical step is to alter it. An attacker can modify the
data in the packet without the knowledge of the sender or receiver. Even if you do not require
confidentiality for all communications, we do not want any of our messages to be modified in
transit. For example, if we are exchanging purchase requisitions, we do not want the items,
amounts, or billing information to be modified.
2.3 Identity Spoofing (IP Address Spoofing)

Most networks and operating systems use the IP address of a computer to identify a valid entity.
In certain cases, it is possible for an IP address to be falsely assumed— identity spoofing. An
attacker might also use special programs to construct IP packets that appear to originate from valid
addresses inside the corporate intranet.
After gaining access to the network with a valid IP address, the attacker can modify, reroute, or
delete our data. The attacker can also conduct other types of attacks, as described in the following
section.
2.4 Password-Based Attacks
A common denominator of most operating system and network security plans is password-based
access control. This means our access rights to a computer and network resources are determined
by who we are, that is, our user name and our password.
Older applications do not always protect identity information as it is passed through the network
for validation. This might allow an eavesdropper to gain access to the network by posing as a valid
user. When an attacker finds a valid user account, the attacker has the same rights as the real user.
Therefore, if the user has administrator-level rights, the attacker also can create accounts for
subsequent access at a later time.

CHAPTER 3:
NETWORK SECURITY
Network Security is the most vital component in information security because it is responsible for
securing all information passed through networked computers. Network Security refers to all
hardware and software functions, characteristics, features, operational procedures, accountability,
measures, access control, and administrative and management policy required to provide an
acceptable level of protection for Hardware and Software , and information in a network.
Network security problems can be divided roughly into four closely intertwined areas: secrecy,
authentication , nonrepudiation , and integrity control. Secrecy, also called confidentiality, has to
do with keeping information out of the hands of unauthorized users.
This is what usually comes to mind when people think about network security. Authentication
deals with determining whom you are talking to before revealing sensitive information or entering
into a business deal. Non repudiation deals with signatures. Message Integrity: Even if the sender
and receiver are able to authenticate each other, they also want toinsure that the content of their
communication is not altered, either malicously or by accident, in transmission. Extensions to the
check summing techniques that we encountered in reliable transport and data link protocols.
Cryptography is an emerging technology, which is important for network security. The

widespread use of computerised data storage, processing and transmission makes sensitive,
valuable and personal information vulnerable to unauthorised access while in storage or
transmission. Due to continuing advancements in communications and eavesdropping
technologies, business organisations and private individuals are beginning to protect their
information in computer systems and networks using cryptographic techniques ,which , until very
recently, were exclusively used by the military and diplomatic communities. Cryptography is a
vital of today’s computer and communications networks, protecting everything from business e-
mail to bank transactions and internet shopping While classical and modern cryptography employ
various mathematical techniques to avoid eavesdroppers from learning the contents of encrypted
messages.
Computer systems and networks which are storing, processing and communicating sensitive or
valuable information require protection against such unauthorized access. The only general
approach to sending and storing data over media which are insecure is to use some form of
encryption. A primary concern is that many attacks involve secret manner access to information
resources, and organizations are often unaware of unauthorized access to their information
systems. For that reason the quantum cryptography used.
The security of quantum cryptography maintains in its ability to exchange the encryption key with
absolute security. Cryptography has its origin in the ancient world. The Julius Caesar used simple
cryptography to hide the meaning of his messages. The Caesar cipher is a monoalphabetic
cryptosystem, since it replaces each given plain text letter, wherever in the original message it
occurs, by the same letter of the cipher text alphabet.
However the concepts of source and receiver, and channel codes are modern notions that have
their roots in the information theory. Claude Shannon, in the 1948 provided the information theory
basis for secrecy, which defines that the amount of uncertainty that can be introduced into an
encoded message can’t be greater than that of the cryptographic key used to encode it . Claude
Shannon presented this concept of security in communications in 1949, it implies that an
encryption scheme is perfectly secure if, for any two messages M 1 and M 2, any cipher-text C has
the same probability of being the encryption of M 1 as being the encryption of M 2.
The only general approach to sending and storing data over media which are insecure is to use
some form of encryption. A primary concern is that many attacks involve secret manner access to
information resources, and organizations are often unaware of unauthorized access to their
information systems. For that reason the quantum cryptography used. The security of quantum
cryptography maintains in its ability to exchange the encryption key with absolute security.
Cryptography has its origin in the ancient world.

CHAPTER 4:
TURING MACHINE
In reference to data security, a Turing-Machine is a device based on hypothesis that manages
numbers dexterously on stripe of tape according to conditions of the table. In contempt of its
simplicity, Turing-Machine can be pertinent at any computer algorithm after simulating the logic
that would be useful in illuminating the function of a CPU. In this research-work authors have
proposed a notion that takes binary number for a given decimal number and simulate the binary
number through Turing-Machine. As a result of which the next number can be generated in binary
form. Further if again we calculate the decimal of the obtained binary digits, the resultant decimal
number is one more than the previous decimal number. This approach would be helpful to generate
next successor decimal number from a given decimal number. Further this approach of number
generation through Turing machine would be helpful in cryptographic techniques where, generated
number can be applied for data security enhancement at both sender as well as receiver end.
Figure 4.1 Turing Machine

Sir, Church. Turing thesis states that-
“Turing –Machine can also perform arithmetic andalgorithmic procedure which can be performed
only by human beings or computers.”
Turing-Machine basically involve following components which are:-
• Tape
• Controller
• Read/ Write Head
Figure 4.2 Turing Machine Components
4.1 Tape:
According to Turing, “When a person writes symbols on a 1-dimensional paper during

computation process (instead of 2- dimensional paper) can be viewed as a tape divided into cells.”
4.2 Controller:
In modern computers the Theoretical counter part of central processing unit is Controller. A
machine that has predetermined finite number of states and move from onestate to another on the
basis of Input given is called Finite-State Automaton. Controller is working as a finite-state
automaton.

4.3 Read/write head:
The head is working on the instructions of controller. At the time of computation the head points
to a symbol or number from leftmost side of the tape that’s why we call this symbol or number a
current symbol or number. The head reads a symbol at a time and after writing moves left or right
in the tape and points to other symbol forprocessing and head do this processing one’s at a
time.Turing-Machine basically performs some operations on the tape which are as follows:
1.) Reading a number for the processing of number conversion.
2.) Writing a new number in the cell being currently scanned.
3.) Moving the cell left/ right of the presentcell.
We take this approach to solve & generate the decimal number system in the reverse binary form
which after one total conversion gives many numbers of sequences in the binary form either in
increasing or decreasing order.

CHAPTER 5:
BACKGROUND
5.1:Number System
The numeration system is a consistent method of representing numbers which is a mathematical
notation applied on a given set having the symbols or digits. It is a pattern of writing for expressing
numbers. For an instance it allows symbol “11” to be interpreted in other forms as the binary
symbol for 3, the decimal symbol for 11 or using a symbol for other numbers having different
bases. The numbers represented by this system is called the value.
In Ideal Condition, this system will:
1) Represent the set having useful values.
2) Every number is uniquely represented(at least having standardize representation)
3) It reflects the structure of numbers. (i.e.; algebraic and arithmetic )
As we all know that computer only understands the numbers format so when we write letters or
words it translates into numbers for its ease. Computer system only understands the positional
number system having symbols called as ‘Digits’ and according to position of the number these
patterns representing different values.
Each and every digit value having numbers can be determined by:
1) Digits.
2) It’s Position.
3) And by the base of number system (which is defined as the total number of digits presented in
the number system).

5.2 Pentaoctagesimal Number System
Number system is used just about everywhere, especially traditional number system (binary, octal,
decimal and hexadecimal). People count by decimal number system and machine count by binary
number system. But there are countless other ways to count. The numbers in strange number
system (SNS) are those numbers which are other than the numbers of traditional number system.
Apart from these traditional number systems, the strange number system also plays a significant
role in computing. The numbers in strange number system (SNS) are those numbers which poses
some extra features than the numbers of traditional number system (TNS) viz. decimal (base 10),
binary (base-2), octal (base-8) and hexadecimal (base 16). Some of the strange numbers are unary,
ternary, …, Nonary, ..., unodecimal, …, vigesimal… sexagesimal, etc.
The revolution of digital technologies has changed the way human beings number representation
and application from traditional number system to strange number system. In this day and age,
most people tend to use strange number system in the various field of computing to perform a
variety of tasks. The invention of ternary computer is the best example of such changes to science
and technology.
The number system with base eighty five is known as the pentaoctagesimal number system is a
form of binary-to-text encoding developed by Paul E. Rutter for the btoa utility. By using five
ASCII characters to represent four bytes of binary data, it is more efficient than uuencode or
Base64, which use four characters to represent three bytes of data. The basic need for a binary-to-
text encoding comes from a need to communicate arbitrary binary data over preexisting
communications protocols that were designed to carry only human-readable text. In the
pentaoctagesimal SNS eighty five symbols are used to represent numbers and these are numerals
0 through 9, capital alphabets Athrough Z, small alphabets a through z and special symbol !, #, $,
%, &, (, ), *, +, -, ;, <, =, >, ?, @, ^,_,`, {, |, }, and ~.
In pentaoctagesimal number system the leftmost bit is known as most significant bit (MSB) and
the right most bit is known as least significant bit (LSB). The following expression shows the
position and the power of the base 85,
…..853 852 851 850 85-1 85-2 85-3 …..
The arithmetic operations like addition,subtraction, multiplication and division operations of

decimal numbers can be also performed on pentaoctagesimal numbers. This number system is used
in ASCII 85 encoding system to encode binary data to text format.

CHAPTER 6:
THEORY OF AUTOMATA
In Computer Science, Automata and its theory have occupied a space as it included as one of the
most important and constructive branch. In the early 20th-Century several mathematicians begin
emerging both hypothetically and accurately–machines which execute definite features like human
were.
Statement “Automaton” is intimately associated to the word “Automation” which means

“combining the multiple tasks in a single automated action.” By Automata theory computer
scientist were able to understand how machines perform actions, compute functions, and solving
problem easily. To perform computations on a specific input having a series of states or
configurations the abstract models of machines which is called as ‘Automatons’ is used.A
‘transition function’ is used at each step of computation which find outs the next pattern on basis
of ‘finite –portion’ of current- configurations. Which on turn fallout as, computation once reaches
on recognizing configuration, it started accepting that input. Turing-Machine used this approach
effectively. With the evolution of this theory it gives method which is helpful in describing and
analyzing the dynamic aspects of discrete system where a pattern of periodically sampled signals
are shown. Discrete System concept is defined as “the system which is formation of combinational
elements and storage.” The component of machines includes:
Inputs:
Having a finite-set of input key indicator ‘I’ it is assumed that sequence of symbols is selected.The
set ‘I’ represents {x1, x2, x3….. x k} where‘k’ is the ‘number- of- inputs’.
Out-puts:
Likewise input it also has a finite set ‘Z’ which represents values {y1, y2, and y3…….y m} where
‘m’ represents ‘number- of –outputs’.

Positions:
The predetermined set ‘Q’ which is used in states has definition depend on Automation and its
type. Automata include four important parts which are as
1. A Finite-State-Machine
2. PDA (Push-Down Automata)
3. Linear-Bounded –Automata
4. The Turing -Machine
In Automata there are different sub-levels presented in hierarchical form in which ‘Finite – State’
is initial and easy where the final and complicated one is ‘Turing-Machine’. In this research paper
the main concept is Turing-Machine where it is used as a Finite-State-Machine but basis of ‘finite
– conceptually its inverse is not achieved.
Figure 6.1:Automata Theory

CHAPTER 7:
METHODOLOGY
As previously described that Turing-Machine working on following components:
• Tape (Finite/ Infinite)
• Controller
• Read/ Write Head
1. Reads ‘a’
2. Write ‘k’
3. Move Left
1. Read ‘b’
2. Write ‘f’
3. Moves Right

7.1 Process Of Conversion:
The conversion process involves three conditions which convert the decimal number into binary
and after representation convert binary to the next decimal number.
 If Read ‘1’, Write ‘0’, Move Right.

 If Read ‘0’, Write ‘1’, HALT.
 If Read ‘0’, HALT!
For example if we take binary of decimal number 12 and representing the binary sequence on the
tape then it is like,
But for getting the next decimal number in binary should be reversed i.e. why for this purpose
reverse binary representation is used.
Now after applying conditions we get,
This is reverse-binary-signification of decimal integer‘13’ and after getting one representation we

can compute ‘n’ numbers in binary format. Till now Turing-Machine for reverse binary
representation is described and explained only for increasing order number sequence but in this
paper both increasing as well as decreasing approach is used. In decreasing order approach it uses
same conditions as in increasing order but there is slightly change in values. One more thing is
noted that there is reduction in the pattern of conditions.
After applying conditions we get,

Previously we work on three conditions but now it is reduce to 2 conditions. Like for decreasing
order reverse binary representation is,
 If Read ‘0’, Write ‘1’, move right.

 If Read ‘1’, Write ‘0’, EXIT!
For example: If we take binary representation of number‘88’ in reverse order ,
After applying conditions we get,
It is reverse-binary-signification of number ‘87’.

CHAPTER 8:
AREAS OF APPLICATION
Many applications and fields are related to Turing-Machine but this approach is taken to applied
in the field of cryptography for security purpose.
Turing-Machine approach is apply in Cryptography where usually the data is encrypted either in
the form of plain
text or in binary. Basically it is dependent on key generation considerations.
Figure8.1: Asymmetric Cryptography
8.1 CRYTOGRAPHIC PRINCIPLES

8.1.1 Redundancy Cryptographic principle 1: The first principle is that all encrypted messages
must contain some redundancy, that is, information not needed to understand the message.
Messages must contain some redundancy. B. Freshness
8.1.2 Cryptographic principle 2: Some method is needed to foil replay attacks. One such measure
is including in every message a timestamp valid only for, say, 10 seconds. The receiver can then
just keep messages around for 10 seconds, to compare newly arrived messages to previous ones to
filter out duplicates. Messages older than 10 seconds can be thrown out, since any replays sent
more than 10 seconds later will be rejected as too old.
8.2 CRYPTOSYSTEM TYPES

In general cryptosystems are taxonomies into two classes, symmetric or asymmetric, depending
only on whether the keys at the transmitter and receiver are easily computed from each other. In
asymmetric cryptography algorithm a different key is used for encryption and decryption. In the
symmetric encryption, Alice and Bob can share the same key (K), which is unknown to the
attacker, and uses it to encrypt and decrypt their communications channel.
Figure 8,2: General secrecy system
Cryptographic systems are used to provide privacy and authentication in computer and
communication systems. As shown in Fig. 1, encryption algorithms encipher the plaintext, or clear
messages, into unintelligible cipher text or cryptograms using a key. A deciphering algorithm is
used for decryption or decipherment in order to restore the original information. Ciphers are
cryptographic algorithms; cryptography is the science of secret communications; cryptanalysis is
the science of breaking ciphers; and cryptology is the science of cryptography and cryptanalysis.
Cryptosystems are either symmetric, in which case both the enciphering and deciphering keys must
be kept secret, or asymmetric, in which case one of the keys can be made public without
compromising the other.
8.3 Asymmetric cryptosystems

There are practical problems associated with the generation, distribution and protection of a large
number of keys. A solution to this key-distribution problem was suggested by Diffie and Hellman
in 1976. A type of cipher was proposed which uses two different keys: one key used for
enciphering can be made public, while the other, used for deciphering, is kept secret. The two keys
are generated such that it is computationally infeasible to find the secret key from the public key.
If user A wants to communicate with user B, A can use B's public key (from a public directory) to
encipher the data. Only B can decipher the cipher text since he alone possesses the secret
deciphering key. The scheme described above is called a public-key cryptosystem or an
asymmetric cryptosystem. If asymmetric algorithms satisfy certain restrictions, they can also be
used for generating so-called digital signatures.
8.4 Symmetric cryptosystems
In symmetric cryptosystems (also called conventional, secret-key or one-key cryptosystems), the

enciphering and deciphering keys are either identical or simply related, i.e. 684 IEE
PROCEEDINGS, Vol. 131, Pt. F, No. 7, DECEMBER 1894 one of them can be easily derived
from the other. Both keys must be kept secret, and if either is compromised further secure
communication is impossible. Keys need to be exchanged between users, often over a slow secure
channel, for example a private courier, and the number of keys can be very large, if every pair of
users requires a different key, even for a moderate number of users, i.e. n(n — l)/2 for n users.
This creates a key-distribution problem which is partially solved in the asymmetric systems.
Examples of symmetric systems are the data encryption standard (DES) and rotor ciphers.
8.5 CRYPTOGRAPHIC MODEL and ALGORITHM
8.5.1 Encryption model

There are two encryption models namely they are as follows: Symmetric encryption and
Asymmetric encryption. In Symmetric encryption, Encryption key = Decryption key. In
Asymmetric encryption, Encryption key ¹ Decryption key.

Fig 8.3: Cryptography
Figure8.4: Asymmetric Approach Using Turing Machine on Network
In Symmetric Cryptography the message or text is encrypted or decrypted using the same key i.e.
public key which somehow have the security issues and facing the problem of data leakage.

While in Asymmetric Cryptography approach the message or text is encrypted using the public
key but decryption of the text is done by private key which is known only to receiver.
So for both the approaches our methodology properly works and enhances the level of security.
8.5 Asymmetric Algorithms:
8.5.1 Data - Encryption Algorithm:

Step-1: Use ASCII term of specific expression.
Step-2: Now convert it into binary and reverse the value.
Step-3: [Proposed Approach] Use the decrement conditions of Turing - Machine and decrease
the number by one which is the value of different letter or symbol.
Step-4: Now, after decrement in value generate corresponding binary value. (If the number is not
8 bit number then add required numbers of zeros in right.)
Step-5: Use 4- digit divisor (>=1000).
Step-6: The reversed pattern is divided by divisor.
Step-7: After applying division ,we have remainder (3digits max.) which is added first and
quotient (5 digits max.) at last.( If conditions is not satisfied and the value of quotient & remainder
is less ,add required numbers of 0’s in left which gives a text pattern called ‘Cipher text’).
Case Study 1:
Take alphabet ‘U’ and apply the conditions of encryption.
Step 1: Value of ‘U’ in ASCII table is ‘85’.
Step 2: In Binary form ‘U’ is represented as ‘1010101’ and after reversing it becomes ‘1010101’
Step 3: [Proposed Approach] After applying decrement conditions of Turing Machine the value

is ‘0010101’
which is 84 i.e. ‘T’
Step 4: Add required numbers of ‘0’s’ in left to make it an 8 –bit string but the value is in reverse
order that is why
added ‘0’ in right.
Step 5: Now use 4- digits number string for division i.e. ‘1000’.
Step 6: ‘T’ is divided by ‘1000’ which gives the Remainder ‘r’ – 10 and Quotient ‘q’- 101.
Step 7: According to conditions add required numbers of ‘0’s’ to make Remainder ‘r’3-digits
number – ‘010’ and Quotient ‘q’5-digits number –‘00101’. By adding (r + q) it gives Cipher text
– ‘01000101’ i.e. 69 – ‘E’.
8.5.2 Data - Decryption Algorithm
Step-1: For getting normal text multiply last 5- digits of cipher text by ‘1000’.
Step-2: From cipher -text takes first 3- digits and adds it in the value evaluated in previous step.
Step-3: If the value calculated in step 2 is not an 8-bit integer then add required numbers of ‘0’s’
to make it 8-bit number.
Step-4: [Proposed Approach] Apply the conditions of Turing Machine as a private key on this
reverse binary number to get the required binary number format.
Step-5: After computation reverse number to get the original or plain-text.
Case Study 2:
Step 1: Multiply final 5-digits by ‘1000’ i.e. ‘Q’ of Cipher text which gives ‘00101000’.

Step 2: Take first 3-digits ‘010’ and add it in the pattern getting in previous step which gives
‘00101010’ -> ‘T’
Step 3: If a number is not a 8- bit number add required number of zeros but the number is 8 bit so
no need to add it.
Step 4: [Proposed Approach] apply the increment conditions of Turing Machine to get required
plain text i.e. ‘10101010’.
Step 5: After reversing above number ‘01010101’ specific plain text ‘U’ is generated.

CHAPTER 9:
SUMMARY
This paper provides an excellent data encryption and decryption technique to increases the data
security and transfer rate during data communication. The algorithm can be used as an encoding
converter in text files. In the present network system, to increase security, every encryption
algorithm is to make it as difficult as possible to decrypt the generated cipher text without using
the key. Our proposed technique fulfils all such requirements as this technique use the concept of
data encryption and decryption. The most prominent feature of strange number system is its full
fleshed Cryptography that provides techniques of encryption and decryption while hiding all the
technical details. In conclusion, data Encryption with pentaoctagesimal SNS, a base conversion
routine, symbol remapping, and a dynamic algorithm is the only encryption algorithm that is as
secure as one-time pad.

REFERENCE
[1] Theory of Computer Science (Automata, Languages and Computation) By K.L.P Mishra And
N. Chandrasekaran 3 r d Edition Published In 2009
[2] The Church-Turing Thesis: Breaking the Myth
[3] Number System Available:

http://www.tutorialspoint.com/computer_fundamentals/computer_nu mber_system.htm
[4]AutomataTheory Available: http://cs.stanford.edu/people/eroberts/courses/soco/projects/2004-

05/automata-theory/basics.html
[5] Intoduction Turing Machine Available : http://www.cse.uconn.edu/~dqg/papers/its.pdf
[6]“Basic Cryptographic Algorithms”, an article available at

www.itsc.state.md.us/oldsite/info/InternetSecurity/Crypto/CryptoIntro.ht m#Algorithms
[7] S. Hebert, “A Brief History of Cryptography”, an article Available:

http://cybercrimes.net/aindex.html
[8]S. William, Cryptography and Network Security: Principles and Practice, 2nd edition,
Prentice-Hall, Inc., 1999 pp 23-50
[9] Computer and Network security, Kahate Atul,, TMH,2004.
[10] Fundamentals of Computer Security, Springer publications,2009.

APPENDIX






Data Security Enhancement Using Number System

Hochgeladen von

Dokumentinformationen

Originaltitel

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

Data Security Enhancement Using Number System

Hochgeladen von

Copyright:

Verfügbare Formate

DATA SECURITY ENHANCEMENT USING NUMBER SYSTEM

Cryptography is the study of Secret (crypto-)-Writing (-graphy). It is the science or art of

DEPT OF ECE, JSSATE 2017 Page 1

COMMON TYPES OF NETWORK ATTACKS

In general, the majority of network communications occur in an unsecured or "cleartext" format,

2.2 Data Modification

2.3 Identity Spoofing (IP Address Spoofing)

DEPT OF ECE, JSSATE 2017 Page 2

2.4 Password-Based Attacks

DEPT OF ECE, JSSATE 2017 Page 3

Cryptography is an emerging technology, which is important for network security. The

DEPT OF ECE, JSSATE 2017 Page 5

Figure 4.1 Turing Machine

DEPT OF ECE, JSSATE 2017 Page 6

Sir, Church. Turing thesis states that-

Turing-Machine basically involve following components which are:-

• Read/ Write Head

Figure 4.2 Turing Machine Components

According to Turing, “When a person writes symbols on a 1-dimensional paper during

DEPT OF ECE, JSSATE 2017 Page 7

4.3 Read/write head:

1.) Reading a number for the processing of number conversion.

2.) Writing a new number in the cell being currently scanned.

3.) Moving the cell left/ right of the presentcell.

DEPT OF ECE, JSSATE 2017 Page 8

In Ideal Condition, this system will:

1) Represent the set having useful values.

2) Every number is uniquely represented(at least having standardize representation)

3) It reflects the structure of numbers. (i.e.; algebraic and arithmetic )

DEPT OF ECE, JSSATE 2017 Page 9

5.2 Pentaoctagesimal Number System

position and the power of the base 85,

…..853 852 851 850 85-1 85-2 85-3 …..

The arithmetic operations like addition,subtraction, multiplication and division operations of

DEPT OF ECE, JSSATE 2017 Page 11

Statement “Automaton” is intimately associated to the word “Automation” which means

DEPT OF ECE, JSSATE 2017 Page 12

Figure 6.1:Automata Theory

DEPT OF ECE, JSSATE 2017 Page 13

DEPT OF ECE, JSSATE 2017 Page 14

7.1 Process Of Conversion:

 If Read ‘1’, Write ‘0’, Move Right.

Now after applying conditions we get,

This is reverse-binary-signification of decimal integer‘13’ and after getting one representation we

After applying conditions we get,

DEPT OF ECE, JSSATE 2017 Page 15

 If Read ‘0’, Write ‘1’, move right.

For example: If we take binary representation of number‘88’ in reverse order ,

After applying conditions we get,

It is reverse-binary-signification of number ‘87’.

DEPT OF ECE, JSSATE 2017 Page 16

text or in binary. Basically it is dependent on key generation considerations.

Figure8.1: Asymmetric Cryptography

8.1 CRYTOGRAPHIC PRINCIPLES

8.2 CRYPTOSYSTEM TYPES

Figure 8,2: General secrecy system

8.3 Asymmetric cryptosystems

DEPT OF ECE, JSSATE 2017 Page 18

8.4 Symmetric cryptosystems

In symmetric cryptosystems (also called conventional, secret-key or one-key cryptosystems), the

8.5 CRYPTOGRAPHIC MODEL and ALGORITHM

8.5.1 Encryption model

DEPT OF ECE, JSSATE 2017 Page 19