...
Printable View
...
I'm pretty sure that most of the current data encryption algorithms are held quite secretive, and the older ones are busted. https://www.sharkyforums.com/images/.../2005/08/2.gifQuote:
Originally posted by The Evil Tin Tin:
Does anyone have any links on how to build a data encryption algorithm??? Any help would be much appreciated! I am currentley attempting to build one, and struggling to find resources or module librarys.
Cheers
Tin Tin
I have no idea of where to start looking. Have you done a search through Google yet?
------------------
Dragon of the OC Crusaders
The race is not always to the swift, nor the battle to the strong, but that's the way to bet.
-- Damon Runyon
...
Maybe you could take a look at some OpenSSH stuff.
This is just off the top of my head but, you could come up with an ordered list of distinct prime numbers the same length of as your message for a key then assign a number to each letter / char that would be in a message. Then calculate p1 ^ x1 * p2 ^x2 * ... where pi is the ith prime in your key (the list) and xi is the code number assigned to the ith character in the message.
Decryption would then be simple with the key since prime factorizations are unique. At the same time it is an NP-complete problem to attempt this without the key.
This particular method probably isnt very practical for reasonable length messages since you would require a looong list of primes to ensure that you could encrypt it. But, from what I understand about crypto this is how most algorithms generally work -- relying on prime factorization.
EDIT -- Not to mention the fact that the encrypted message grows faster than O(N!)
[This message has been edited by rollingrock (edited November 09, 2001).]
EDIT -- lol nevermind I just reread your message I thought you were asking how they worked Try www.gnupg.org -- the source might give you some ideas.
[This message has been edited by rollingrock (edited November 09, 2001).]
...
IT'S ALIVE! IT'S ALIVEEEE!!!
You'd better watch out man, once the NSA finds out that you implemented it there's trouble to be had. It'll be just like Sneakers except without Robert Redford and a universal decryption algorithm. All I need to do now is come up with an algorithm to factor numbers in linear time and we're set for some wacky adventures involving answering machines and temperature sensitive security systems (not to mention a cameo by James Earl Jones). But, I digress.
You might want to try talking to some of the people involved with GnuPG, I'm sure they could help you out. It's all open source too, so it could give you some ideas.
I'm happy that the "algorithm" works though :-)
...
This is a very simple XORing algorithm, and is easily broken. Let's take the string "encrypt this" and the key "abcd". First, repeat "abcd" to strlen("encrypt this"). We've now got "abcdabcdabcd". Then, loop from 0 to strlen("encrypt this")-1. Each char, the result is string[i] ^ keylong[i];. The ^ operator is XOR, not power. That's basically it. To decrypt, do the same process, but with the result rather than "encrypt this", and you will get the original string.
------------------
Specs:
Computer 1
------------
PII 450mHz
128 MB SDRAM
14.4 and 75.5 GB 7200 RPM Hard Drives
Riva TNT w/ 16 MB Video RAM
Windows 98/Slackware 8.0
Computer 2
------------
PI 200mHz
32 MB SDRAM
3 GB 2400 RPM Hard Drive
Matrox Something or Other
Slackware 8.0, kernel 2.4.5
...
Have a look at this page. They have several candidates to choose from.
...
Thanks Gomez,
I am working on a similar project.
------------------
"Sometimes it is entirely appropriate to kill a fly with a sledge-hammer!"
-MAJ. HOLDREDGE USMC
Why Yes! I am a proud member of the SF Linux Hippy Club.
here is a good one I found:
http://www.counterpane.com/hotlist.html
------------------
"Sometimes it is entirely appropriate to kill a fly with a sledge-hammer!"
-MAJ. HOLDREDGE USMC
Why Yes! I am a proud member of the SF Linux Hippy Club.
...