earticle

논문검색

A Random PRESENT Encryption Algorithm Based on Dynamic S-box

초록

영어

S-box mainly plays the role of confusion in the encryption process as an important component. For the new encryption algorithm PRESENT proposed in 2007, S-box impacts on the security of the encryption algorithm directly. This paper briefly describes the process of PRESENT algorithm and proposes an improved S-box to solve the problem that the original PRESENT S-box has anti-fixed point. Then a random PRESENT encryption algorithm based on dynamic S-box is proposed. The dynamic multiple S-boxes technology is used to implement random PRESENT algorithm, to enhance the security of the cryptographic algorithm. Finally, the security analysis is done, and it suggests that dynamic S-box has a superior ability to resist differential attack and linear attack. By comparison to the diffusion rate of original PRESENT S-box, our dynamic S-box has better avalanche effect.

목차

Abstract
 1. Introduction
 2. Present
 3. S-boxes Improvement Ideas
  3.1 Improvement of the PRESENT S-box
  3.2 Performance and Testing
 4. Dynamic S-box Design
 5. Dynamic S-box Analysis
  5.1 Security Analysis
  5.2 Test and Comparison of Cryptographic Properties
 6. Conclusions
 Acknowledgements
 References

저자정보

  • Zhiying Tang School of Computer Science and Technology, Anhui University, Hefei, 230039, China
  • Jie Cui School of Computer Science and Technology, Anhui University, Hefei, 230039, China
  • Hong Zhong School of Computer Science and Technology, Anhui University, Hefei, 230039, China
  • Mingyong Yu School of Computer Science and Technology, Anhui University, Hefei, 230039, China

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.