B.Tech (SEM IV) THEORY EXAMINATION 2019-20 ENGINEERING MATHEMATICS – III [Time: 3:00 Hours] Total Marks: 70 Note: Attempt all Sections. If require any missing data: then choose suitably. SECTION-A Attempt all questions in brief: 2 x 7 = 14 Derive the Mean and Variance of the Binomial Distribution. Write Newton cote’s Quadrature formula. What do […]

## MAC, Types of attacks, HMAC and CMAC.

A cryptographic Message Authentication Code (MAC) is a short piece of information used to authenticate a message.

AMAC algorithm accepts as input a secret key and an arbitrary length message to be authenticated, and outputs a MAC.

## Requirements of Message Authentication Code and MD5 algorithm.

requirements of a Message Authentication Code (MAC) ? Discuss the logical structure, components and algorithmic steps of MD5 algorithm.

## Securities of RSA,

What are the securities of RSA? Perform encryption and decryption using RSA algorithm for p=17, q=11,e=7, m=88.

## RSA Algorithms, encryption and decryption function.

The RSA algorithms is based on the mathematical part that it is easy to find and multiply large prime numbers together, but it is extremely difficult to factor their product.

## Chinese Remainder based Numerical.

using Chinese Remainder Theorem solve the simultaneous congruence X = 2 mod P for all P ∊ (3, 5, 7).

## Euler’s totient function, primality testing? What are its categories?

Euler’s totient function, (Euler’s phi function) denoted as ɸ(n), is the function contains number of positive integers that are smaller than n and relatively prime to n. The set of these numbers is represented by Zn.

## Advanced Encryption Standard (AES), Fermat’s little theorem, Euler theorem.

Que. Write a short note on AES. Answer: AES (Advanced Encryption Standard) is a block cipher intended to replace DES for commercial applications. It uses a 128-bit block size and a key size of 128, 192, or 256 bits. AES does not use a Feistel structure. Instead, each full round consists of four separate functions […]

## Group Field, finite field of the form GF(p) & GF(2^n)

Group, Fields and GF(p) fields

Group: A group G, denoted by {G, •}, is a set of elements with a binary operation ‘•‘ that satisfies following four properties:

## Security Attacks, Services and Mechanism?

Security attacks is defined as an attempt to gain unauthorized access to information system.