Elliptic curve cryptography (ECC)-based image encryption is a predominant research area in recent days, and many researchers have contributed state-of-the-art techniques to improve this cryptosystem. The concept of Suslin matrices was introduced by Suslin, which has many intrinsic developments and applications nowadays. This was the first time this concept was used in image processing and information security. This paper proposes extending Suslin-based image encryption to double and triple-Suslin-based image encryption, using an elliptic curve cryptosystem to enhance the higher performance. The time complexity of Suslin size 512 × 512 image-based image encryption is also derived and analyzed. The significant contributions of the proposed work are the following: (i) The determination of vectors of the Suslin can be computed from the key of the ECC, and (ii) the inverse of Suslin of any size of order \(2^{r} \times 2^{r} ;r \ge 1\) can be easily determined. Finally, it is concluded that the performance metrics of various parameters of the proposed methods are better than the other state-of-the-art techniques recently proposed, including the time complexity.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

A New Approach to Image Encryption: Suslin Matrix Combined with Elliptic Curve Cryptography

  • R. Siddharth Krishna,
  • K. S. Ravichandran,
  • R. Sivagami

摘要

Elliptic curve cryptography (ECC)-based image encryption is a predominant research area in recent days, and many researchers have contributed state-of-the-art techniques to improve this cryptosystem. The concept of Suslin matrices was introduced by Suslin, which has many intrinsic developments and applications nowadays. This was the first time this concept was used in image processing and information security. This paper proposes extending Suslin-based image encryption to double and triple-Suslin-based image encryption, using an elliptic curve cryptosystem to enhance the higher performance. The time complexity of Suslin size 512 × 512 image-based image encryption is also derived and analyzed. The significant contributions of the proposed work are the following: (i) The determination of vectors of the Suslin can be computed from the key of the ECC, and (ii) the inverse of Suslin of any size of order \(2^{r} \times 2^{r} ;r \ge 1\) can be easily determined. Finally, it is concluded that the performance metrics of various parameters of the proposed methods are better than the other state-of-the-art techniques recently proposed, including the time complexity.