adplus-dvertising
frame-decoration

Question

On adding the two points P (4,2) and Q (10, 6) in the elliptic curve E11(1,1) we get

a.

(9,3)

b.

(6,4)

c.

(7,5)

d.

(2,8)

Answer: (b).(6,4)

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. On adding the two points P (4,2) and Q (10, 6) in the elliptic curve E11(1,1) we get

Similar Questions

Discover Related MCQs

Q. If P = (1,4) in the elliptic curve E13(1, 1) , then 4P is

Q. Multiply the point P=(8, 1) by a constant 3, thus find 3P, in the elliptic curve E13(1, 1)

Q. Bob selects E67(2, 3) as the elliptic curve over GF(p). He selects e1 = (2, 22) and d = 4. Then he calculates e2 = d × e1 .What is the value of e2?

Q. Bob selects E67(2, 3) as the elliptic curve over GF(p). He selects e1 = (2, 22) and d = 4. Then he calculates e2 = d × e1 and the publicly announces the tuple (E, e1, e2). Now, Alice wants to send the plaintext P = (24, 26) to Bob and she selects r = 2. What are C1 and C2?

Q. P = C1 – (d x C2)

Is this above stated formula true with respect to ECC?

Q. For the point P (11, 2) defined in the curve E13(1, 1). What is –P?

Q. For the point P (7, 0) defined in the curve E13(1, 1). What is –P?

Q. When a hash function is used to provide message authentication, the hash function value is referred to as

Q. Message authentication code is also known as

Q. The main difference in MACs and digital signatures is that, in digital signatures the hash value of the message is encrypted with a user’s public key.

Q. What is a one-way password file?

Q. Which one of the following is not an application hash functions?

Q. If the compression function is collision resistant, then so is the resultant iterated hash function.

Q. A larger hash code cannot be decomposed into independent subcodes.

Q. We define collision as: A collision occurs if we have x=y and H(x) = H(y).

Q. Consider the following properties:

Variable Input size
Fixed Output size
Efficiency
Pre image resistant
Second Pre image Resistant
Collision resistant
Pseudo randomness

A has function that satisfies the first _______ properties in the above table is referred to as a weak hash function.

Q. A function that is second pre-image resistant is also collision resistant.

Q. Which attack requires the least effort/computations?

Q. SHA-1 produces a hash value of

Q. What is the number of round computation steps in the SHA-256 algorithm?