• Journal of the Korea Society of Computer and Information
• /
• v.25 no.1
• /
• pp.71-77
• /
• 2020

In this paper, we propose a method in which PingPong256 combines LFSR and variable clock to generate an irregular PRNG and use it for image encryption. PingPong256 is guaranteed an extended period based on the two LFSRs, and the variable clock is a structure that outputs the result of operating a predetermined clock in one operation by referring to the state of the different LFSR. A variable clock is characterized by the difficulty of predicting the output at any time because the choice increases with time. PingPong256 combines the advantages of LFSR and variable clock, the convenience of hardware and software implementation, and the benefits of sensitivity and irregular periods. Also, the statistical safety was verified using the NIST SP800-22, the safety of the proposed method, and the sensitivity of the image change was tested using NPCR and UACI.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.14 no.2
• /
• pp.439-446
• /
• 2019

In this paper, we propose a encryption method using C-MLCA and 1D CAT to secure medical image for efficiently. First, we generate a state transition matrix using a Wolfram rule and create a sequence of maximum length. By operating the complemented vector, it converts an existing sequence to a more complex sequence. Then, we multiply the two sequences by rows and columns to generate C-MLCA basis images of the original image size and go through a XOR operation. Finally, we will get the encrypted image to operate the 1D CAT basis function created by setting the gateway values and the image which is calculated by transform coefficients. By comparing the encrypted image with the original image, we evaluate to analyze the histogram and PSNR. Also, by analyzing NPCR and key space, we confirmed that the proposed encryption method has a high level of stability and security.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.2
• /
• pp.1064-1079
• /
• 2019

Information security has become increasingly important with the rapid development of mobile devices and internet. An efficient encryption system is a key to this end. In this paper, we propose an image encryption method based on the cross diffusion of two chaotic maps. We use two chaotic sequences, namely the Logistic map and the Chebyshev map, for key generation which has larger security key space than single one. Moreover, we use these two sequences for further image encryption diffusion which decreases the correlation of neighboring pixels significantly. We conduct extensive experiments on several well-known images like Lena, Baboon, Koala, etc. Experimental results show that our algorithm has the characteristics of large key space, fast, robust to statistic attack, etc.

• Journal of Information Processing Systems
• /
• v.9 no.2
• /
• pp.271-286
• /
• 2013

Recently, a pixel-chaotic-shuffling (PCS) method has been proposed by Huang et al. for encrypting color images using multiple chaotic systems like the Henon, the Lorenz, the Chua, and the Rossler systems. All of which have great encryption performance. The authors claimed that their pixel-chaotic-shuffle (PCS) encryption method has high confidential security. However, the security analysis of the PCS method against the chosen-plaintext attack (CPA) and known-plaintext attack (KPA) performed by Solak et al. successfully breaks the PCS encryption scheme without knowing the secret key. In this paper we present an improved shuffling pattern for the plaintext image bits to make the cryptosystem proposed by Huang et al. resistant to chosen-plaintext attack and known-plaintext attack. The modifications in the existing PCS encryption method are proposed to improve its security performance against the potential attacks described above. The Number of Pixel Change Rate (NPCR), Unified Average Changed Intensity (UACI), information entropy, and correlation coefficient analysis are performed to evaluate the statistical performance of the modified PCS method. The simulation analysis reveals that the modified PCS method has better statistical features and is more resistant to attacks than Huang et al.'s PCS method.

• Perspectives in Nursing Science
• /
• v.4 no.1
• /
• pp.1-8
• /
• 2007

Aim: The purpose of this paper is to present the importance of multidisciplinary strategies in cancer prevention and control, especially comprehensive breast cancer care. Background: Worldwide, breast cancer is the most common cancer diagnosed among women and is the leading cause of cancer deaths. Although the incidence of breast cancer in Asian countries is still lower than in Western countries, the rate of increase for the last two decades is striking. Methods: Data on cancer mortality, incidence, and risk factors were summarized by using the most recent data available from population-based cancer registries affiliated with the International Union Against Cancer, the National Cancer Institute's Surveillance, Epidemiology, and End Results (SEER) program and the CDC's National Program of Cancer Registries (NPCR). Results: Global differences in breast cancer incidence and fluctuations in rates within a country still exist. The incidence of breast cancer in Asian countries was lower than in Western countries. Breast cancer incidence in the United States decreased each year during 1999-2003. On the other hand, morbidity and mortality related to breast cancer in Asia has increased significantly. Conclusion: Multidisciplinary strategies to reduce breast cancer mortality and promote breast cancer awareness are addressed. Lessons learned from multidisciplinary approaches to cancer treatment and control will be valuable in implementing future breast cancer research in the fields of basic, clinical, and population research in Asia.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.12
• /
• pp.4508-4530
• /
• 2021

Today distributed data storage service are being widely used. However lack of proper means of security makes the user data vulnerable. In this work, we propose a Randomized Block Size (RBS) model for secure data storage in distributed environments. The model work with multifold block sizes encrypted with the Chinese Remainder Theorem-based RSA (C-RSA) technique for end-to-end security of multimedia data. The proposed RBS model has a key generation phase (KGP) for constructing asymmetric keys, and a rand generation phase (RGP) for applying optimal asymmetric encryption padding (OAEP) to the original message. The experimental results obtained with text and image files show that the post encryption file size is not much affected, and data is efficiently encrypted while storing at the distributed storage server (DSS). The parameters such as ciphertext size, encryption time, and throughput have been considered for performance evaluation, whereas statistical analysis like similarity measurement, correlation coefficient, histogram, and entropy analysis uses to check image pixels deviation. The number of pixels change rate (NPCR) and unified averaged changed intensity (UACI) were used to check the strength of the proposed encryption technique. The proposed model is robust with high resilience against eavesdropping, insider attack, and chosen-plaintext attack.

• Journal of Information Processing Systems
• /
• v.18 no.1
• /
• pp.59-74
• /
• 2022

During the last decade, the security of digital images has received considerable attention in various multimedia transmission schemes. However, many current cryptosystems tend to adopt a single-layer permutation or diffusion algorithm, resulting in inadequate security. A hierarchical bilateral diffusion architecture for color image encryption is proposed in response to this issue, based on a hyperchaotic system and DNA sequence operation. Primarily, two hyperchaotic systems are adopted and combined with cipher matrixes generation algorithm to overcome exhaustive attacks. Further, the proposed architecture involves designing pixelpermutation, pixel-diffusion, and DNA (deoxyribonucleic acid) based block-diffusion algorithm, considering system security and transmission efficiency. The pixel-permutation aims to reduce the correlation of adjacent pixels and provide excellent initial conditions for subsequent diffusion procedures, while the diffusion architecture confuses the image matrix in a bilateral direction with ultra-low power consumption. The proposed system achieves preferable number of pixel change rate (NPCR) and unified average changing intensity (UACI) of 99.61% and 33.46%, and a lower encryption time of 3.30 seconds, which performs better than some current image encryption algorithms. The simulated results and security analysis demonstrate that the proposed mechanism can resist various potential attacks with comparatively low computational time consumption.