Search This Blog

Friday, 21 August 2026

Assignments Questions on Information Security

0 comments

Assignment-1 Questions


SET-1:

  1. Differentiate active and passive security attack.
  2. Write short notes on Data confidentiality.
  3. Explain symmetric cipher model with diagram.
  4. Compare and contrast linear cryptanalysis and differential cryptanalysis.
  5. Write RSA algorithm and explain with one example
  6. Explain simple secret key distribution with diagram.


SET-2:

  1. What is known as security attack?  Also define the term IP security.
  2. Draw and explain the general Structure of Secure Hash Code.
  3. Draw the diagram and explain Public-Key Distribution Scenario.
  4. How DES Signing and Verifying is done? Explain.
  5. State the properties and requirements of digital signature.
  6. Differentiate RSA and DES approach for digital signature.


SET-3:
  1. Compare and Contrast between Symmetric and Asymmetric key cryptography.
  2. Discuss in detail about AES algorithm.
  3. Discuss in details about cipher block modes of operation.
  4. What do you mean by the Kerberos Realm? Explain the working of Kerberos.
  5. What are the advantages of Key Distribution?  What are different approaches to Public-key Management?









SET-4:

  1. What the principles of public key cryptosystems?  List the 6 ingredients of public key encryption.
  2. Name the security services available for Information Security.  What are the requirements for (message) authentication?
  3. Describe DES algorithm with neat diagram and explain the steps.
  4. Explain in detail about various security attacks.
  5. Explain the ceaser cipher.  And brief the strengths of triple DES.
  6. Explain RSA algorithm, perform encryption and decryption to the system with p=7, q=11, e=17, M=8

SET-5:

  1. Explain Diffie-Hellman key exchange algorithm in detail
  2. Explain digital signature standard with necessary diagrams in detail.
  3. Differentiate between interruption and interception attacks.
  4. Outline the concepts of authentication and access control.
  5. Outline the concept of traffic confidentiality and its significance in network security.
  6. Define Blowfish cipher and highlight its major advantages.


SET-6:

  1. Compare RSA with Elliptic Curve Cryptography (ECC) in terms of key size, security, performance and application.
  2. Illustrate SHA-512 algorithm with suitable example.
  3. Explain HMAC algorithm in detail.
  4. Outline the major applications of digital signatute.
  5. Classify the authentication protocols and list out their features.
  6. List the advantages and limitations of Kerberos.

Continue reading →
Thursday, 6 August 2026

April/May 2025 Question Paper on CNS

0 comments

Two Mark Questions

1 A: Define Cryptography.
1 B: Write the difference between Symmetric and Asymmetric ciphers.
1 C: Define Stream ciphers.
1 D: Define Block ciphers.
1 E: Name any two applications of Cryptographic Hash functions.
1 F: What are the requirements of Hash functions.
1 G: Define Smart Contract.
1 H: What is the importance of Consensus?

Five Mark Questions

SECTION - I:

2.A: Convert "MEET ME" using the Hill cipher with the 3x3 encryption key given below.  Try converting the ciphertext back to the plaintext.
2.B: Discuss any two Substitution Techniques and list their merits and demerits.

(OR)

3.A: Explain the substitution ciphers - Playfair cipher and Vernam cipher.
3.B: Explain the basic principle of Rotor Machine.


SECTION - II:

4.A: Briefly explain the design principle of Block Ciphers.
4.B: Discuss in detail about DES Algorithm.

(OR)

5.A: What are the design parameters of Feistel Cipher Network?
5.B: Write the difference between ECB and CBC with neat diagram.



Continue reading →
Tuesday, 4 August 2026

November/December 2024 Questions on CNS

0 comments

Two Mark Questions

1.A  Define Stegnography.
  • Steganography is a technique for hiding a secret message within a larger one in such a way that others cannot discern the presence or contents of the hidden message.
  • While cryptography renders a message unintelligible to outsiders using various text transformations, steganography focuses on concealing the very existence of the message itself.
1.B  What are the two basic functions used in encryption algorithms?
  • All encryption algorithms are fundamentally based on two basic functions (or building blocks) for transforming plaintext into ciphertext
    • Substitution: This is a technique in which each element in the plaintext (such as a bit, letter, or group of bits or letters) is uniquely mapped into or replaced by another element.
    • Transposition (or Permutation): This is a technique in which the elements in the plaintext are systematically rearranged or transposed in their positions. No elements are added, deleted, or replaced; only their order is changed.
