by Nikolai V. Shokhirev
All major encryption algorithms are implemented in many programming languages, including Pascal (Delphi, Kylix).
This page is devoted to TEA - Tiny Encryption Algorithm.
This is relatively new, sufficiently strong and very compact and fast block cipher algorithm with a 128-bit key. It is not patented.
Initially TEA was developed by David Wheeler & Roger Needham, Cambridge University Computer Lab, UK, http://www.ftp.cl.cam.ac.uk/ftp/papers/djw-rmn/djw-rmn-tea.html , 1994.
Later it was enhanced (Block TEA, XTEA or TEAN: http://www.ftp.cl.cam.ac.uk/ftp/users/djw3/xtea.ps, 1997 and XXTEA: http://www.ftp.cl.cam.ac.uk/ftp/users/djw3/xxtea.ps , 1998).
The review, cryptanalysis, summary of attacks and discussion is presented by Matthew D. Russell in An Overview of TEA and Related Ciphers, http://www-users.cs.york.ac.uk/~matthew/TEA/TEA.html , 2004.See also The Tiny Encryption Algorithm website maintained by Simon Shepherd, Professor of Computational Mathematics, Director of the Cryptography and Computer Security Laboratory, Bradford University, England: http://www.simonshepherd.supanet.com/tea.htm.
The family of TEA algorithms (TEA, XTEA, Block TEA, XXTEA) is implemented in Pascal/Delphi by N. V. Shokhirev, 2004. The source code is here.
Please e-mail me at firstname.lastname@example.org
©Nikolai V. Shokhirev, 2001-2004