Search Results for "git:/git.code.sf.net/p/docfetcher/code"

This is a modified version of the CRC algorithms by Lammert Bies. It supports more algorithms and has been ported to several languages. It's also useful for learning how to do hexadecimal calculations and bitwise operations in various programming languages. Disclaimer: These test programs demonstrate the calculation of CRC. I made these translation with a basic knowledge of each language. They may or may not be appropriately formatted / secured / robustified / idiot proofed or...

...The code current compiles with Highspeed Pascal (Atari ST) or FreePascal. I hope to have it compiling for the Amiga (also using Highspeed Pascal), and supporting a built in p-code compiler/interpreter for cross platform development.

...It visualizes the function of Memory, Arithmetic Logic Unit and Control Unit. Machine Programs can be created and edited using a comfortable GUI and run on the virtual machine step by step. Micro Code, too, is editable: Instructions can be added and modified using the GUI.

...It exhibits uniform distribution, mixes rapidly (with worst-case avalanche better than 16-bits), has no detected bias, and comes in three variants: BEDBUG128, with an internal state array of 128+3 32-bit words; BEDBUG256, with an internal state of 256+3 words; and BEDBUG512 with a 512+3-word state. The former permit seeding with a key of up to 4096 or 8192 bits, the latter with a 16384-bit key. The BEDBUG generator itself is a mere 5 lines of code: Three rotations; two pseudo-random lookups. The default BEDBUG configuration alternates the rotation constants unpredictably. These four sets of three values differ between BEDBUG128, BEDBUG256 and BEDBUG512 and were selected, tuned and tested in each case for optimal avalanche, which is never less than 16.5 bits. BEDBUG has passed stringent industry-standard tests for randomness, including NIST and DIEHARD.

...MOTE exhibits uniform distribution, mixes extremely rapidly, has no detected bias, and comes in three variants: MOTE8, with an internal state array of 8+4 32-bit words; MOTE16, with an internal state of 16+4 words; and MOTE32 with a 32+4-word state. The former permit seeding with a key of up to 256 or 512 bits, the latter with a 1024-bit key. Reduced to essentials, MOTE is only 5 lines of code: Ten arithmetic and bitwise operations in all. It's called MOTE because a PRNG can't be made much smaller (or faster) without introducing bias or severely reducing avalanche. MOTE alternates its shift and rotation constants unpredictably, and has passed the most stringent industry-standard tests for randomness and security, including NIST & DIEHARD.

SES brings back the uncrackable onetime pad, with a digital twist. It is well known that a random key of message-length is the only provably unbreakable cipher. SES uses cryptographic strength pseudo-random keys of message-length for its many encipherments, in addition to offering true one-time pad capability for the intrepid. SES is built on ISAAC, Bob Jenkins' unbroken CSPRNG, a fast and simple stream cipher placed in the Public Domain in 1996. SES now gives you the ability to...

ISAAC is a cryptographically secure pseudo-random number generator (CSPRNG) and stream cipher. It was developed by Bob Jenkins from 1993-1996 and placed in the Public Domain. ISAAC is fast - especially when optimised - and portable to most architectures in nearly all programming and scripting languages. After more than 20 years of existence ISAAC has not been broken, and the little program you have here allows you to use it to encrypt and decrypt text of arbitrary length, files of any...

Pascal command-line program to find area and volume of basic geometric shapes.

Personal research achievements from the authors presented here in the form of symbolic Algebra and non-numerical analysis algorithms implemented in C/C++, Java, and/or Pascal. As part of a more wide, simple, powerful and robust CAS enviroment under development, new code will be continuously added up to this repository. The authors give their welcome and encouragement to everyone interested in bring some kind of collaboration.