This paper studies the implementation of bytes multiplication in GF (2 8) based on the Rijndael resource code which is published by NIST , and analyses the characteristics of the encryption rounds, and then propose two improved schemes. Based on the technology of DSPs , we synthetically optimize the resource code and the experiments show good results. This paper studies the implementation of bytes multiplication in GF (2 8) based on the Rijndael resource code which is published by NIST, and analyzes the characteristics of the encryption rounds, and then propose two improved schemes. Based on the technology of DSPs, we synthetically optimize the resource code and the experiments show good results.