Research on cloud dynamic public key information security based on elliptic curve and primitive Pythagoras

In order to solve the problems of key redundancy, transmission and storage security and the difficulty of realizing the one-time-secret mode in image encryption algorithm, this paper proposes a cloud dynamic public key information security scheme based on elliptic curve and primitive Pythagoras. The 6-D Lorentz hyperchaos system is used as the key generator, and the generated key is stored in the cloud key management center, which supports automatic update and dynamic change to further ensure the security of the key. The encryption key is selected by elliptic curve and primitive Pythagorean triplet. In the scrambling algorithm, according to the parity of random number and the parity of image pixel value coordinates, elliptic curve is used to reset the plaintext image. In the diffusion algorithm, the three-side rotation characteristic of the Rubik’s cube is simulated, the binary sequence of pixel values is stored at eight vertices of the cube, the cube is rotated according to the key value, and the changed 8 new binary numbers are XOR operated with the random sequence to obtain the new pixel value. The algorithm in this paper is applied to network transmission, which can effectively prevent data eavesdropping, tampering and forgery, ensure communication security.

Authors

Publication Details

Journal
Alexandria Engineering Journal
Published
2024-11-18
DOI
https://doi.org/10.1016/j.aej.2024.11.012
Citations
3
Primary Topic
Chaos-based Image/Signal Encryption
Type
article
Field-Weighted Citation Impact
0.75

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Research on cloud dynamic public key information security based on elliptic curve and primitive Pythagoras

Jianmeng Liu, Fan Zhang, Zhenlong Man, Xiangfu Meng
3 citations
Alexandria Engineering Journal
Chaos-based Image/Signal Encryption
0.75
article

Research on cloud dynamic public key information security based on elliptic curve and primitive Pythagoras

Jianmeng Liu, Fan Zhang, Zhenlong Man, Xiangfu Meng
article en
3 citations

Abstract

In order to solve the problems of key redundancy, transmission and storage security and the difficulty of realizing the one-time-secret mode in image encryption algorithm, this paper proposes a cloud dynamic public key information security scheme based on elliptic curve and primitive Pythagoras. The 6-D Lorentz hyperchaos system is used as the key generator, and the generated key is stored in the cloud key management center, which supports automatic update and dynamic change to further ensure the security of the key. The encryption key is selected by elliptic curve and primitive Pythagorean triplet. In the scrambling algorithm, according to the parity of random number and the parity of image pixel value coordinates, elliptic curve is used to reset the plaintext image. In the diffusion algorithm, the three-side rotation characteristic of the Rubik’s cube is simulated, the binary sequence of pixel values is stored at eight vertices of the cube, the cube is rotated according to the key value, and the changed 8 new binary numbers are XOR operated with the random sequence to obtain the new pixel value. The algorithm in this paper is applied to network transmission, which can effectively prevent data eavesdropping, tampering and forgery, ensure communication security.

Alexandria Engineering JournalVol. 113
National Natural Science Foundation of China, Department of Education of Liaoning Province
Openalex Percentile: Top 26%
Chaos-based Image/Signal Encryption
0.75
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.