1.C  List the attacks on Block Ciphers.
  • Symmetric block ciphers can be subjected to several types of attacks depending on the information available to the cryptanalyst, the mathematical properties of the algorithm, and the physical implementation of the cipher
  • The primary attacks identified in your sources include:
    • Brute-Force Attacks (Exhaustive Key Search): The attacker tries every possible key on a piece of ciphertext until an intelligible translation into plaintext is obtained.
    • Cryptanalytic Attacks: Cryptanalysis relies on exploiting the mathematical or structural characteristics of the encryption algorithm, sometimes combined with statistical properties of the plaintext or sample plaintext-ciphertext pairs.
1.D  Define group and ring.
    1.E  What is a Substitute byte transformation in AES?
      1.F  Write the difference between public key and private key.
      • In asymmetric (public-key) cryptography, a user possesses a paired set of mathematically related keys: a public key and a private key.
      • These keys perform complementary cryptographic operations,but they differ fundamentally in their accessibility, confidentiality, and specific roles in securing communications:
        • Public Key: This key is made publicly available. It is placed in a public register, directory, or other accessible file, allowing any participant in the network to access it
        • Private Key: This key must be kept strictly secret. It is generated locally and is known only to the individual owner who created it; it is never distributed over the network
      1.G  Define Hash Function.
        1.H  What are the challenges of creating a sustainable ecosystem?


        Five Mark Questions

        SECTION I:

        2.A) Explain the Play Fair cipher algorithm?  Encrypt the message 'MY BALOON' using the key 'MONACRY'. 

        The Playfair cipher is a symmetric encryption technique that encrypts pairs of letters (digraphs) instead of individual letters. It uses a 5 × 5 matrix containing the letters of the alphabet (I and J are treated as the same letter).

        Encryption Steps:

        1. Choose a key and remove duplicate letters.
        2. Construct a 5 × 5 matrix:
          a. Write the unique letters of the key first.
          b.  Fill the remaining cells with the unused letters of the alphabet.
          c.  Combine I and J into one cell.

        3. Prepare the plaintext:
          a.  Remove spaces.
          b.  Split the message into pairs of letters.
          c.  If both letters in a pair are the same, insert X between them.
          d.  If one letter remains at the end, append X.

        4. Encrypt each pair using these rules:
          a.  Same row: Replace each letter with the letter to its right (wrap around if necessary).
          b.  Same column: Replace each letter with the letter below it (wrap around if necessary).
          c.  Different row and column: Replace each letter with the letter in the same row but in the column of the other letter (rectangle rule).

        Here is an Example:

        Key: MONARCHY (assuming "MONACRY" is a typo; the standard Playfair key is "MONARCHY")

        Step 1: Construct the Matrix



        Step 2: Prepare the Plaintext
        • Given Plaintext is: MY BALLOON
        • After removing spaces, the plaintext becomes: MYBALLOON
        • Form digraphs from the plaintext:
        MY
        BA
        LX (insert X because of repeated LL)
        LO
        ON

        Step 3: Encrypt Each Pair
        1. MY
        M → (1,1)
        Y → (2,3)
        Rectangle rule:
        M → N
        Y → C
        MY → NC

        2. BA
        B → (2,4)
        A → (1,4)
        Same column:
        B → I
        A → B
        BA → IB

        3. LX
        L → (4,1)
        X → (5,4)
        Rectangle rule:
        L → S
        X → U
        LX → SU

        4. LO
        L → (4,1)
        O → (1,2)
        Rectangle rule:
        L → P
        O → M
        LO → PM

        5. ON
        O → (1,2)
        N → (1,3)
        Same row:
        O → N
        N → A
        ON → NA

        Ciphertext Generated: NC IB SU PM NA

        Final Ciphertext is: NCIBSUPMNA


        2.B)  Briefly define the Monoalphabetic Cipher.  What is the difference between monoalphabetic cipher and a polyalphabetic cipher?

        • A monoalphabetic substitution cipher is an encryption approach in which each plaintext letter always maps to the same ciphertext letter throughout the message.
        • The Caesar-shift cipher is one of the major examples of a monoalphabetic cipher, in which every letter shifts on the basis of a numeric key.
        • In contrast, a polyalphabetic substitution cipher improves on the monoalphabetic technique by using different monoalphabetic substitutions successively as one proceeds through the plaintext message
        The primary differences between the two category of ciphers are as follows:
        1. The Number of Alphabets and Rules Used: Monoalphabetic ciphers rely on a single mapping rule per message, whereas polyalphabetic ciphers utilize a set of related monoalphabetic substitution rules
        2. The Role of the Key: In a polyalphabetic cipher, the key determines which specific monoalphabetic rule is chosen for each given character transformation in the sequence
        3. Character Mapping (One-to-One vs. One-to-Many): In a monoalphabetic cipher, a plaintext letter is always replaced by the same ciphertext letter. In a polyalphabetic cipher (such as the Vigenère cipher), there are multiple possible ciphertext letters for each plaintext letter, depending on the active key character
        4. Resistance to Letter Frequency Analysis: Monoalphabetic ciphers are relatively easy to break because they fully reflect the letter frequency data of the original plaintext language. Polyalphabetic ciphers are more secure because utilizing multiple substitution alphabets obscures this frequency information, making simple frequency analysis much more difficult

        3.A) Explain about Hill cipher.  Consider the plaintext “paymoremoney” and use the encryption key K given below to find the cipher text:
        • The Hill cipher, developed by the mathematician Lester Hill in 1929, is a prominent example of a multiletter (or polygraphic) substitution cipher
        • Unlike traditional substitution ciphers that encrypt letters one by one, the Hill cipher processes blocks of letters simultaneously using concepts from linear algebra and matrix arithmetic modulo 26
        How does the Hill Cipher Work?
        • To encrypt a message using the Hill cipher, the plaintext is first divided into blocks of a fixed size, . Each letter in the block is converted into a numerical value from to (
        • The encryption process takes a block of plaintext letters (represented as a row vector ) and multiplies it by an encryption key matrix
        C=PK(mod26)
        where is the resulting ciphertext row vector


        Decryption Process:

        Decryption reverses the process by multiplying the ciphertext vector by the multiplicative inverse of the key matrix

        Encryption using 3x3 Key Matrix:


            4. Convert numbers back to letters: translates to "RRL"

        By repeating this calculation block-by-block for "mor", "emo", and "ney", the final ciphertext is RRLMWBKASPDH


        3.B)  Discuss any four substitution techniques of encryption and list their merits and demerits.

        SECTION - II:

        4.A: Compare and contrast stream ciphers and block ciphers.
        4.B: Explain how GCD is calculated with Euclid’s algorithm and calculate the GCD of (270, 192).

        (OR)

        5.A: Explain the DES algorithm with a neat sketch.

        SECTION - III:

        6.A: Explain the four tasks performed in each round of the AES Cipher.
        6.B: Given p=19, q=23, and e=3, use the RSA algorithm to find n, (n), and d.

        (OR)

        7.A: Explain how to use the Chinese Remainder Theorem to reconstruct integers from their residues modulo functions.
        7.B: Briefly explain the Diffie Hellman key exchange with an example.

        SECTION - IV:

        8.A: Explain the Secure Hash Algorithm with a neat sketch.

        (OR)

        9.A: Explain the requirements of hash functions.
        9.B: Explain the applications of Cryptographic Hash Functions.

        SECTION - V:

        10.A: Explain how decentralization in blockchain provides advantages over traditional centralized systems.
        10.B: Describe the Bitcoin protocol in detail.

        (OR)

        11.A: Explain what smart contracts are and how they operate on a blockchain network.
        11.B: Compare and contrast Proof-of-Work (PoW), Proof-of-Stake (PoS), and Delegated Proof-of-Stake (DPoS)




        Continue reading →
        Monday, 20 July 2026

        Lab Manual for IS & CNS Laboratories

        0 comments

        Lab Manuel:


        List of Experiments in Information Security Laboratory:

        1. Substitution Cipher Techniques
        • Perform encryption and decryption using:
          • Caesar Cipher
          • Playfair Cipher
          • Hill Cipher
          • Vigenère Cipher

        2. Transposition Cipher Techniques
        • Perform encryption and decryption using:
          • Rail Fence Cipher
          • Row & Column Transformation Cipher

        3. Data Encryption Standard (DES)
        • Apply DES algorithm for practical applications.

        4. Advanced Encryption Standard (AES)
        • Apply AES algorithm for practical applications.

        5. RSA Algorithm
        • Implement RSA Algorithm using HTML and JavaScript.

        6. Diffie–Hellman Key Exchange
        • Implement the Diffie–Hellman Key Exchange algorithm for a given problem.

        7. SHA-1 Hashing
        • Calculate the message digest of a text using the SHA-1 algorithm.

        8. Digital Signature Standard (DSS)
        • Implement the Signature Scheme / Digital Signature Standard.

        9. Intrusion Detection System (IDS)
        • Demonstrate an IDS using any tool such as Snort or other software.

        10. Vulnerability Assessment Tool
        • Explore automated attack and penetration testing tools using N-Stalker (Vulnerability Assessment Tool).

        11. Malware Analysis / Detection
        • Defeating Malware – Building Trojans, Rootkit Hunter.








        Continue reading →
        Sunday, 28 June 2026

        Course details of Cryptography & Network Security (CNS)

        0 comments

        (2212PC03) CRYPTOGRAPHY AND NETWORK SECURITY

        Course Objective:

        • The course provides an overview of the various encryption techniques, how to use them to protect the data.
        Course Outcome:

        • Understand basic encryption methods and algorithms, he strengths and weaknesses of encryption algorithms
        • Understand encryption key exchange and management
        • Understand how to deploy encryption techniques to secure data stored on computer systems
        • Understand how to deploy encryption techniques to secure data in transit across data networks and also to demonstrate best practice deployment of cryptographically technologies
        UNIT I:

        UNIT II:
        • Stream Ciphers and Block Ciphers
        • Attacks on block ciphers
        • Block Cipher Principles
        • Block Cipher Design Principles
        • Group, Rings, Field
        • Polynomial Arithmetic
          • The Euclidean Algorithm
          • Finite Fields of the Form GF(2n )

        UNIT III:
        • Advanced Encryption Standard (AES)
        • Stream Ciphers
          • RC4
        • The Chinese Remainder Theorem
        • Public Key Cryptography
          • RSA Algorithm
        • Diffie-Hellman Key Exchange
        • Elliptic Curve Cryptography

        UNIT IV:
        • Cryptographic Hash Functions
        • Applications of Cryptographic Hash Functions
        • Two Simple Hash Functions
        • Requirements and Security
        • Secure Hash Algorithm (SHA), SHA-3

        UNIT V:
        • Introduction to Block Chain
          • Bitcoin basics
          • Smart Contracts
        • Blockchain development platforms and APIs
          • Blockchain Ecosystems
          • Ethereum, Distributed Consensus
          • Blockchain Applications

        TEXT BOOK :
        1. Stallings, William. Cryptography and network security, Principle and Practice. Pearson Education India, 2017.
        REFERENCES:
        1. R. Stinson Cryptography, Theory and Practice (Fourth Edition Edition)
        2. Handbook of Applied Cryptography by A. Menezes, P. Van Oorschot, S. Vanstone.
        3. Melanie Swan, Blockchain, Blueprint for a new Economy, Oreilly.
        Continue reading →
        Thursday, 4 June 2026

        Presentations and Video Lectures on CNS & IS

        0 comments

        Useful Resources for Learning IS & CNS

        Here are few Presentations on the basics of Information Security:
        1. Introduction to Information Security.
        2. Model for Security & Symmetric Encryption
        3. History and Overview of Cryptography
        4. Introduction to Transposition & Block Ciphers
        5. Data Encryption Standard & Algorithm










        Continue reading →
        Tuesday, 2 June 2026

        Course Detail of the Subject - Information Security

        0 comments

        INFORMATION SECURITY (2205PC13) 


        Credits: 3

        Prerequisites: Computer Networks, Mathematics 

        Course Outcome:

        Upon successful completion of this course, students will be able to:
        1. Classify security attacks, services, and mechanisms, and apply classical & block ciphers (DES, Blowfish) with appropriate modes.
        2. Implement public key algorithms (RSA, Diffie-Hellman, ECC) and use hash functions & MACs (SHA-512, HMAC) for authentication.
        3. Apply digital signatures, Kerberos, X.509, and configure email security (PGP, S/MIME).
        4. Analyze IPSec (AH, ESP, key management) and evaluate web security protocols (SSL/TLS, SET).
        5. Identify malware and intruders, and design firewall rules & IDS for network defense.

        UNIT ISecurity Attacks, Services & Classical Encryption

        • Attacks
          • Interruption
          • Interception
          • Modification
          • Fabrication
        • Services
          • Confidentiality
          • Authentication
          • Integrity
          • Non-repudiation
          • Access Control
          • Availability
        • Classical encryption
        • DES
          • Strength of DES
        • Differential & linear cryptanalysis
        • Block cipher principles
          • Modes of operation
        • Blowfish
        • Traffic confidentiality
        • Key distribution
        • Random number generation

        UNIT II – Public Key Crypto & Message Authentication
        • Public key principles
          • RSA
        • Key management
          • Diffie-Hellman
        • Elliptic Curve Cryptography
        • Message authentication
        • Hash functions
          • MACs
          • SHA-512
          • HMAC

        UNIT III – Digital Signatures & Email Security
        • Digital signatures
        • Authentication protocols
        • Digital Signature Standard
        • Kerberos
        • X.509
        • Email security: PGP, S/MIME

        UNIT IV – IP & Web Security
        • IP Security (IPSec)
          • Architecture
          • AH
          • ESP
          • Security Associations
          • Key Management
        • Web Security
          • SSL/TLS
          • SET (Secure Electronic Transaction)

        UNIT V – Intruders, Malware & Firewalls
        • Intruders
          • Viruses
          • Worms
        • Firewall design principles
          • Trusted systems
          • Intrusion detection systems (IDS)

        Text Book:
        • Cryptography and Network Security – William Stallings, Pearson, 4th Ed.
        Reference Books
        1. Network Security Essentials – Stallings (Reference)
        2. Principles of Information Security – Whitman, Thomson (Reference)

        Link for Joining the Classroom for learning this subject
        Continue reading →