ECHARTERS Message Board

STOCKTALK

We've detected that you're using an ad content blocking browser plug-in or feature. Ads provide a critical source of revenue to the continued operation of Silicon Investor. We ask that you disable ad blocking while on Silicon Investor in the best interests of our community. If you are not using an ad blocker but are still receiving this message, make sure your browser's tracking protection is set to the 'standard' level.

Gold/Mining/Energy : ECHARTERS

Public Reply Prvt Reply Mark as Last Read File

Previous 10 Next 10 Previous Next

To: CLK who wrote (2866)	8/17/1998 12:22:00 PM
From: E. Charters	Read Replies (1) of 3744

I do not know if anyone has a good implementation of true assymetric rivest shamir adelmann coding where the message itself is sent in packets that are calculated by the key power inverse algorithm in 1024 bit code.. First public test of RSA was in the globe and Mail in Toronto in about 1970 something.. a public key was printed and invitations for message passing were made. I can't even get that many people to use PGP as it is a bit complex to set up under windows and it seems nobody either trusts it or wants to bother using it.. public keys in it do not abound.. I think I got about 4 people to send messages under PGP. I sent the instructions on how to set it up to one guy and he completely dropped it immediately! A windows program that generated true RSA messages might be interesting. I could write in VB. PGP is nice but it is only 56 bit code! It triple encodes with DES code. The key itself is 1024 bit or 2048 bit RSA. You send the key with the message and PGP decodes the key and the uses it on the message.. For ultimate security, as I am sure IBM furnished the gov't with a backdoor to even DES, I would like to encode true 1024 bit code.. so that no one could ever decode it except the recipient... The algorithm is simple.. it takes building an unlimited precision calculator in perhaps 386 machine language.. or C. or it would run too slow. 2^1024 bits is 1.8 X 10^308th! Can you imagine a big number to the 1024th bits? I did one like that in University once in pascal. That is the pain. If you ask the CPU to calculate those kind of powers it will barf quick. A UP calculator in basic I think would be too slow.. even MS's VB with math routine. I could try it in BCD arithmetic.. it might work.. It might take 20 minutes to decode a message! I think if it were in window a lot of people would use it as it would be very secure and easy to use.. EC<:-}

Report TOU Violation

Share This Post

Public Reply Prvt Reply Mark as Last Read File

Previous 10 Next 10 Previous Next