Improved fast software implementation of block ciphers
暂无分享,去创建一个
This paper improves the fast DES implementation in software proposed by Biham at the 4-th Fast Software Encryption Workshop. That is, we propose a new algorithm which reduces the number of instructions for computation of S-boxes, which is the factor dominating the performance of Biham's implementation. When we apply our algorithm to DES S-boxes, we need only 87.75 instructions in average. We can reduce the number of instructions for 1 round of DES to 942, and in total, in terms of the number of instructions, our implementation is expected to be about 8% faster than Biham's implementation.
[1] Volker Weispfenning,et al. Orders and Abstract Reduction Relations , 1993 .
[2] Eli Biham,et al. A Fast New DES Implementation in Software , 1997, FSE.
[3] Masayuki Noro,et al. Risa/Asir—a computer algebra system , 1992, ISSAC '92.