July 2011 Master of Computer Application (MCA) Semester 1 MC0063 Discrete Mathematics 4 Credits (Book ID: B0676 and

and B0677) Assignment Set 1 (60 Marks)

Answer all Questions Each question carries TEN marks 6 10 = 6

Q.1)

Answer the following:

1. If U = {a, b, c, d , e}, A = {a, c, d }, B = {d , e}, C = {b, c, e} then evaluate the following a) (AB) (BC) b) (BC) A c) (BA) C d) A (BC) e) (AB) (BC) 10 marks

Q.2)

Obtain the Euler - function, (n), the number of integers x such that 1 x < n and relatively prime to n.

Answer: 2)

Q.3)

Write short notes on a. Public key Cryptography b. The R.S.A Cryptosystem

Page 1 of 5

Roll No. 521126647

July 2011 Master of Computer Application (MCA) Semester 1 MC0063 Discrete Mathematics 4 Credits (Book ID: B0676 and B0677) Assignment Set 1 (60 Marks)
Answer: 3) (a) Public key Cryptography Public-key cryptography refers to a widely used set of methods for transforming a written message into a form that can be read only by the intended recipient. This cryptographic approach involves the use of asymmetric key algorithms that is, the non-message information (the public key) needed to transform the message to a secure form is different from the information needed to reverse the process (the private key). The person who anticipates receiving messages first creates both a public key and an associated private key, and publishes the public key. When someone wants to send a secure message to the creator of these keys, the sender encrypts it (transforms it to secure form) using the intended recipient's public key; to decrypt the message, the recipient uses the private key. Public key cryptography is a fundamental and widely used technology around the world. It is the approach which is employed by many cryptographic algorithms and cryptosystems. It underpins such Internet standards as Transport Layer Security (TLS) (successor to SSL), PGP, and GPG. (b) The R.S.A Cryptosystem In cryptography, RSA (which stands for Rivest, Shamir and Adleman who first publicly described it) is an algorithm for public-key cryptography. It is the first algorithm known to be suitable for signing as well as encryption, and was one of the first great advances in public key cryptography. RSA is widely used in electronic commerce protocols, and is believed to be sufficiently secure given sufficiently long keys and the use of up-todate implementations. Key generation RSA involves a public key and a private key. The public key can be known to everyone and is used for encrypting messages. Messages encrypted with the public key can only be decrypted using the private key. The keys for the RSA algorithm are generated the following way: 1. Choose two distinct prime numbers p and q. o For security purposes, the integers p and q should be chosen at random, and should be of similar bit-length. Prime integers can be efficiently found using a primarily test. 2. Compute n = pq. o n is used as the modulus for both the public and private keys

3. Compute (n) = (p1)(q1), where is Euler's totient function. 4. Choose an integer e such that 1 <e<(n) and gcd(e,(n)) = 1, i.e. e and (n) are coprime.
e is released as the public key exponent. e having a short bit-length and small Hamming weight results in more efficient encryption most commonly 0x10001 = 65537. However, small values of e (such as 3) have been shown to be less secure in some settings.[4] 5. Determine d = e1 mod (n); i.e. d is the multiplicative inverse of e mod (n). o This is often computed using the extended Euclidean algorithm. o d is kept as the private key exponent. The public key consists of the modulus n and the public (or encryption) exponent e. The private key consists of the private (or decryption) exponent d which must be kept secret. o o Q.4) Prove the given theorem as below: If S1 = { x1, x2, .. xn} and S2 = {y1, y2, .yn} are any two finite sets with n elements, then the lattices (P(S1), ) and (P(S2), ) are isomorphic. Consequently the Hasse diagrams of these lattices may be drawn identically. Ans: Arrange the sets as known in Fig. 1, so that each element of S1 is directly over the correspondingly numbered element in S2

Page 2 of 5

Roll No. 521126647

July 2011 Master of Computer Application (MCA) Semester 1 MC0063 Discrete Mathematics 4 Credits (Book ID: B0676 and B0677) Assignment Set 1 (60 Marks)

Let A be a subset of S1 Define f (A) = subset of S2 consisting of all elements that correspond to the

It can be easily seen that f is one one and onto. f (A) f (B) for all A, B P(S1). Therefore the lattices (P(S1), ) and (P(S2), ) are isomorphic. Q.5) (a)

Also

if

and

only

if

Evaluate the following fuzzy logic formulas where a = 0.5 and b = 0.7. (2/ 7.4.18)

a = 0.5

(b) a b (c) a b (d) a b Answer: (a)

a = 0.5 a = 1 a

= 1 0.5 = 0.5 (b) ab ab = min {0.5,0.7} = 0.5 (c) ab ab = max{0.5,0.7} = 0.7 (d) a b a b = min{1,1-0.5+0.7} =1 6. Verify whether or not, the following graphs are planar?

(i) o

o o

(ii) f o

a o

b o o c

o o Page 3 of 5

o e

o d
Roll No. 521126647

July 2011 Master of Computer Application (MCA) Semester 1 MC0063 Discrete Mathematics 4 Credits (Book ID: B0676 and B0677) Assignment Set 1 (60 Marks)
Ans: (I ) Observe the Kuratowskis 2nd graph K3,3.

Fig1.A
It i is clear that the

Fig 1.B
graph contains six vertices vi, 1

6 and there are edges , , , , , . Now we have a Jordan curve. So plane of the paper is divided into two regions, one inside and the other outside. Since v1 is connected to v4, we can add the edge in either inside or outside (without intersecting the edges already drawn). Let us draw inside. (If we choose outside, then we end up with the same argument Now we have the Fig. 1 (A) Next we have to draw an edge cross over the edge from v3 to v6. If and also another edge . First we draw . If we draw it inside, we get a

. So we draw it outside. Then we get the Fig. 1 (B). Still we have to draw an edge drawn inside, it cross the edge (see the Fig. 1 (C) ).

Fig 1 C Fig 1 D
So we cannot draw it inside. So we select the case of drawing Thus graph. (II) cross the edge (see the Fig. 1(D)).

cannot be drawn either inside or outside with out a cross over. Hence the given graph is not a planar

Page 4 of 5

Roll No. 521126647

July 2011 Master of Computer Application (MCA) Semester 1 MC0063 Discrete Mathematics 4 Credits (Book ID: B0676 and B0677) Assignment Set 1 (60 Marks)

i) From the construction of the dual G* of G, it is clear that there is a one-to-one correspondence between the set of all edges of G and the set of all edges of G*. Also one edge of G* intersects one edge of G. ii) An edge forming a self-loop in G yields a pendent edge in G* and a pendent edge in G yields a self-loop in G*. iii) Edges that are in series in G produce parallel edges in G*. [If e1, e2 are in series in G, then , are parallel in G*]. iv) Parallel edges in G produce edges in series in G*. v)It is a general observation that the number of edges constituting the boundary of a region Fi in G is equal to the degree of the corresponding vertex pi in G*, and vice versa. vi) The graph G* is embedded in the plane, and so G* is also a planar graph. vii) Consider the process of drawing a dual G* from G. It can be observed that G is a dual G*. Therefore instead of calling G*, a dual of G, we can usually say that G and G* are dual graphs. So, Given Graph is Planar Graph

Page 5 of 5

Roll No. 521126647