Generation and study of random sequence of elliptic curve points over finite rings for medical Image cryptography
摘要
Data processing is ensured with a high degree of security, where significant cryptography mechanisms are performed to protect sensitive data. Elliptic Curve Cryptography (ECC) is the generator for the Pseudo Random Sequences (PRS) generation, which is used as it has extremely efficient and secure generation requirements. Initially, Elliptic Curve Group PRS in prime Fields and finite rings is used. Then, the Chinese Remainder Theorem (CRT) enhances high-performance in computations and security. The NIST test suite, correlation tests and information entropy are used to prove the generated PRS. The proposed model illustrates that the ECC is used in finite rings by confirmed sequences in medical image cryptography. The 12,660 publicly available medical image datasets, known as the diabetic retinopathy dataset, can be used to conduct a transparent and replicable analysis of the methods. The proposed method's information entropy of 7.99987 (around the ideal value of 8 for 8-bit images) and NPCR of 99.735% show strong unpredictability and high sensitivity to pixel changes. Furthermore, 15 of the 16 NIST SP800-22 suite tests are passed by the generated sequences. The entropy analysis indicates 7.99987 when the rings are a finite foundation, as compared with 99.735% in the Number of Pixel Change Rate (NPCR) and 33.528 in Unified Average Changing Intensity (UACI).