Easy to use, fast and flexible components
implementing most popular algorithms to encrypt/decrypt data and calculate
digests. Package includes random and prime numbers generators up to 4096
bit. All cryptography components can generate keys, load and save them to
file. All but RSA support ECB. CBC, CFB and OFB modes, ciphering in-place
or into internal buffers.http://delphi.icm.edu.pl/ftp/d50share/ASCryptoKit5.zip

Block Ciphers

A block cipher class hierarchy. Currently includes TDESCipher and
TBlowfishCipher, with more to come soon. The ciphers all form a hierarchy, descending from
TBlockCipher, allowing for polymorphic instantiation of any cipher you choose. The DES
implementation has been heavily optimized with a lot of help from Bob Lee. It encrypts 4.2
megs/sec on my Pentium II. Blowfish has been similarly optimized, encrypting 6.5 megs/sec.
www.csd.net/~daves/delphi/BlockCiphers.zip

DataEncryptionStandard.pas, which contains TDESCipher, an implementation
of the 56-bit Data Encryption Standard block cipher. Also includes an example project.
Optimized with much help from Bob Lee. Encrypts 4.2 megabytes/sec on a P2.
www.csd.net/~daves/delphi

A collection of classes for creating message digests, including MD2, MD4,
MD5, SHA-1, and RIPEMD-160. Also includes a class for making secure hashes (HMACs) out of
these digests. The hierarchy works out real neat, so they all have a consistent
interfaces, and a cute little virtual constructor mechanism for creating the HMACs
class.www.csd.net/~daves/delphi/MessageDigests.zip

Delphi implementation of the popular and fast 'Blowfish' algorithm.
Blowfish is royalty free and does not have any known weaknesses, and can support a
key length of up to 448 bits. Delphi Super Page: http://delphi.icm.edu.pl/ftp/d20free/blownreg.zip

Marcel
Martin's HIT (Huge Integer Tools) is a high-performance
set of multi-precision arithmetic tools for Delphi 4 and above. With
HIT, you can efficiently and easily program algorithms that require very
big integers (or polynomials over GF(2)). HIT was designed to be as fast
as possible. The speed is achieved by using fast algorithms and by using
optimized assembly code for basic operations

HIT (Huge Integer Tools) is a set of
multi-precision arithmetic tools.
With HIT you can efficiently implement algorithms that require very big integers or
polynomials over GF(2): Primality Testing, Factorization, Public Key Cryptography, etc.
(ver. 1.02, HIT is FREE for personal, educational, or any non-commercial use)www.znz.freesurf.fr