PowerBASIC Forums
  Programming
  Public key cryptography (Page 2)

Post New Topic  Post A Reply
profile | register | preferences | faq | search

UBBFriend: Email This Page to Someone!
This topic is 2 pages long:   1  2 
next newest topic | next oldest topic
Author Topic:   Public key cryptography
Tom Hanlin
Member
posted August 03, 2001 08:36 AM     Click Here to See the Profile for Tom Hanlin     Edit/Delete Message   Reply w/Quote
Wayne, it is true that crackers can't read encrypted code, but nor can the
computer run it. The code has to be decrypted before it will run, at which
point the cracker can read it too.

Rodney, the encryption approach you describe is not secure. As you note, a
"random number generator" (more accurately, pseudo-random number generator)
does not generate genuinely random number sequences.

------------------
Tom Hanlin
PowerBASIC Staff

IP: Logged

Tim Wisseman
unregistered
posted August 03, 2001 10:35 AM           Edit/Delete Message   Reply w/Quote
What I posted truely is public key encryption, however it is
very easy to break and was just an example of how it is done.
It was for learning purposes only and not something that could
be used for real world work.

Like my sample code, if you have a public key and the algoritms
you can find the private key give enough time. It might take a
nano second or 500 billion years, depending on the complexity
of the system.

The goal is to make the mathamatical path from the public key
to the private key as hard as possible. That is the power of the
RSA encryption methods.

Tim

------------------

IP: Logged


This topic is 2 pages long:   1  2 

All times are EasternTime (US)

next newest topic | next oldest topic

Administrative Options: Close Topic | Archive/Move | Delete Topic
Post New Topic  Post A Reply
Hop to:

Contact Us | PowerBASIC BASIC Compilers

Copyright © 1999-2005 PowerBASIC, Inc. All Rights Reserved.


Ultimate Bulletin Board 5.45c