会议专题

A Fast New One-Way Cryptographic Hash Function

This paper proposes a novel Coupled Integer Tent Mapping System-based cryptographic one-way hashing algorithm termed as THA. THA compresses a message of arbitrary length into a fingerprint of 160 bits. The algorithm adopts a piece-wise message expansion scheme. Compared with SHA-1 message expansion, the message expansion scheme has enhanced the degree of nonlinear diffusion of the message expansion, and thus increases the computation efficiency. In addition, the integer tent map replaces the traditional logic functions as the major nonlinear component of compression function, and so the scheme has ideal properties of diffusion and confusion. Furthermore, the parallel iteration structure is adopted in the compression functions, which is advantageous to high speed parallel operation of software and hardware.

cryptography Hash function tent map piecewise message expansion

Liu Jian-dong Tian Ye Wang Shu-hong Yang Kai

Information Engineering College Beijing Institute of Petrochemical Technology Beijing, China

国际会议

2010 IEEE International Conference Conferenhce on Wireless Communications,Networking and Information Security(2010 IEEE 无线通信、网络技术与信息安全国际会议 WCNIS)

北京

英文

1-5

2010-06-25(万方平台首次上网日期,不代表论文的发表时间)