Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Algorithm

Tiny Encryption Algorithm

Cryptographic Algorithm

The Tiny Encryption Algorithm, or TEA, is a block cipher in cryptography notable for its simplicity, typically implementable in only a few lines of code. It was designed by David Wheeler and Roger Needham of the Cambridge Computer Laboratory and first presented at the Fast Software Encryption workshop in Leuven in 1994. The cipher is not subject to any patents.

Connections

Credited To

Source Tiny Encryption Algorithm (Wikipedia)
Source Tiny Encryption Algorithm (Wikipedia)

In Field

Cryptography, Fields
Source Tiny Encryption Algorithm (Wikipedia)

Invented By

Source Tiny Encryption Algorithm (Wikipedia)
Source Tiny Encryption Algorithm (Wikipedia)
Sources
Wikidata: Tiny Encryption Algorithm
Wikidata Q1595597, class allow-list match (w-wdresolver-0926)View the Source
Tiny Encryption Algorithm (Wikipedia)
  • In Group: Block Cipher, Lead paragraph: 'the Tiny Encryption Algorithm (TEA) is a block cipher notable for its simplicity'.
  • In Field: Cryptography, Lead sentence
    Tiny Encryption Algorithm (TEA) is a block cipher notable for its simplicity of description and implementation, typically a few lines of code.
  • Invented By: Roger Needham, Infobox, designers field
    Roger Needham, David Wheeler
  • Invented By: David Wheeler, Infobox, designers field
    Roger Needham, David Wheeler
  • Credited To: Roger Needham, Lead paragraph
    It was designed by David Wheeler and Roger Needham of the Cambridge Computer Laboratory; it was first presented at the Fast Software Encryption workshop in Leuven in 1994, and first published in the proceedings of that workshop.
  • Credited To: David Wheeler, Lead paragraph
    It was designed by David Wheeler and Roger Needham of the Cambridge Computer Laboratory; it was first presented at the Fast Software Encryption workshop in Leuven in 1994, and first published in the proceedings of that workshop.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.