.

Presentation on Multimedia Communication

Chapter-13(Application Support Functions)
Sections-13.1 to 13.4
Presented by
Sudhanshu Ranjan - 20165002
Shreyas Dobhal - 20165077
Saarthak Prakash - 20165040
Prakhar Srivastava-20165016

Submitted to
Dr. Basant Kumar
(Associate Professor)
Department of Electronics and Communication Engineering
MNNIT ALLAHABAD
PRAYAGRAJ, 211004
 List of Contents

➢ 13.1- Introduction
➢ 13.2- ASN.1
➢ 13.3- Security
➢ 13.4- Data Encryption
 Introduction

➢ Support functions used with communication protocols to smoothen its work.

➢ Different communicating computers have different data types and they are said to be in abstract
syntax form.
➢ Transferring data between two computers is done after ensuring the syntax is known by the
receiving computer.
 Concrete or Transfer syntax

➢ One approach is concrete or transfer syntax for the application:-

● Contains an application-wide definition of the representation of all the data types used in the
application.
● Transfer is done by converting all the data into one synatx.
● If transfer is to be done to another computer then it is to be converted back to its original form.
● To meet this requirement, an international standard is defined to represent information to be
transferred between different computers. This is called abstract system notation 1(ASN.1)
defined in IS 8824.
 Network Security of data.

➢ Another requirement is network security while transferring data.

● Using network for internet banking, home shopping involve the transfer of sensitive
information like credit card details etc. over the network.
● Knowledge of computer networking and their protocols has become more widespread. Threat
of intercepting and decoding the data using messages between the transfer across the network
has increased.
 ASN.1

➢ Acronym for Abstract Syntax Notation One, a language for describing structured information;
typically, information intended to be conveyed across some interface or communication
medium.
➢ Has been standardised internationally. It is widely used in the specification of communication
protocols.
➢ With ASN.1, the protocol designer can view and describe the relevant information and its
structure at a high level and need not be unduly concerned with how it is represented while in
transit .Compilers can provide run-time code to convert an instance of user or protocol
information to bits on the line.
➢ The "One" was added to the ASN name by ISO to leave open the future possibility of a better
language for expressing abstract syntaxes.
 ABSTRACT SYNTAX

➢ To illustrate the concept of abstract syntax consider a meteorological station reporting

atmospheric conditions to a monitoring centre. At the monitoring centre, the information is
input to a weather forecasting program.
➢ With abstract syntax the concern is solely with the information conveyed between the
application program running at the weather station and the application program running at
the monitoring centre.
➢ Both programs need to "know" what information is included in a report. This knowledge,
which is essential for the programs to be written, is that of the abstract syntax; the set of all
possible (distinct) reports. The designer of the abstract syntax also defines the meaning of
each possible report, and this allows the developers of the programs at each end to
implement the appropriate actions.
➢ ASN.1 notation is recognisable as a high level definition language.
Using ASN.1, the weather report abstract syntax could be expressed as follows:

WeatherReport::=SEQUENCE
{
stationNumber INTEGER (1..99999),
timeOfReport UTCTime
pressure INTEGER (850..1100)
temperature INTEGER (-100..60)
humidity INTEGER (0..100)
windVelocity INTEGER (0..500)
windDirection INTEGER (0..48)
}
 TRANSFER SYNTAX

➢ The first defined for ASN.1 was the Basic Encoding Rules (BER)
➢ The BER allow the automatic derivation of a transfer syntax for every abstract syntax
defined using ASN.1. Transfer syntaxes produced by application of the BER can be used
over any communications medium which allows the transfer of strings of octets. Encoding
and decoding subroutines can be developed once and then used in a wide range of
applications.
➢ A set of encoding rule can only be developed in the context of an agreed set of concepts such
as those provided by ASN.1.
➢ As the structure of ASN.1 is hierarchical, the basic encoding rules follow this structure. They
operate on a Tag, Length and Value (TLV) scheme. The structure is therefore recursive such
that the contents can be a series of TLVs.
 TYPES AND VALUES

➢ A type is a (non-empty) set of values, and represents a potential for conveying information.
Only values are actually conveyed, but their type governs the domain of possibilities.
➢ There can be two types:
○ Primitive:
For example,
■ INTEGER
■ BOOLEAN
■ OCTETSTRING

○ Constructed: A constructed type is defined by reference to one or more other types,

which may be primitive or constructed
For example,
■ UNIVERSAL SEQUENCE
■ SETOF
■ SET
■ CHOICE
■ SEQUENCEOF
An example of a constructed type:

