Find the ciphertext for the message {100110101011011} using superincreasing sequence { 1, 3, 5, 11, 35 } and private keys a = 5 and m=37.
(a) C = ( 33, 47, 65 )
(b) C = ( 65, 33, 47 )
(c) C = ( 47, 33, 65 )
(d) C = ( 47, 65, 33 )
This question was posed to me in an interview for job.
My doubt stems from Knapsack/ Merkle topic in section Public Key Cryptography and RSA of Cryptograph & Network Security