Paper 4, Section I, G

Coding and Cryptography
Part II, 2016

Describe the Rabin-Williams scheme for coding a message xx as x2x^{2} modulo a certain NN. Show that, if NN is chosen appropriately, breaking this code is equivalent to factorising the product of two primes.