Parallelism of the SANDstorm hash algorithm.

Torgerson, Mark Dolan ; Draelos, Timothy John ; Schroeppel, Richard Crabtree

关键词: ALGORITHMS;    S CODES;    COMMUNICATIONS;    PERFORMANCE;    TESTING;    EFFICIENCY;    CRYPTOGRAPHY;    PARALLEL PROCESSING;   

DOI  :  10.2172/993877
RP-ID  :  SAND2009-6093
PID  :  OSTI ID: 993877
Others  :  TRN: US201101%%105

学科分类：数学（综合）

美国|英语

来源: SciTech Connect

【 摘 要 】

Mainstream cryptographic hashing algorithms are not parallelizable. This limits their speed and they are not able to take advantage of the current trend of being run on multi-core platforms. Being limited in speed limits their usefulness as an authentication mechanism in secure communications. Sandia researchers have created a new cryptographic hashing algorithm, SANDstorm, which was specifically designed to take advantage of multi-core processing and be parallelizable on a wide range of platforms. This report describes a late-start LDRD effort to verify the parallelizability claims of the SANDstorm designers. We have shown, with operating code and bench testing, that the SANDstorm algorithm may be trivially parallelized on a wide range of hardware platforms. Implementations using OpenMP demonstrates a linear speedup with multiple cores. We have also shown significant performance gains with optimized C code and the use of assembly instructions to exploit particular platform capabilities.