Skip to main content
Conference ProceedingsOPEN ACCESS

Tea, a tiny encryption algorithm

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1995) 1008 363-366
DOI: 10.1007/3-540-60590-8_29
256Citations
Citations of this article
141Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

CITATION STYLE

APA

Wheeler, D. J., & Needham, R. M. (1995). Tea, a tiny encryption algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1008, pp. 363–366). Springer Verlag. https://doi.org/10.1007/3-540-60590-8_29

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free