of aes SeREME sr toss | I TT I | BCS703 Seventh Semester B.E./[Link]. Degree Examination, Dec.2025/Jan.2026 Cryptography and Network Security Time: 3 hrs. Max. Marks: 100 | Note: I. Answer any FIVE full questions, choosing ONE full question from each module. 2M: Marks , L: Bloom's level , C: Course outcomes. Module — MILT ¢ Q.1 | a. | Obtain Ciphertext for the given plaintext “HILLCIPHER™ by applying the | 7 | L3 | COI | 03 02 | | Hill Cipher technique using key K = [ve oe | | Write a short note on Steganography and its advantages and disadvantages. | 6 | L2 | COI | |e. | With a neat diagram, explain the model for network security. 7/12) COI OR Q2 Ja. | State the rules used for entjptighy i PEA YE AIR cipher and encrypt the [ 7 message “COMPUTER” usimg/ the keyw: “ENGINEERING” using PLAYFAIR cipher. 2 ». | Describe simple XOR and one — time pad encryption techniques with an| 7 example and their difficulties, lock diagram, explain the various steps involved in encryption and | 6 key generation of the DES algorithm. Mor 2 a Demonstrate the Diffie ~ Hellman key exchange algorithm. 8 ] 12] Cor . | Perform cneryption and decryption using the RSA algorithm given public| 7 | L3 | CO2 key is 6 for two prime numbers 17 and 31 with message 3 | . | Describe the fundamental requirements that a public key eryptosystem must| 8 | L2 | CO2 | meet to ensure security OR Q4 [a.] Explain briefly the elliptic curve cryptography and mention two] 8] L2| C02 applications. b. | Let q= 719 and g= 5, Xa = 157 , Xb = 293. Use the Diffie Hellman Key | 7 | L3 | CO2 exchange algorithm to find Ya, Yb and Secret key K. ¢. | Briefly explain the security aspects of the RSA algorithm. hof2BCS703 Moduie-3 = a Q.5 | a. | Explain the symmetric key distribution using Asymmetric Encryption. 7 | 12 | co3 B. | Explain the role of cryptographic hash functions in message authentication | 8 | L2 | CO3 with a neat diagram. | Te. | Discuss the general elements of an X.509 certificate, 5 [12/ Co3x) aa OR | | Q6 | a. | What is Key Management? Explain with a neat diagram, how key usage | 7 | L2 | CO3 can be controlled in encryption and decryption using control vectors b, | Describe the architecture of the Public Key Infrastructure X.509 (PRIX) | 8 | 12 | CO3 model with a neat diagram. «. | Write a short note on the various schemes of public key distribution. 5 | 12 | CO3 L Module—4 | a. | Explain functions and cryptographic algorithms used in S/MIME] 8 | L2 | CO4 functionality a8 b. | Define TLS and explain its anergy @nedt diagram. 7 | 12 [COs . | Bring out the differences between Kerberos version 4 and version 5 3/12 | Cos OR a Q8 | a. | Describe remote user authentication using asymmetric encryption. Ts [12] cos b. | Explain Pretty Good Privacy ( PGP) message transmission and reception | 7 | L2 | CO4 with a neat diagram. €. | Elaborate on the various security approaches that address web security| 5 | L2 | CO4 threats. ‘Module —5 Q9 Ja. | How does Domain Keys Identified Mail (DKIM) address the threats posed | 8 | L2 | COS by email attackers and what is its strategy for email authentication? b. | Explain Internet Key Exchange (IKE) key determination features. 7/12 | Cos . | Explain Basic combinations of Security Associations 3 [12 | Cos } OR ‘Q.10 J a. | Iilustrate the key components of the Internet mail architecture with a clear | 8 | L2 | COS diagram. b. | Explain the Encapsulating IP Security Payload 7/L2/ Cos} [ ¢. | Describe the functional flow of Domain Keys Identified Mail (DKIM). 5112) cos] 20f2Re: regarding scheme sr Mohan H S HoD, CSE - Data SC" <[Link]@[Link]? January 22, 2026 2:05 PM To: boe@[Link] ° Registrar(Evaluation) VTU, Belagavi Dear Sir, Herewith, [sharing the opinion of Qp-scheme modifications of the subject of VII sem CSE cluster ( BCS703) Cryptography and Network Security Cur members of CSE cluster-BoE went through the scheme thoroughly and it was found that a solution is wrong and 3b Decryption cannot be performed for the given value. So kindly Consider the attached modified Scheme for the above sub questions. Thanking you Regards Dr. Mohan H S |91-9986079014 RNSIT-CSE(DS) /[Link]@rsitacin g N mas RR Nagar Post Channasandra, |Bengaluru, 560 098 Linked E59 piips:/[Link]/mohan-hs-b25b95311/ Ayuowan [Link] .[Link]/profile/205371 Vision « APPROVED” On Tue, 20 Jan 2026 at 12:27, wrote: Ay of Bs Revaluation) rer incietUnvertty 18 3 Ue’CNS ~BES 702 Crypbyph & nebwms = Sawairy 24) PLAYFAIR CiPhor Keyword : ENGWEERING Mmebege - CompuTeR @ not Rules be Enaphon - The Playfair CiPher ercyPdon Afllowg trese wlops “Prpaw fe YXS by matix * Divide Ra Mmetage. rerh (0irA Alply te encryption yuleg Conctnck WL SxS matnx Cottudag debbie Letters » © EM CW EERIVG*) > ENGIR AGCDF HELM Pa STV VwryZd SPhi “ ComuTeR" son pas Co mp vt Ek Encrypt ung Playfar- rales o 60 ss CL e®) Maser ‘OP. —> AT “UT 9 py * RINE werk egtT PU WE36) RSA eee Wek 9 dae Prive ns ark Ze Peelh ,¢ = 3) CEN) Sep 2: Cds n> PX? hs/Fk3l>5a> SP 3. Caladale Gin) = (P-) fe-1) Pind = 16X30 = 480 VPA? Choore (ale & @ Ces ( Gx J Condi: 1) 12 &@ coms 1262480 (TRUE) i) gtd (Gm) 0) Aarged ( (80,6 )¢) (rats) ol value. Cannot be calalohid a va Co mtorod = 3 Sod fAF = B00 wee ALPEN” Cand ye perbroed tecmde val a ups Enuy Ph . — —— Ktrores 2 TC nenernatl) Boe day cs Chany. wy CONTINOUS INTERNAL EVALUATION I - (2022 CBCS Scheme) Course: Cryptography and network security Sub Code: BCS703 Semester: _VIT Evaluation Scheme ] 5 ‘Max QN. Scheme & solution hee Ta) | Obtain Cipheriext for the given plaintext “HILLCIPHER” by applying Hill Cipher technique 7 using key K= (03. 02 08 05) ‘To encrypt the plain text "HILLCIPHER" using the Hill Cipher with the given key matrix: K=(03 02 08 05) Step 1: convert plaint text to numerical values (A=0, B=1, ~ HILLCIPHER 7811112815 7417 , Z-25) (2 marks) Step 2: Represent the values into 2x2 matrix vectors (mark) P=(07 08 wa 02 08 15.07 |} 04 17) Step 3 : Apply the Hill cipher formlak C=PK mod 26 (3 marks) C=(7 8)(03 02 mod 26 08 05) (793+8*8), (7#2+8*5)] mod 26 = [(21+64), (14+40)] mod 26 = [85, 54] mod 26 = [7,2] Similarly, calculate for other values Now, the ciphertext matrix C= (07 02 17 25 18 18 2B 13 18 15) ‘ Mapping the numbers to the letters and the final cipher text = HCRZSSXNSP_(1 mark) Tb) |] Write a short note on Steganography with its advantages and disadvantages. 6 Definition: (1 Mark) Steganography is the technique of hiding secret information within a non-secret file or message to prevent detection. It can be applied to text, images, audio, and video files to ensure that the existence of the hidden message remains unknown. Advantages: (2 Marks) ‘s Secrecy: The message remains hidden, making it difficult for attackers to detect. = No Suspicion: Unlike encryption, which alters data visibly, steganography keeps the file unchanged to an observer. © Combination with Cryptography: Steganography can be used alongside encryption for an extra layer of security. Disadvantages; (2 Marks) ‘© Limited Payload: Only small amounts of data can be hidden within the cover medium, © Vulnerability to Detection: Advanced steganalysis techniques can detect and extract hidden messages. . Potential Misuse: Cybercriminals may use steganography for malicious purposes, such as transmitting hidden malware. Page | of 7Ss ‘Overall Clarity and Conciseness: (¥Marks) ‘The response should be well-structured, with proper explanation and relevant examples to support the points. Te) With a neat diagram, explain the model for network security. “Trusted thied party (ep. abiter, distributer Recipient Information ‘channel Opponent Neat Diagram (2 Marks) ‘A clear and labeled diagram of the network security model, showing the sender, receiver, ‘encryption, decryption, and possible attaeks,instrensmission. Explanation of Components (GMarks) ‘© Sender & Receiver: The entities involved ‘insecure communication. < Encryption & Decryption: Conversion of plaintext to ciphertext and back to plaintext. + Security Mechanisms: Authentication, integrity checks, and confidentiality to protect, data sAttackers & Threats» Potential fisks such a5 eavésdropping, tampering, and impersonation State the rules used foril@neryption in PLAYRAIR cipher and encrypt the message COMPUTER" using the keyword “ENGINEERING” using PLAYFAIR cipher. Tay _| Rules for Encryption: (G Marks) ‘The Playfair cipher encryption follows these steps; «Prepare the 5x5 Key Matrix: * Divide the Message into Pairs: |» Apply the Foilowing Encryption Rules: Enerypt "COMPUTER" using Keyword "ENGINEERING" (4 Marks): FP Construct the $5 matrix (excluding duplicate letters in "ENGINEERING"): ENGIR ABCDF HKLMO PQsTU VWXYZ «Split "COMPUTER' into pairs: CO MP UT ER «Encrypt using Playfair rules: o CO+GA o MP—+QS o UT+TU o ER-NI ‘Thus, the encrypted message is GAQS TUN. Page 2 of 7Tb] With a neat diagram, explain the model for network security. ‘Simple XOR Encryption: (3 Marks) Convert plaintext and key into binary. «Apply XOR operation between them. % Example: Encrypt "A" (01000001) using key "K" (01001011) 01000001 (A) 01001011 (K) 00001010 (J, encrypted text) ‘One-Time Pad: (4 Marks) ‘Uses a random key of the same length as the message. + Each bit is XORed with the key bit. © Perfect secrecy but impractical due to key distribution challenges. + Example: ©. Plaintext: "HELLO" — Binary co Key: Random binary of equal length © XOR applied to generate ciphertext. Difficulties: «Key Distribution: Requires segurelyysharing a qne-time key. «Key Length: Key must bees long ag the message, Reusability Issue: Ifa key is reused, encryption is editipromised. Ze) | With a block diagram, explain the various steps involved in encryption and key generat DES algorithm. 1. Overview of DES: (1 Mark) 2. Steps in DES Encryption: (3 Marks) 3. Key Generation: (2 Marks) ‘+ Key Scheduling Process: © 56-bit Key Selection (PC-1): The original 64-bit key is reduced to 56-bits by removing 8 parity bits. © Key Splitting: The 56-bit key is split into two 28-bit halves. Key Shifts & PC-2 Selection: The halves undergo left shifts and a Permutation Choice-2 (PC- 2) to generate 16 subkeys (48-bit each) for the 16 rounds Page 3 of 7Fay] Demonstrate the Diffie-Hellman key exchange algorithm. ‘The Diffie-Hellman key exchange is a method of securely exchanging cryptographic keys over fa public channel, It relies on the difficulty of computing diserete logarithms in modular arithmetic + Overview of the Algorithm (2 Marks) © Mathematical Steps : (G Marks) 6 Given large prime number (q) and a primitive root (g): = Alice chooses a private key XA and'computes YA = g*XA mod q. + Bob selects XB and computes YB = g°XB mod q. + The public keys YA and YB are exchanged. = The shared key is computed as K = (YBY‘XA mod q = (YAY'XB mod q | + Example Calculation (3 Marks) | © Ifq=353, g=3, XA=97, XB = 233, © Compute YA = 3497 mod 353 = 40 and YB = 34233 mod 353 = 248. “The shared secret K = (YB)°XA mod 353 = (YA)“XB mod 353 = 160 Fy | Perform encryption and decryption using RSA algorithm given public key is 6 for two prime numbers 17 and 31 with message 3. RSA encryption is based on the Qifficuli/SPaetGring, Iagge numbers. Given prime numbers p = 17 and q = 31, compute public and private keys ‘and engrypt message M = 3 using = 6. © Key Generation 2 XN (2 Marks) © Compute n= p x q= 17 x31 = 527 and a(n) = (P-1X4-1) = 16 x 30 = 480. © Select public exponent e = 6, compute private exponent d such that (¢ * d) mod o(n) =I. © Encryption (2 Marks) 6 C=M*e mod n=3%6 mod 527 = 729 mod 527 = 202. + Decryption (G Marks) M-=C’d mod n (requires computing d and verifying decryption) Fa [Deserbe the fundamental requirements tht a public Key eryproystem must meet 10 ensue security 1 Correctness (1 Mark) Computational Feasibility (1 Mark) Security (2 Marks) | Key Uniqueness (1 Mark) ay “| Explain briefly the elliptic ourve eryprography and mention 2 applications (2 Mathematical Foundation (G Marks) Advantages of ECC (2 Marks) Applications of ECC G Marks) Fy P at eo and ge. Ka=157, KOW29, Use DifieHeliman Key exchange algorithm to find Ya, Yb and Secret key K. Given: + Prime number (q) Primitive root (8) 19 . 5 © Private key XA = 157 293 Private key XI Page 4 of 7‘Step 1: Compute Public Keys (G Marks) Each user computes their public key using the formula: Y=g* mod Compute YA: 7 mod 719 ‘Compute YB: YB=5"" mod 719 Using modular exponentiation: YB= ‘These values YA = 248 and YB 87 are exchanged. Step 2: Compute the Shared Secret Key (4 Marks) | Both sides compute the same shared secret key using K=YB**mod q= YA*® mod q Compute K using YB:K=587'" mod 719 Using modular exponentiation: K=587'" mod 719 = 640 248” mod 719 Compute K using YA: 248% mod 719=640 Using modular exponentiatio Since both calculations give the same result, the shared secret key is K = 640. 4e) | Briefly explain the security aspects of the RSA algorithm Hardness of Integer Factorization (2 Marks) Padding and Side-Channel Attacks (1 Mark) Key Size and Performance (2 Marks) 3a) | Explain the symmetric key distribution using Asymmetric Eneryption Why It’s Needed (2 Marks) Process (@ Marks) 4 Sender encrypts a random AES key using recipient's public key. 4 The recipient decrypts it using their private key, ensuring secure communication. 4 This hybrid model is used in SSL/TLS connections, Example e = (2 Marks) 5b) | Explain the role of eryptographic hash functions in message authentication, with a neat diagram. % Definition & Properties (2 Marks) 4 Ensuring Message Integrity (3 Marks) Example & Diagram (3 Marks) 3e) Discuss the general elements of an X.509 certificate Definition & Importance _ (1 Mark) Page 5 of 7‘Components of X.509 Certificate G Marks) ‘Security Mechanism (1 Mark), Fay] What is key management? Explain, with a neat diagram, how key usage ean be controlled in encryption and decryption using control vectors ‘4 What is Key Management? (2 Marks) 4 Control Vectors in Encryption & Decryption (G Marks) & Diagram & Example (2 Marks) Gb) | Describe the architecture of the Public Key Infrastructure X.509 (PKIX) model with a neat diagram. Definition & Purpose (2 Marks) | ‘Components of PKIX (G Marks) Diagram & Functionality Z (G Marks) $<) | Write a short note on the various schemes of public key distribution Why Public Key Distribution is Needed (1 Marky Key Distribution Schemes (3 Marks) Security Considerations (Mark) 7a) | Explain functions and cryptographic algorithms used in S/MIME functionality. Overview of S/MIME (2 Marks) Core Functions (@ Marks) L Cryptographic Algorithms (G Marks) 7b) | Define TLS and explain its architecture with a neat diagram. Definition & Importance (2 Marks) TLS Architecture Components i G Marks) Diagram & Session Establishment (2 Marks) 72) | Bring out the differences between Kerberos version 4 and version 5 Purpose of Kerberos (1 Mark) Major Differences (G Marks) Security Enhancements (1 Mark) Fay | Describe remote user authentication using asymmetric encryption. | | Definition & Importance (2 Marks) | Authentication Process G Marks) Security Benefits & Diagram (G Marks) 35) | Explain Pretty Good Privacy (PGP) message transmission and reception with a neat diagram Overview & Purpose (2 Marks) Message Transmission Steps (G Marks) Diagram & Security Features i (2 Marks) F<) | Elaborate on the various security approaches that address web security threats, Overview of Web Threats (1 Mark) Security Approaches (3 Marks) Best Practices (1 Mark) Ta] How does DomainKeys ldentified Mail (DKIM) address the threats posed ‘by email attackers, and what is its strategy for email authentication? Purpose & Functionality (2 Marks) How DKIM Works. (3 Marks) L Security Benefits & Diagram G Marks) Page 6 of 7Jb) | Explain Internet Key Exchange (IKE) key determination features. Definition and Purpose (2 Marks) Key Exchange Process (3 Marks) Security Enhancements (2 Marks) 9) | Explain Basie combinations of security Associations. Security Associations (SAs) in IPsec (2 Marks) ‘Common SA Combinations (G Marks) Toa) | Mlustrate the Key components of the Internet mail architecture with a clear diagram Overview of Internet Mail (2 Marks) Core Components (4 Marks) @ Message User Agent (MUA): Email clients like Outlook and Gmail that allow users to compose and read emails, Mail Transfer Agent (MTA): Servers that route emails from senders to recipients (€.8.» Postfix, Sendmail) 4 Mail Submission Agent (MSA): Ensures that outgoing emai (Simple Mail Transfer Protocol) standards. é Mail Delivery Agent (MDA): Final,compopent that delivers email to the recipient's mailbox. Security Considerations (2 Marks) ‘conform to SMTP 106) | Explain Eneapsulating IP Security Payload 100) Purpose and Functionality, (2 Marks) ESP Packet Format G Marks) ESP Modes & Security Benefits (2 Marks) Describe the functional flow of DomainKeys Identified Mail (DKIM). Purpose of DKIM (I Mark) DKIM Functional Flow (3 Marks) 4 The sender's mail server signs the email header using a private key. 4 The recipient's mail server retrieves the sender's public key from DNS and verifies the signature. 4 If the signature is valid, the email is authenticated and not marked as spam. Security Benefits (1 Mark) Page 7 of 7