1. Andem , V. R. 2003 . A Cryptanalysis of the Tiny Encryption Algorithm . M.Sc Thesis , University of Alabama at Tuscaloosa , Tuscaloosa , AL . http://www.cs.ua.edu/SecurityResearchGroup/VRAndem.pdf. (accessed May 12, 2007) .
2. Broesma , M. 14 October 2002 . New X-Box Security Cracked by Linux Fans.http://news.zdnet.co.uk/software/developer/0,39020387,2123851,00.htm. (accessed May 12, 2007)
3. Fleming , R. October 1996 . An Attack on a Weakened Version of TEA . http://groups.google.com/groups?selm-roger_sf-2210961222000001%40mg4-50.its.utas.edu.au. (accessed May 12, 2007) .
4. Hernández , J. C. , J. M. Sierra , A. Ribagorda , B. Ramos and J. C. Mex-Pereira . Distinguishing TEA from a Random Permutation: Reduced Round Versions of TEA Do Not Have the SAC or Do Not Generate Random Numbers . In Proceedings of the IMA Int. Conf. on Cryptography and Coding IMA Conference held 24–27 Sept. 2002, Malaga, Spain 2001 , 374 – 377 , 2001 .