Results for "Author: fredrik qvarfort"

Yesterday, I was lookin' for some code to compute a CRC32 checksum value but could not find any fast working code here. So I made this class file that allows you to calculate real CRC32 checksums. I also needed *FAST* code so this uses assembler code that you can use without actually knowing any assembler. This code is able to compute 56 MB/s on a P3 600Mhz!!

This is a Compression/Decompression routine using Huffman Encoding/Decoding, and works best on normal text files. The code is *highly* optimized, and to show how fast this is I can mention another code sample found here on planetsourcecode (from August 1st 2000) which also uses Huffman Encoding. That code took 127 seconds to compress a 1.8mb textfile, but with my code this takes less than 1 second!! (that's an approvement of 12700%!!). That other code was worth 7 excellent points, how many is this worth? ;)

This is a collection of SECURE encryption algorithms (BLOWFISH, TWOFISH, SKIPJACK, TEA, GOST, RC4 and DES). This post contains highly optimized code, if a similar post already exist here on PSC this one is at least a couple of 1000x faster!! This is not like everybody else's "unbreakable" code, these are standardized encryption algorithms where the only possible way to crack it is by brute-force. DES is probably the least secure one (it took 22 hours for a supercomputer + 100,000 computers to crack it (distributed.net)). And that's the least secure one. ;)

Yesterday, I was lookin' for some code to compute a CRC32 checksum value but could not find any fast working code here. So I made this class file that allows you to calculate real CRC32 checksums. I also needed *FAST* code so this uses assembler code that you can use without actually knowing any assembler. This code is able to compute 56 MB/s on a P3 600Mhz!!

This is a Compression/Decompression routine using Huffman Encoding/Decoding, and works best on normal text files. The code is *highly* optimized, and to show how fast this is I can mention another code sample found here on planetsourcecode (from August 1st 2000) which also uses Huffman Encoding. That code took 127 seconds to compress a 1.8mb textfile, but with my code this takes less than 1 second!! (that's an approvement of 12700%!!). That other code was worth 7 excellent points, how many is this worth? ;)

This is a collection of SECURE encryption algorithms (BLOWFISH, TWOFISH, SKIPJACK, TEA, GOST, RC4 and DES). This post contains highly optimized code, if a similar post already exist here on PSC this one is at least a couple of 1000x faster!! This is not like everybody else's "unbreakable" code, these are standardized encryption algorithms where the only possible way to crack it is by brute-force. DES is probably the least secure one (it took 22 hours for a supercomputer + 100,000 computers to crack it (distributed.net)). And that's the least secure one. ;)

Yesterday, I was lookin' for some code to compute a CRC32 checksum value but could not find any fast working code here. So I made this class file that allows you to calculate real CRC32 checksums. I also needed *FAST* code so this uses assembler code that you can use without actually knowing any assembler. This code is able to compute 56 MB/s on a P3 600Mhz!!

This is a Compression/Decompression routine using Huffman Encoding/Decoding, and works best on normal text files. The code is *highly* optimized, and to show how fast this is I can mention another code sample found here on planetsourcecode (from August 1st 2000) which also uses Huffman Encoding. That code took 127 seconds to compress a 1.8mb textfile, but with my code this takes less than 1 second!! (that's an approvement of 12700%!!). That other code was worth 7 excellent points, how many is this worth? ;)

This is a collection of SECURE encryption algorithms (BLOWFISH, TWOFISH, SKIPJACK, TEA, GOST, RC4 and DES). This post contains highly optimized code, if a similar post already exist here on PSC this one is at least a couple of 1000x faster!! This is not like everybody else's "unbreakable" code, these are standardized encryption algorithms where the only possible way to crack it is by brute-force. DES is probably the least secure one (it took 22 hours for a supercomputer + 100,000 computers to crack it (distributed.net)). And that's the least secure one. ;)

