public key techniques

Question 1

WHY RSA is secure ?

Answer 1

because it’s computationally impossible prime factor factorization of N

Question 2

cycling attach

Answer 2

to keep encrypting the message over and over till the same vale is obtained

Question 3

why k should be randomly drawn at each iteration

Answer 3

because if we do s1 - s2 we get the value of a

s1 −s2 ≡ k^−1(h1 −ar) −k^−1(h2 −ar) ≡ k−1(h1 −h2) (mod p−1)

Question 4

why DLp considtions are necessary

Answer 4

because it would allow solving the big giant step faster

Question 5

why when running Chaum everste graph on multiple rounds will become safer

Answer 5

because in the first round it has a chance of 1/ 2 to get the private key, in the second round it has 1/3 to get the private key ….etc

Question 6

why when running Chaum everste graph on multiple rounds will become safer

Answer 6

because in the first round it has a chance of 1/ 2 to get cheat, in the second round it has 1/3 to cheat ….etc

Question 7

what is the complexity of the first step in the parallel

bitonic sort

Answer 7

we have a single compare a swap

Question 8

why we can use projective coordinates

Answer 8

when use them we can actually cancel out inversion