TEA, a tiny encryption algorithm

  • David J. Wheeler
  • Roger M. Needham
Session 8: Recent Results

DOI: 10.1007/3-540-60590-8_29

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1008)
Cite this paper as:
Wheeler D.J., Needham R.M. (1995) TEA, a tiny encryption algorithm. In: Preneel B. (eds) Fast Software Encryption. FSE 1994. Lecture Notes in Computer Science, vol 1008. Springer, Berlin, Heidelberg


We give a short routine which is based on a Feistel iteration and uses a large number of rounds to get security with simplicity.

Download to read the full conference paper text

Copyright information

© Springer-Verlag 1995

Authors and Affiliations

  • David J. Wheeler
    • 1
  • Roger M. Needham
    • 1
  1. 1.Computer LaboratoryCambridge UniversityEngland

Personalised recommendations