This is a Compression/Decompression routine using Huffman Encoding/Decoding, and works best on normal text files. The code is *highly* optimized, and to show how fast this is I can mention another code sample found here on planetsourcecode (from August 1st 2000) which also uses Huffman Encoding. That code took 127 seconds to compress a 1.8mb textfile, but with my code this takes less than 1 second!! (that's an approvement of 12700%!!). That other code was worth 7 excellent points, how many is this worth? ;)

This is a collection of SECURE encryption algorithms (BLOWFISH, TWOFISH, SKIPJACK, TEA, GOST, RC4 and DES). This post contains highly optimized code, if a similar post already exist here on PSC this one is at least a couple of 1000x faster!! This is not like everybody else's "unbreakable" code, these are standardized encryption algorithms where the only possible way to crack it is by brute-force. DES is probably the least secure one (it took 22 hours for a supercomputer + 100,000 computers to crack it (distributed.net)). And that's the least secure one. ;)

Yesterday, I was lookin' for some code to compute a CRC32 checksum value but could not find any fast working code here. So I made this class file that allows you to calculate real CRC32 checksums. I also needed *FAST* code so this uses assembler code that you can use without actually knowing any assembler. This code is able to compute 56 MB/s on a P3 600Mhz!!

Yesterday, I was lookin' for some code to compute a CRC32 checksum value but could not find any fast working code here. So I made this class file that allows you to calculate real CRC32 checksums. I also needed *FAST* code so this uses assembler code that you can use without actually knowing any assembler. This code is able to compute 56 MB/s on a P3 600Mhz!!

This is a collection of SECURE encryption algorithms (BLOWFISH, TWOFISH, SKIPJACK, TEA, GOST, RC4 and DES). This post contains highly optimized code, if a similar post already exist here on PSC this one is at least a couple of 1000x faster!! This is not like everybody else's "unbreakable" code, these are standardized encryption algorithms where the only possible way to crack it is by brute-force. DES is probably the least secure one (it took 22 hours for a supercomputer + 100,000 computers to crack it (distributed.net)). And that's the least secure one. ;)

This is a Compression/Decompression routine using Huffman Encoding/Decoding, and works best on normal text files. The code is *highly* optimized, and to show how fast this is I can mention another code sample found here on planetsourcecode (from August 1st 2000) which also uses Huffman Encoding. That code took 127 seconds to compress a 1.8mb textfile, but with my code this takes less than 1 second!! (that's an approvement of 12700%!!). That other code was worth 7 excellent points, how many is this worth? ;)

This is a Compression/Decompression routine using Huffman Encoding/Decoding, and works best on normal text files. The code is *highly* optimized, and to show how fast this is I can mention another code sample found here on planetsourcecode (from August 1st 2000) which also uses Huffman Encoding. That code took 127 seconds to compress a 1.8mb textfile, but with my code this takes less than 1 second!! (that's an approvement of 12700%!!). That other code was worth 7 excellent points, how many is this worth? ;)

This is a collection of SECURE encryption algorithms (BLOWFISH, TWOFISH, SKIPJACK, TEA, GOST, RC4 and DES). This post contains highly optimized code, if a similar post already exist here on PSC this one is at least a couple of 1000x faster!! This is not like everybody else's "unbreakable" code, these are standardized encryption algorithms where the only possible way to crack it is by brute-force. DES is probably the least secure one (it took 22 hours for a supercomputer + 100,000 computers to crack it (distributed.net)). And that's the least secure one. ;)

Yesterday, I was lookin' for some code to compute a CRC32 checksum value but could not find any fast working code here. So I made this class file that allows you to calculate real CRC32 checksums. I also needed *FAST* code so this uses assembler code that you can use without actually knowing any assembler. This code is able to compute 56 MB/s on a P3 600Mhz!!

This is a Compression/Decompression routine using Huffman Encoding/Decoding, and works best on normal text files. The code is *highly* optimized, and to show how fast this is I can mention another code sample found here on planetsourcecode (from August 1st 2000) which also uses Huffman Encoding. That code took 127 seconds to compress a 1.8mb textfile, but with my code this takes less than 1 second!! (that's an approvement of 12700%!!). That other code was worth 7 excellent points, how many is this worth? ;)

This is a collection of SECURE encryption algorithms (BLOWFISH, TWOFISH, SKIPJACK, TEA, GOST, RC4 and DES). This post contains highly optimized code, if a similar post already exist here on PSC this one is at least a couple of 1000x faster!! This is not like everybody else's "unbreakable" code, these are standardized encryption algorithms where the only possible way to crack it is by brute-force. DES is probably the least secure one (it took 22 hours for a supercomputer + 100,000 computers to crack it (distributed.net)). And that's the least secure one. ;)