Question on the math behind Asymmetric Encryption

JockVSJockJockVSJock Member Posts: 1,118
So I'm studying Cryptology with Eric Conrad's book and I'm trying to understand that math behind Asymmetric Encryption. The subject areas are factoring prime numbers and also discrete logarithm, alot of theory and I just don't see how it applies right now.

Eric does a pretty good job on explaining stuff, however I'm was wondering if someone could break it down even further.
***Freedom of Speech, Just Watch What You Say*** Example, Beware of CompTIA Certs (Deleted From Google Cached)

"Its easier to deceive the masses then to convince the masses that they have been deceived."


Sign In or Register to comment.