adplus-dvertising
frame-decoration

Question

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

a.

(12,4)

b.

(10,7)

c.

(11,11)

d.

(11,12)

Answer: (c).(11,11)

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

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

Similar Questions

Discover Related MCQs

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?

Q. In SHA-512, the message is divided into blocks of size ___ bits for the hash computation.

Q. What is the maximum length of the message (in bits) that can be taken by SHA-512?

Q. The message in SHA-512 is padded so that it’s length is

Q. The big-endian format is one in which

Q. In SHA-512, the registers ‘a’ to ‘h’ are obtained by taking the first 64 bits of the fractional parts of the cube roots of the first 8 prime numbers.

Q. What is the size of W (in bits) in the SHA-512 processing of a single 1024- bit block?