personnelRecord ::= SEQUENCE

{
empNumber INTEGER
name IA5String
yrsWithCompany INTEGER
married BOOLEAN
}
To allow the individual elements within a structured type to be referenced, ASN.1 supports the concept of
tagging. This involves assigning a tag or identifier to each element and is analogous to the index used
with the array type found in most high-level languages.

The tag may be declared to be one of the following:

● CONTEXT-SPECIFIC: the tag has meaning only within the scope of the present structure type;
● APPLICATION: the tag has meaning in the context of the complete application (collection of
types);
● PRIVATE: the tag has meaning only to the user.
 Data security

● Large amount of data storage has become common in present time.

● Major problem with storing large amounts of data is to properly weigh the cost and benefits
associated with the security measures.
● The most secure systems are so because of the increased measures to protect the data, but each
additional measure comes with a cost in terms of both convenience and processing time.
● Multimedia applications generally present a restrictive set of criteria for storage because
performance is critical; real-time deadlines must be met for data retrieval or the application
may degrade to an unacceptable level.
● One solution to the above requirement is Data encryption.
 Terminology

➢ Data encryption involves processing all data prior to transmission.

➢ Most involves use of an encryption key, known to the two correspondents.
➢ Plain text after encryption is referred as ciphertext.
➢ An encryption method should be such that an intruder, even with access to a powerful
computer, cannot decipher the recorded ciphertext.
 Basic Techniques

➢ Method : Substitute the plain text alphabets with a new alphabet (ciphertext alphabet)
➢ Ciphertext alphabet can be defined as that which is shifted by n places.

Plaintext alphabet: a b c d e f . . .
Ciphertext alphabet: d e f g h i . . .

➢ Problem : Statistical property of text can be exploited by an intruder to break the code.
➢ Alternative : To reorder (transpose) the characters in groups.
➢ That is to create groups of fixed size and then send first alphabet of groups together followed
by second and so on.
 Data Encryption Standard (DES)

➢ DES algorithm is a block cipher, works on fixed sized blocks of data.

➢ Blocks of 64 bits are created, a unique 56 bit key is used to encrypt each block
➢ Receiver uses same key for decryption.
➢ It provides sufficient security for most commercial applications.
➢ 56-bit key derives 16 subkeys each of 48 bits for substitution operations.
➢ An alternative mode of DES is known as cipher feedback mode (CFM) has also been defined
which operates on 8bit boundaries.
➢ CFM is useful when encryption operation is being performed at the interface with the serial
transmission line.
 Data Encryption Standard (DES)

➢ The algorithm comprises the following steps :

1. Simple transposition of 64bit block using fixed transposition rule.
2. Transposed text go through 16 iteration of substitution processing each with different subkey.
3. The most significant 32 bits of 64bit output are exchanged with least significant 32bits
4. Inverse of transposition of that done is step 1 is used to produce ciphertext.
5. DES is such that decipher can be performed by repeating these steps in reverse order.
6. To produce the 16 subkeys, first the 56bit key is transposed and split into 28bit halves, and
rotated left and recombined.
7. The 56bits are then transposed once again using a compression operation to produce a subkey
of 48bits.
8. Number of rotation is determined by the number of subkey to be created.
 International Data Encryption Algorithm (IDEA)

➢ It is also a block cipher method, and operates on same 64bit blocks.

➢ It uses 128 bit key and more sophisticated processing in each phase.
➢ Designed to work well with both hardware and software (particularly 16-bit microcontroller)
➢ Each block passes through series of 8 bit manipulation iterations, followed by final
transposition.
➢ 128bit key produces 52 subkeys each of 16bits.
➢ 6 subkeys are used in each iteration.
➢ Last 4 are used in final transpositon.
➢ Decryption uses the same algorithm but with a modified set of keys.
 RSA Algorithm

➢ DES and IDA both use same key for encryption and decryption.
➢ The distribution of keys is a major problem with private key encryption systems.
➢ To overcome this public key method is used.
➢ Different key are used for encryption and decryption.
➢ Number theory is used to develop two numbers, such that encryption by one can be decrypted
by only the second number.
➢ Second number cannot be derived from the first.
➢ First number form the public key, and other is the private key.
➢ Any one can send an encrypted message to a particular user with the public key, but can only
be decrypted by the one having the private key.
➢ Issue of receiving a forged message from a non legitimate source, which needs to be solved by
proper authentication and nonrepudiation.