Network Security and Cryptography 4. RSA variant. Let us consider the following variant of the RSA public key encryption scheme, named RSA-M1 = (KG1, Enc1, Dec1). The corresponding key generation and...

I need the answer as soon as possible

Extracted text: Network Security and Cryptography 4. RSA variant. Let us consider the following variant of the RSA public key encryption scheme, named RSA-M1 = (KG1, Enc1, Dec1). The corresponding key generation and encryption algorithms are detailed next: Key generation KG|(A) Generate two distinct odd primes p and q of same bit-size X Compute N = p.q and o = (p– 1)(q – 1) Select a random integer 1 < e="">< o="" such="" that="" ged(e,="" 6)="1" -="" compute="" the="" unique="" integer="" d="" such="" that="" 1="">< ¢="" and="" e.d="1" mod="" o="" (n,="" e).="" the="" private="" key="" is="" sk="" the="" public="" key="" is="" pk="" (n,="" e,="" d)="" encryption="" enc1="" (pk,="" m)="" of="" a="" message="" m="" e="" zy="" proceeds="" as="" fol-="" lows:="" generate="" a="" random="" integer="" r="" in="" z="" -="" compute="" îm="m" ·r="" mod="" n="" -="" compute="" ci="" compute="" c2="r¯emod" n="" -="" output="" c="(c1," c2)="" -="" me="" mod="" n="" (a)="" give="" the="" corresponding="" decryption="" algorithm="" dec1="" (sk,c).="" prove="" your="" decryption="" algorithm="" is="" correct,="" i.e.="" given="" a="" legitimate="" key="" pair="" (pk,="" sk)="" +t="" kg|(a)="" it="" holds="" that="" dec1="" (sk,="" enc1(pk,="" m))="m" for="" any="" admissible="" plaintext="" m.="" (b)="" is="" the="" public="" key="" encryption="" scheme="" rsa-m1="" one-way?="" justify="" your="">