||
本文为美国阿拉巴马大学(作者:VIKRAM REDDY ANDEM)的硕士论文,共68页。
微加密算法(TEA)是一种加密方法,旨在最小化内存占用和最大化加密速度。它是一种Feistel类型的密码,使用了混合(正交)代数组的操作。本研究主要针对微加密算法进行密码分析。在这项研究中,我们检查了用于块密码算法密码分析的最常用方法。TEA似乎对差分密码分析具有很高的抵抗能力,并且在仅仅6轮分析之后就实现了完全扩散(明文中的1位差异将导致密码文本中的大约32位差异)。现代台式计算机或工作站的运算性能令人感到印象深刻。
The Tiny Encryption Algorithm (TEA) is acryptographic algorithm designed to minimize memory footprint and maximizespeed. It is a Feistel type cipher that uses operations from mixed (orthogonal)algebraic groups. This research presents the cryptanalysis of the TinyEncryption Algorithm. In this research we inspected the most common methods inthe cryptanalysis of a block cipher algorithm. TEA seems to be highly resistantto differential cryptanalysis, and achieves complete diffusion (where a one bitdifference in the plaintext will cause approximately 32 bit differences in thecipher text) after only six rounds. Time performance on a modern desktopcomputer or workstation is very impressive.
更多精彩文章请关注公众号:
Archiver|手机版|科学网 ( 京ICP备07017567号-12 )
GMT+8, 2024-9-20 02:46
Powered by ScienceNet.cn
Copyright © 2007- 中国科学报社