Need help with python thanks!

Finish implementing the code in practiceRSA.py and make sure you can encrypt and decrypt data. Encrypt a

message with both your pubic and private keys. Code for encrypting with a public key is given, do not forget to

provide code for private encryption. Include a screen shot of the output in your write up$.$

Part $2$:

Given my public key$($n$,$e$),$ decrypt the cipher text C $($represented as an integer$)$ created with my public key :

C $=395234002718058511371243487230167549851$

public key $=(902125837174791721758566383713256340347,65537)$

Make a separate python file to calculate your solution to part $2.$ Explain what you did and how you cracked the public key

python code

cip#$!/$usr$/$bin$/$python$3$

from prime import $*$

import math

def main$()$:

public,private $=$ make$\_$key$($int$($sys$.$argv$[1]))$

#public key $=($n$,$e$)$

print$($f$"$public key is $(\{$public$[0]\},\{$public$[1]\})")$

#private key $=($n$,$d$)$

print$($f$"$private key is $(\{$private$[0]\},\{$private$[1]\})")$

#message to encrypt

msg $=$ b'test,message'

print $($msg$)$

print$($int$.$from$\_$bytes$($msg$))$

#cipher with public key

x $=$ cipher$($msg$,$public$[1],$public$[0])$

print$($x$)$

#decipher with private key

y $=$ dcipher$($x$,$ private$[1],$ private$[0])$

print$($y$.$to$\_$bytes$($len$($msg$)))$

def cipher$($m$,$e$,$n$)$:

i $=$ int.from$\_$bytes$($m$)$

return pow$($i$,$e$,$n$)$

def dcipher$($c$,$d$,$n$)$:

#FINISH THIS FUNCTION

$"""$

FINISH THIS FUNCTION

You'll need a function from prime.py

$"""$

def make$\_$key$($bit$\_$len$)$:

#pick two prime numbers using bit$\_$len

p$1=$

p$2=$

#compute n to be part of public key

n $=$

#l $=$ lcm$($prime$1-1,$prime$2-1)$

l $=$

#choose number $2$