Pub Date : 2018-10-04DOI: 10.1504/IJICS.2018.10016376
Arup Kumar Pal, Soumitra Roy
In this paper, the authors have presented a robust and blind watermarking scheme based on discrete cosine transform (DCT) for protecting the copyright ownership of digital images. Initially, the image is decomposed into non-overlapping blocks and subsequently DCT is employed on each block to embed a binary bit of watermark into each transformed block by modifying some middle significant AC coefficients using repetition code. During the embedding phase of the proposed method, DC and some higher AC coefficients are kept intact after zigzag scanning of each DCT block to ensure the high visual quality of watermarked image. This scheme is suitable to protect the copyright information even in compressed form of the watermarked image since it exploits middle bands of DCT coefficients for embedding the watermark bits. The proposed scheme is also tested to verify the withstand capability against several image processing attacks and satisfactory results are achieved.
{"title":"A robust and blind image watermarking scheme in DCT domain","authors":"Arup Kumar Pal, Soumitra Roy","doi":"10.1504/IJICS.2018.10016376","DOIUrl":"https://doi.org/10.1504/IJICS.2018.10016376","url":null,"abstract":"In this paper, the authors have presented a robust and blind watermarking scheme based on discrete cosine transform (DCT) for protecting the copyright ownership of digital images. Initially, the image is decomposed into non-overlapping blocks and subsequently DCT is employed on each block to embed a binary bit of watermark into each transformed block by modifying some middle significant AC coefficients using repetition code. During the embedding phase of the proposed method, DC and some higher AC coefficients are kept intact after zigzag scanning of each DCT block to ensure the high visual quality of watermarked image. This scheme is suitable to protect the copyright information even in compressed form of the watermarked image since it exploits middle bands of DCT coefficients for embedding the watermark bits. The proposed scheme is also tested to verify the withstand capability against several image processing attacks and satisfactory results are achieved.","PeriodicalId":164016,"journal":{"name":"Int. J. Inf. Comput. Secur.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123635384","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-10-04DOI: 10.1504/IJICS.2018.10007844
S. K. Moon, R. Raut
Data embedding using steganography is not a major issue but recovery of hidden data in a secured way without degradation of both original and secret data are the major problem. To the best of our knowledge many researchers are working on image steganography using exploited modified direction (EMD) algorithm to improve the hiding capacity and security. But nowadays internet is mostly popular due to Facebook, YouTube and WhatsApp which consists of videos; hence in this paper we have proposed a combination of video crypto-steganography and digital forensic technique using modified general EMD (MGEMD) algorithm for enhancing the embedding capacity and security of secret data. We have embedded the secret data as an image and audio behind the selected frames of video and obtained the key security parameters using forensic technique to improve the hiding capacity and the data security which is found to be better than any other existing methods.
{"title":"Innovative data security model using forensic audio video steganography for improving hidden data security and robustness","authors":"S. K. Moon, R. Raut","doi":"10.1504/IJICS.2018.10007844","DOIUrl":"https://doi.org/10.1504/IJICS.2018.10007844","url":null,"abstract":"Data embedding using steganography is not a major issue but recovery of hidden data in a secured way without degradation of both original and secret data are the major problem. To the best of our knowledge many researchers are working on image steganography using exploited modified direction (EMD) algorithm to improve the hiding capacity and security. But nowadays internet is mostly popular due to Facebook, YouTube and WhatsApp which consists of videos; hence in this paper we have proposed a combination of video crypto-steganography and digital forensic technique using modified general EMD (MGEMD) algorithm for enhancing the embedding capacity and security of secret data. We have embedded the secret data as an image and audio behind the selected frames of video and obtained the key security parameters using forensic technique to improve the hiding capacity and the data security which is found to be better than any other existing methods.","PeriodicalId":164016,"journal":{"name":"Int. J. Inf. Comput. Secur.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129745830","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-10-04DOI: 10.1504/IJICS.2018.10016384
Soufiane El Moumni, M. Fettach, A. Tragha
Cryptographic hash functions have an important role in numerous cryptographic mechanisms like computing digital signatures, checking data integrity, storing passwords and generating random numbers. Due to the cryptanalysis attacks on hash functions, NIST expressed its need to a new resistant hash function by announcing a public competition, this competition made Keccak hash function the new secure hash algorithm SHA-3. This new SHA-3 proved its strengths against recent attacks. However it has to be implemented efficiently in order to keep its resistance. In other words, an efficient FPGA design of hash functions is needed be it increasing frequency, minimising area consumption, or increasing throughput. In this paper we have focused on increasing frequency of the Keccak-512, and we have achieved 401.2 MHz as a maximum frequency, and 9.62 Gbps as a throughput. The proposed design has been implemented in Xilinx Virtex-5 and Virtex-6 FPGA devices and compared to existing FPGA implementations.
{"title":"High frequency implementation of cryptographic hash function Keccak-512 on FPGA devices","authors":"Soufiane El Moumni, M. Fettach, A. Tragha","doi":"10.1504/IJICS.2018.10016384","DOIUrl":"https://doi.org/10.1504/IJICS.2018.10016384","url":null,"abstract":"Cryptographic hash functions have an important role in numerous cryptographic mechanisms like computing digital signatures, checking data integrity, storing passwords and generating random numbers. Due to the cryptanalysis attacks on hash functions, NIST expressed its need to a new resistant hash function by announcing a public competition, this competition made Keccak hash function the new secure hash algorithm SHA-3. This new SHA-3 proved its strengths against recent attacks. However it has to be implemented efficiently in order to keep its resistance. In other words, an efficient FPGA design of hash functions is needed be it increasing frequency, minimising area consumption, or increasing throughput. In this paper we have focused on increasing frequency of the Keccak-512, and we have achieved 401.2 MHz as a maximum frequency, and 9.62 Gbps as a throughput. The proposed design has been implemented in Xilinx Virtex-5 and Virtex-6 FPGA devices and compared to existing FPGA implementations.","PeriodicalId":164016,"journal":{"name":"Int. J. Inf. Comput. Secur.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126463393","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-10-04DOI: 10.1504/IJICS.2018.10010256
A. Bhattacharjya, Xiaofeng Zhong, Jing Wang, Xing Li
Efficient balancing of privacy and strong authentication in end-to-end (E2E) security constitutes a challenging task in the field of personal messaging. Since RSA is a ubiquitous approach, we here propose a hybrid RSA-based, highly efficient, reliable and strong personal full mesh networked messaging scheme. M-prime RSA and CRT-RSA with shared RSA makes our hybrid RSA decryption much more secure and efficient and protects our users with complete privacy. However, computational modular exponentiation complexity and partial key exposure vulnerability of RSA present two major obstacles. Low modular complexity and asymptotic very slow speed of decryption of RSA, with the ease and speed problem in encryption of RSA are also problems to be solved. Our hybrid RSA cipher resolves all of the above issues and provides protection against exploitation of multiplicative property and homomorphic property of RSA. Our full mesh networking scheme also ensures E2E encryption for all peers. So, our three-way authenticated hybrid RSA messaging scheme achieves a perfect balance of efficiency, security, authentication, reliability and privacy. Consequently, our scheme offers a smarter choice for private messaging in existing, as well as future, internet architectures.
{"title":"Hybrid RSA-based highly efficient, reliable and strong personal full mesh networked messaging scheme","authors":"A. Bhattacharjya, Xiaofeng Zhong, Jing Wang, Xing Li","doi":"10.1504/IJICS.2018.10010256","DOIUrl":"https://doi.org/10.1504/IJICS.2018.10010256","url":null,"abstract":"Efficient balancing of privacy and strong authentication in end-to-end (E2E) security constitutes a challenging task in the field of personal messaging. Since RSA is a ubiquitous approach, we here propose a hybrid RSA-based, highly efficient, reliable and strong personal full mesh networked messaging scheme. M-prime RSA and CRT-RSA with shared RSA makes our hybrid RSA decryption much more secure and efficient and protects our users with complete privacy. However, computational modular exponentiation complexity and partial key exposure vulnerability of RSA present two major obstacles. Low modular complexity and asymptotic very slow speed of decryption of RSA, with the ease and speed problem in encryption of RSA are also problems to be solved. Our hybrid RSA cipher resolves all of the above issues and provides protection against exploitation of multiplicative property and homomorphic property of RSA. Our full mesh networking scheme also ensures E2E encryption for all peers. So, our three-way authenticated hybrid RSA messaging scheme achieves a perfect balance of efficiency, security, authentication, reliability and privacy. Consequently, our scheme offers a smarter choice for private messaging in existing, as well as future, internet architectures.","PeriodicalId":164016,"journal":{"name":"Int. J. Inf. Comput. Secur.","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133598072","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-10-04DOI: 10.1504/IJICS.2018.10012517
Muhammad Azeem, Yongquan Cai, A. Ditta, Khurram Gulzar Rana, Faheem Akhtar Rajpoot
From centuries, information security has been an attractive topic for security officials, intruders, hackers and other communication sectors throughout the world. Cryptography and steganography are widely practiced for secure communication over the internet. In steganography, data hiding capacity has been a great challenge for the research community and security officials. In this research, a novel algorithm is elaborated to conceal secret data with higher cover text capacity by using three different unicode characters such as zero width joiner, zero width non-joiner and zero width character. English text is taken as a message carrier. Before embedding a secret message into cover text, one's complement is applied on binary value of specific characters in secret message. Furthermore, 'Steger' is developed for the practical implementation of designed algorithm. The results revealed that newly designed algorithm reported higher data hiding capacity with security and size efficiency. This is an astonishing increase in data hiding capacity of carrier text. The unicode approach was efficiently and effectively used to reduce the attention of intruders.
{"title":"Information hiding: a novel algorithm for enhancement of cover text capacity by using unicode characters","authors":"Muhammad Azeem, Yongquan Cai, A. Ditta, Khurram Gulzar Rana, Faheem Akhtar Rajpoot","doi":"10.1504/IJICS.2018.10012517","DOIUrl":"https://doi.org/10.1504/IJICS.2018.10012517","url":null,"abstract":"From centuries, information security has been an attractive topic for security officials, intruders, hackers and other communication sectors throughout the world. Cryptography and steganography are widely practiced for secure communication over the internet. In steganography, data hiding capacity has been a great challenge for the research community and security officials. In this research, a novel algorithm is elaborated to conceal secret data with higher cover text capacity by using three different unicode characters such as zero width joiner, zero width non-joiner and zero width character. English text is taken as a message carrier. Before embedding a secret message into cover text, one's complement is applied on binary value of specific characters in secret message. Furthermore, 'Steger' is developed for the practical implementation of designed algorithm. The results revealed that newly designed algorithm reported higher data hiding capacity with security and size efficiency. This is an astonishing increase in data hiding capacity of carrier text. The unicode approach was efficiently and effectively used to reduce the attention of intruders.","PeriodicalId":164016,"journal":{"name":"Int. J. Inf. Comput. Secur.","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133077489","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-10-04DOI: 10.1504/IJICS.2018.10016383
Ross Gore, S. Diallo, J. Padilla, B. Ezell
One of the difficulties in effectively analysing and combating cyber attacks is an inability to identify when, why and how they occur. Victim organisations do not reveal this data for fear of disclosing vulnerabilities and attackers do not reveal themselves for fear of being prosecuted. In this paper, we employ two machine-learning algorithms to identify: 1) if a text-based report is related to a cyber-incident; 2) the topic within the field of cyber-security the incident report addresses. First, we evaluate the effectiveness of our approach using a benchmark set of cyber-incident reports from 2006. Then, we assess the current state of cyber-security by applying our approach to a 2014 set of cyber-incident reports we gathered. Ultimately, our results show that the combination of automatically gathering and organising cyber-security reports in close to real-time yields an assessment technology with actionable results for intelligence and security analysts.
{"title":"Assessing cyber-incidents using machine learning","authors":"Ross Gore, S. Diallo, J. Padilla, B. Ezell","doi":"10.1504/IJICS.2018.10016383","DOIUrl":"https://doi.org/10.1504/IJICS.2018.10016383","url":null,"abstract":"One of the difficulties in effectively analysing and combating cyber attacks is an inability to identify when, why and how they occur. Victim organisations do not reveal this data for fear of disclosing vulnerabilities and attackers do not reveal themselves for fear of being prosecuted. In this paper, we employ two machine-learning algorithms to identify: 1) if a text-based report is related to a cyber-incident; 2) the topic within the field of cyber-security the incident report addresses. First, we evaluate the effectiveness of our approach using a benchmark set of cyber-incident reports from 2006. Then, we assess the current state of cyber-security by applying our approach to a 2014 set of cyber-incident reports we gathered. Ultimately, our results show that the combination of automatically gathering and organising cyber-security reports in close to real-time yields an assessment technology with actionable results for intelligence and security analysts.","PeriodicalId":164016,"journal":{"name":"Int. J. Inf. Comput. Secur.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132166969","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-10-04DOI: 10.1504/IJICS.2018.10016392
A. Jain, B. Gupta
Today, phishing is one of the biggest problems faced by the cyber-world. In this paper, we present an approach that can detect phishing attacks in commercial and e-banking websites using the link and visual similarity relations. Phisher always tries to mimic the visual design of the webpage and the fake webpage contains identity keywords and hyperlinks that point to the corresponding legitimate webpage to trap internet users. Therefore, our proposed approach analyse the keywords, hyperlinks and CSS layout of the webpage to detect phishing attack. In the proposed approach, we make a set of associate domains with the suspicious webpage and explore the link and similarity relation to identifying phishing webpages. Also, we use the login form and whitelist based filtering to increase the running time of the proposed approach. Our proposed approach is not only able to detect phishing webpages accurately but its source webpage also. Moreover, it does not require any prior training to detect zero hour phishing attack. Experiments are conducted over a 6,616 phishing and legitimate webpages and the proposed approach gives approximately 99.72% true positive rate and less than 1.89% false negative rate.
{"title":"Detection of phishing attacks in financial and e-banking websites using link and visual similarity relation","authors":"A. Jain, B. Gupta","doi":"10.1504/IJICS.2018.10016392","DOIUrl":"https://doi.org/10.1504/IJICS.2018.10016392","url":null,"abstract":"Today, phishing is one of the biggest problems faced by the cyber-world. In this paper, we present an approach that can detect phishing attacks in commercial and e-banking websites using the link and visual similarity relations. Phisher always tries to mimic the visual design of the webpage and the fake webpage contains identity keywords and hyperlinks that point to the corresponding legitimate webpage to trap internet users. Therefore, our proposed approach analyse the keywords, hyperlinks and CSS layout of the webpage to detect phishing attack. In the proposed approach, we make a set of associate domains with the suspicious webpage and explore the link and similarity relation to identifying phishing webpages. Also, we use the login form and whitelist based filtering to increase the running time of the proposed approach. Our proposed approach is not only able to detect phishing webpages accurately but its source webpage also. Moreover, it does not require any prior training to detect zero hour phishing attack. Experiments are conducted over a 6,616 phishing and legitimate webpages and the proposed approach gives approximately 99.72% true positive rate and less than 1.89% false negative rate.","PeriodicalId":164016,"journal":{"name":"Int. J. Inf. Comput. Secur.","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127155065","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-05-03DOI: 10.1504/IJICS.2018.10012570
Shaojing Li, Wanli Su
In the digital information age, data sharing and security are important research topics, data sharing technology and information security technology have developed rapidly. The reputation incentive mechanism based on interest of nodes is important in P2P file sharing system. This mechanism can reduce the transaction risk in P2P file sharing system, improve the success rate of transaction and maintain the sound development of network. In addition, in this paper, two typical security problems (naive attack and sybil attack) are studied to minimise the damage to the network. The simulation and analysis of the success rate of resource location and transaction show that the reputation incentive mechanism is correct, feasible and effective. Furthermore, it has significant improvements in security and simplicity.
{"title":"The research of reputation incentive mechanism of P2P network file sharing system","authors":"Shaojing Li, Wanli Su","doi":"10.1504/IJICS.2018.10012570","DOIUrl":"https://doi.org/10.1504/IJICS.2018.10012570","url":null,"abstract":"In the digital information age, data sharing and security are important research topics, data sharing technology and information security technology have developed rapidly. The reputation incentive mechanism based on interest of nodes is important in P2P file sharing system. This mechanism can reduce the transaction risk in P2P file sharing system, improve the success rate of transaction and maintain the sound development of network. In addition, in this paper, two typical security problems (naive attack and sybil attack) are studied to minimise the damage to the network. The simulation and analysis of the success rate of resource location and transaction show that the reputation incentive mechanism is correct, feasible and effective. Furthermore, it has significant improvements in security and simplicity.","PeriodicalId":164016,"journal":{"name":"Int. J. Inf. Comput. Secur.","volume":"32 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120920330","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-05-03DOI: 10.1504/IJICS.2018.10012573
Lihua Song, Xiaofeng Zhang
Image segmentation is to partition one given image into different regions. In essence, the procedure of image segmentation is to cluster the pixels into different groups according to the retrieved features. However, artefacts in the given images make the features be contaminated, resulting in poor performance of current segmentation algorithms. Therefore, how to reduce the effect of image artefacts is one hot topic in image processing. In current algorithms, neighbour information is adopted to resist the effect of image artefacts. However, when the image is contaminated with high-level noise, current algorithms also perform poor. Recently, non-local information is introduced to improve the quality of segmentation results, in which pixel relevance between pixels is crucial. In this paper, pixel relevance is measured based on Mahalanobis distance. More specifically, we consider the distribution of different samples and relevance interference between samples in the procedure of computing pixel relevance. Then, a new algorithm based on the novel pixel relevance is proposed, where non-local information can be incorporated into fuzzy clustering for image segmentation. The new algorithm can improve the robustness of corresponding algorithms greatly. Experiments on different noisy images show that the proposed algorithm can retrieve better results than conventional algorithms.
{"title":"Improved pixel relevance based on Mahalanobis distance for image segmentation","authors":"Lihua Song, Xiaofeng Zhang","doi":"10.1504/IJICS.2018.10012573","DOIUrl":"https://doi.org/10.1504/IJICS.2018.10012573","url":null,"abstract":"Image segmentation is to partition one given image into different regions. In essence, the procedure of image segmentation is to cluster the pixels into different groups according to the retrieved features. However, artefacts in the given images make the features be contaminated, resulting in poor performance of current segmentation algorithms. Therefore, how to reduce the effect of image artefacts is one hot topic in image processing. In current algorithms, neighbour information is adopted to resist the effect of image artefacts. However, when the image is contaminated with high-level noise, current algorithms also perform poor. Recently, non-local information is introduced to improve the quality of segmentation results, in which pixel relevance between pixels is crucial. In this paper, pixel relevance is measured based on Mahalanobis distance. More specifically, we consider the distribution of different samples and relevance interference between samples in the procedure of computing pixel relevance. Then, a new algorithm based on the novel pixel relevance is proposed, where non-local information can be incorporated into fuzzy clustering for image segmentation. The new algorithm can improve the robustness of corresponding algorithms greatly. Experiments on different noisy images show that the proposed algorithm can retrieve better results than conventional algorithms.","PeriodicalId":164016,"journal":{"name":"Int. J. Inf. Comput. Secur.","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127754221","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2018-05-03DOI: 10.1504/IJICS.2018.10012577
S. Rajendran, Manivannan Doraipandian
In recent technology development, images are playing a vital role in different applications such as social network, biometrics, medical, military and satellite fields. It is essential to protect these images from intruders during transmission on insecure networks. This paper proposes a new chaotic map for image cryptosystem by combining tent map and 2D logistic map in different form. The proposed 2D Logistic-Tent map (2DLT) generates two chaotic series. These chaotic series are used to perform the confusion and diffusion phases of image cryptosystem. A comparison between existing standard 2D logistic map and proposed 2D logistic-tent map shows that the proposed map has high random chaotic series than the existing one. In order to evaluate the strength of the proposed image cryptosystem, the developed chaos cryptosystem was subjected to different analysis such as differential, key size and sensitivity, chosen plain text and cipher text attack analyses. All the analysed results proved that the proposed cipher has good security level and can be used for different secure image communication applications.
{"title":"A nonlinear two dimensional logistic-tent map for secure image communication","authors":"S. Rajendran, Manivannan Doraipandian","doi":"10.1504/IJICS.2018.10012577","DOIUrl":"https://doi.org/10.1504/IJICS.2018.10012577","url":null,"abstract":"In recent technology development, images are playing a vital role in different applications such as social network, biometrics, medical, military and satellite fields. It is essential to protect these images from intruders during transmission on insecure networks. This paper proposes a new chaotic map for image cryptosystem by combining tent map and 2D logistic map in different form. The proposed 2D Logistic-Tent map (2DLT) generates two chaotic series. These chaotic series are used to perform the confusion and diffusion phases of image cryptosystem. A comparison between existing standard 2D logistic map and proposed 2D logistic-tent map shows that the proposed map has high random chaotic series than the existing one. In order to evaluate the strength of the proposed image cryptosystem, the developed chaos cryptosystem was subjected to different analysis such as differential, key size and sensitivity, chosen plain text and cipher text attack analyses. All the analysed results proved that the proposed cipher has good security level and can be used for different secure image communication applications.","PeriodicalId":164016,"journal":{"name":"Int. J. Inf. Comput. Secur.","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123244576","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：