TEA, a tiny encryption algorithm

  • David J. Wheeler
  • Roger M. Needham
Session 8: Recent Results
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1008)

Abstract

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

Copyright information

© Springer-Verlag 1995

Authors and Affiliations

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

Personalised recommendations