RSA Algorithm Implemented in Python

preview_player
Показать описание
Рекомендации по теме
Комментарии
Автор

If we use a simpler code to check the prime number, it might improve efficiency

ziko
Автор

The code works for me but you have to cast the value of y = eq / x into integer otherwise you would get incomprehensible series of float

adrianovr
Автор

def is_prime(n):
I wolud add at least checking if int(round( sqr ))**2 is 'n' because if is then it is not prime.

marcinziajkowski
Автор

Woko Fouaneu grand génie thank u for all😭💕👌🏽

lhappypotter
Автор

hi, nice video.
i have a question to ask though.
i am trying to solve this on paper first :
lets say
P=2 and Q= 3
xy = (P-1)(Q-1)+1
xy= (1)(2)+1
xy= 3
now how to determine fixed value of x and y?

awaisahmadsiddiqi
Автор

sir how can we encrypt an image using this code

vodnalasrinivas
Автор

why is it giving me different answer than yours even with the same input
and also the logic of while statement is wrong

shagunsingh
Автор

Sir, can i encrypt any types of format using this code??

tamilnwords
Автор

Hi, i get as result not integer y, how can I fix it?

qklwcmk
Автор

I am not gonna sub, cuz he has 69 subs xDD

lionel