Scribd
Upload
9 views

QB Cryptography - 1

Uploaded by

raghavendravr0603
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
9 views

QB Cryptography - 1

Uploaded by

raghavendravr0603
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

BapujiEducational Association®

Bapuji Institute of Engineering and Technology, Davangere–577 004


DepartmentofElectronics & CommunicationEngineering

Course Title Cryptography Course Code 21EC642


Course Instructors Dr.Nirmala S O ,Suman B S Semester/Sec VI A & B

Question Bank
Q.No. Question
1 Find the GCD of 1160718174,316258250 using Euclidian Algorithm.
2 Construct the addition and multiplication tables under modulo 8 and write the additive and
multiplication inverse modulo 8.
3 Explain Extended Euclidian Algorithm with an example.
4 Write the properties of Modular Arithmetic for integers in Zn.
5 Explain Euclidian algorithm for determining GCD. If a=24140, b=40902 solve using Euclidian
algorithm to find GCD(a,b).
6 What are Groups? Explain in detail with respect to its properties.
7 Perform addition, subtraction, multiplication and division on the polynomials f(x)=x3+x2+2 and
g(x)=x2-x+1.
8 Find the GCD of the given polynomials a(x)=x6+x5+x4+x3+x2+x+1 and b(x)=x4+x2+x+1 using
Euclidian algorithm
9 List the axioms of groups, ring and fields.
10 Prove the following:
a. a ≡ b (mod n) implies b ≡ a (mod n)
b. a ≡ b (mod n) and b ≡ c (mod n) imply a ≡ c (mod n)
11 Prove the following:
a. [(a mod n) - (b mod n)] mod n = (a - b) mod n
b. [(a mod n) x (b mod n)] mod n = (a x b) mod n
12 Find the multiplicative inverse of each nonzero element in Z5
13 Apply Euclidean algorithm to determine
a. gcd (24140, 16762) b. gcd (4655, 12075).
14 Apply the extended Euclidean algorithm, find the multiplicative inverse of
a. 1234 mod 4321 b. 24140 mod 40902 c. 550 mod 1769 d. 5994 mod 20736
15 Develop modular addition, modular multiplication and the table of inverses for GF(5).
16 For polynomial arithmetic with coefficients in Z10, perform the following calculations.
a. (7x + 2) - (x2 + 5) b. (6x2 + x + 3)  (5x2 + 2)
17 Determine the gcd of the following pairs of polynomials.
a. x3 + x + 1 and x2 + x + 1 over GF(2)
b. x3 - x + 1 and x2 + 1 over GF(3)
c. x5 + x4 + x3 - x2 - x + 1 and x3 + x2 + x + 1 over GF(3)
d. x5 + 88x4 + 73x3 + 83x2 + 51x + 67 and x3 + 97x2 + 40x + 38 over GF(101)
18 Develop multiplication table for GF(23) with m(x) = x3+ x + 1.

19 Determine the multiplicative inverse of x3 + x + 1 in GF(24) with m(x) = x4 + x + 1 using


Extended Euclidean algorithm.
20 Apply Extended Euclidean algorithm to determine the multiplicative inverse of (x7 + x + 1)
mod (x8+ x4+x3+x+1).
21 Explain the key objectives of computer security.
22 Explain the challenges of computer security.
23 With neat diagram explain the model for network security
24 Explain the security requirements Triad

You might also like