Last update: Sun Oct 15 02:35:30 MDT 2017
@Article{Wheeler:1995:TTE, author = "David J. Wheeler and Roger M. Needham", title = "{TEA}, a tiny encryption algorithm", journal = j-LECT-NOTES-COMP-SCI, volume = "1008", pages = "363--366", year = "1995", CODEN = "LNCSD9", DOI = "https://doi.org/10.1007/3-540-60590-8_29", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Sat May 11 13:45:32 MDT 1996", bibsource = "ftp://ftp.math.utah.edu/pub/tex/bib/lncs1996a.bib; http://www.math.utah.edu/pub/tex/bib/compj2000.bib; http://www.math.utah.edu/pub/tex/bib/lncs1995b.bib; http://www.math.utah.edu/pub/tex/bib/prng.bib", note = "See also extensions XTEA \cite{Needham:1997:TE} and XXTEA \cite{Wheeler:1998:CX}.", URL = "http://www.springerlink.com/content/p16916lx735m2562/", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", keywords = "TEA; Tiny Encryption Algorithm", remark = "Proceedings of the Second International Workshop on Fast Software Encryption.", }