(SEM VII) THEORY EXAMINATION 2019-20 CRYPTOGRAPHY AND NETWORK SECURITY

SECTION A – Explanation

Section A of the Cryptography and Network Security paper is designed to test the student’s basic understanding of cryptographic concepts, mathematical foundations, and security services. All questions in this section are compulsory and require short but conceptually accurate answers. The examiner mainly checks whether the student is familiar with fundamental security terminology and principles that are used throughout the subject.

The questions in this section include explanation of active and passive attacks, statement of Fermat’s theorem, benefits of IPsec, determination of GCD using Euclid’s algorithm, reason for using trapdoor one-way functions, role of compression function in hash functions, and services provided by Pretty Good Privacy (PGP). These questions cover cryptographic attacks, number theory, network security protocols, hash functions, and secure email mechanisms.

For example, the question on active and passive attacks tests understanding of how attackers either modify data or only observe communication. Fermat’s theorem checks basic number theory knowledge used in public key cryptography. IPsec benefits test awareness of network-layer security. The trapdoor one-way function question evaluates understanding of asymmetric cryptography. The hash compression function question checks understanding of data integrity mechanisms. PGP services test understanding of encryption, authentication, and digital signatures. Answers in this section should be brief, precise, and written using correct cryptographic terminology. Lengthy explanations are not required, but conceptual clarity is essential to score full marks.

SECTION B – Explanation

Section B evaluates the student’s conceptual understanding and application of classical and modern cryptographic algorithms and malware security. Students are required to attempt any three questions, which allows them to choose questions based on their preparation strength. The questions in this section require descriptive answers and step-by-step explanation of algorithms.

The questions in Section B include performing encryption and decryption using Hill cipher for a given message and key, explanation of MD5 hash processing using 512-bit blocks, analysis of various types of computer viruses and their countermeasures, explanation of Triple DES and its applications, and statement and proof of the Chinese Remainder Theorem along with finding the last two digits of a given power. These questions combine cryptographic algorithms, hash functions, malware analysis, and mathematical foundations.

For instance, the Hill cipher question tests understanding of matrix-based encryption and modular arithmetic. The MD5 question evaluates understanding of hashing process, padding, block processing, and compression functions. Virus analysis questions test awareness of malware types and security countermeasures. Triple DES questions evaluate knowledge of symmetric encryption strengthening. The Chinese Remainder Theorem question tests mathematical reasoning essential for cryptographic computations. Answers in this section should be written in a logical flow, starting with basic explanation followed by algorithm steps, calculations, or proofs where required. Each answer generally spans about one and a half to two pages.

SECTION C – Explanation

Section C is the most important and highest-weight section of the Cryptography and Network Security paper. This section tests the student’s in-depth understanding, analytical ability, and practical knowledge of cryptographic systems and network security mechanisms. Each question provides internal choices, and students must attempt only one part from each question.

Although the visible page mainly shows Sections A and B, based on standard AKTU paper patterns, Section C typically includes long-answer questions on advanced cryptographic topics such as public key cryptography algorithms, RSA algorithm with key generation and security analysis, digital signatures, authentication protocols, key management, firewall architectures, intrusion detection systems, and network security protocols. These questions require detailed explanation, diagrams, algorithmic steps, and mathematical justification where applicable.

Answers in Section C are expected to be well structured, starting with definitions, followed by explanation of working principles, security analysis, advantages, limitations, and applications. Each answer usually extends over two to three pages and plays a decisive role in determining the final score. Clear presentation, correct terminology, and logical flow are extremely important in this section.

Overall Understanding of the Paper Pattern

The Cryptography and Network Security (RIT-701) question paper is structured to evaluate students progressively from basic security concepts to advanced cryptographic algorithms and network protection mechanisms. Section A focuses on foundational definitions and concepts, Section B evaluates algorithmic understanding and mathematical reasoning, and Section C tests deep understanding of cryptographic systems and network security architecture. Students who understand this structure can prepare effectively by revising fundamentals for Section A, practicing algorithms and proofs for Section B, and mastering long descriptive answers related to cryptography and network security for Section C.

A strong preparation strategy includes understanding encryption algorithms, hash functions, malware security, number theory, and network security protocols. Section C carries the highest weight and requires special attention for scoring high marks.