TryThis0ne >> Challenges >> Cryptography
rsa - finding out d
Viewers: :
Quick reply
Reply
New Topic
 
ouchmeow




AVATAR



Registerd on: 01/01/1970, 04:00:00
Location::
Posts: 15




Send Email Top
Sent on: 08/12/2006, 19:19:28 Reply | Quote | Warn | Edit
can someone tell me the process to get d?
i googled alot and i just don't understand what i need to do exactly to get d
please give me a very basic math process to do to get d

i got n,e,p,q
i don't understand the all d.e = 1 (mod (p-1)*(q-1))

thanks

**update**

i passed this level but i passed it using an app that gave me the value of d
i still want to know how to calculate d if anybody knows
thanks again

Edit by : ouchmeow At 08/12/2006, 19:54:54

Hertz




AVATAR



Registerd on: 01/01/1970, 04:00:00
Location::
Posts: 116




User MSNTop
Sent on: 17/07/2008, 20:29:06 Reply | Quote | Warn | Edit
I'm with him.How could i get the D ?It is all i need !!Please help!

cp77fk4r
Global Admin



AVATAR



Registerd on: 01/01/1970, 04:00:00
Location::
Posts: 621




Send Email Top
Sent on: 17/07/2008, 22:44:25 Reply | Quote | Warn | Edit
As you said:

you calculating the n' by:
n'=(p-1)*(q-1)

and than you calculating the d by:
d=1(mod n')


CIO:
http://he.wikipedia.org/wiki/RSA
http://en.wikipedia.org/wiki/RSA

Hertz




AVATAR



Registerd on: 01/01/1970, 04:00:00
Location::
Posts: 116




User MSNTop
Sent on: 07/08/2008, 22:29:02 Reply | Quote | Warn | Edit
cp77fk4r:
As you said:

you calculating the n' by:
n'=(p-1)*(q-1)

and than you calculating the d by:
d=1(mod n')





I'm not at this level on maths...

So the N(851)=P * Q
N*=(p-1)*(q-1)
E=5
D=mod N* = mod (p-1)*(q-1)

But what means mod N* ? MODUL? |N*| ? or what?
The public key is N=851 and E=5,and the private is N=851 and D=***

Edit by : Hertz At 07/08/2008, 21:30:35

nefarious




AVATAR



Registerd on: 01/01/1970, 04:00:00
Location::
Posts: 16




Top
Sent on: 14/01/2010, 12:35:28 Reply | Quote | Warn | Edit
It helps to understand modulus arithmetic (sometimes called clock face arithmetic) and how it works. Then you can easily convert the modulus expression d = 1 (mod n') to a non-mod equation. From there, it is simple to write a script that will return possible values for d. Try them all until you decrypted something that makes sense (it doesnt take long!) nefarious

All the times are GMT+2, ISRAEL
TryThis0ne >> Challenges >> Cryptography

Quick reply
Reply
New Topic


Page generated using: 12 queries
Design by SBD © GeHeNoM.Net | Powered By Tera-Byte Forums 1.5 © JonJon & HLL
ý