c - RSA Algorithm - known n how to get p & q -


i have got public key (e,n) encrypted data , have plane text via rsa , in c! first of wont know how find out p , q are? know have prime numbers , p<>q!

help please!

ciao

first, factor n. not hard; since sqrt(3233) 56.8…, need test prime numbers that. give p , q. use calculate (p-1)•(q-1).

then find multiplicative inverse of 17 modulo (p-1)•(q-1) using extended eudlidean algorithm. not need c code that; did hand. (the algorithm gives negative result. can either use d or add (p-1)•(q-1) give positive value works well.)


Comments

Popular posts from this blog

c# - DetailsView in ASP.Net - How to add another column on the side/add a control in each row? -

javascript - firefox memory leak -

Trying to import CSV file to a SQL Server database using asp.net and c# - can't find what I'm missing -