Password encryption

Zonaria

New Member
I have to do a school project on password encryption, but I have no idea where to start, what to do or how to demonstrate it later in a presentation.
I'm lost :eek: and pleading for someone to help me! :P
 
just to add to above a phrase or a word that's not in the dictionary is good :) also you could talk about not writing the password down anywhere, and just to make sure you don't mean data/ number encryption do you?
 
I mean, for example, to have a database with passwords that I want to encrypt to make it safer if it gets hacked. For example, if you have a website with users. To protect their passwords.

I'm struggling to explain, since I don't really know much about it :p
 
oh i see i know about when you encrypt numbers so if some hacks in they get a completely different number (useful for bank details) but that's it sorry :) if you want to know about this i can explain it
 
Cryptology is a pretty big subject in itself. What they are referring to, are secure passwords. Basically there is a cipher on both ends of a transaction and if the cipher knows how to decipher the encryption the command sent is decoded. These are all based on algorithms that turn the data being sent into basically a hash code.

It is quite a lengthy subject and I am definitely not an expert on encryption so I would suggest you start reading up on it, and a good place to start would be here

http://en.wikipedia.org/wiki/Cryptology
 
@Mark4_4: It would be very nice to learn a little about that :)

@tlarkin: Yeah, I will definitely have to read up on it.
 
Ok so basicly you have 3 numbers one that will be used too decrypt the file we will call this d. and 2 do encrypt it these will be a and q.

d is any number but is usually EXTREEEEMELY long but for now we will make it 115

a and q are both prime numbers and must be co prime. and must be common factors of d

you will then get another number that can be anything which we will call e (for this will be 5)

lets say a and q are 13 and 17 we would then times these together too make n (221)

we would then do something which you cant really show on a computer :P but ill give it a go

e*d equivalent to 1(moduloφ(n))

=> 5*d equivalent to 1(modulo192)

so basically if you want to encrypt 10 its would be 10^e(modulo(n)) = the encrypted number

so 10^5(modulo221)=108

then to decrypt it its 108^d(modulo(n)) = 10

=> 108^115(modulo221) = 10

this is basically it its been a while since I've done anything about it :) so you may want to research it a bit else where

in case you didn't know modulo is the remainder of a division so 10 modulo 3 is one and 10 modulo 7 is 3 and 10 modulo 5 is 0

and φ is eulars theorem
 
Back
Top