• 제목/요약/키워드: Chebyshev chaotic map

검색결과 4건 처리시간 0.015초

카오스 시퀀스를 이용한 웨이브릿-기반 디지털 워터마크 (Wavelet-based Digital Watermarking with Chaotic Sequences)

  • 김유신;김민철;원치선;이재진
    • 한국통신학회논문지
    • /
    • 제25권1B호
    • /
    • pp.99-104
    • /
    • 2000
  • 본 논문은에서는 저작권 보호를 위한 디지털 워터마크 삽입방법에서 워터마크로 많이 사용하는 정규 가우시안 시퀀스를 카오스 시퀀스로 대체하고 그 성능을 비교하여 분석한다. 카오스 시퀀스는 만들기가 쉽고, 초기 치의 변화에 따라 전혀 다른 시퀀스를 만들 수 있다. 본 논문에서 사용한 카오스 시퀀스는 Chebyshev map의 시퀀스 분포를 갖도록 Logistic map을 수정하였다. 실험방법은 원 영상을 웨이브릿 변환하여 카오스 시퀀스와 가우시안 시퀀스로 워터마킹한 후 여러 가지 영상처리와, 반복적인 실험의 결과로 나타난 유사도의 분포를 측정, 비교하였다. DCT-기반 워터마킹 시스템의 결과와 마찬가지로 카오스 시퀀스는 일반적인 신호처리에 있어서 가우시안 시퀀스 못지 않게 강하다. 또한 연속적인 반복 실험에 의한 유사도 편차가 가우시안의 경우보다 작고, 손실 압축에 있어서는 가우시안 시퀀스 보다 좋은 성능을 보였다.

  • PDF

Image Encryption with The Cross Diffusion of Two Chaotic Maps

  • Jiao, Ge;Peng, Xiaojiang;Duan, Kaiwen
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권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.

Enhanced Mutual Authentication Scheme based on Chaotic Map for PCM in NFC Service Environment

  • Park, Sung-Wook;Lee, Im-Yeong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권2호
    • /
    • pp.1180-1200
    • /
    • 2017
  • Currently, automated payment services provide intuitive user interfaces by adapting various wireless communication devices with mobile services. For example, companies like Samsung, Google, and Apple have selected the NFC payment method to service payments of existing credit cards. An electronic payment standard has been released for NFC activation within Korea and will strengthen the safety of payment service communications. However, there are various security risks regarding the NFC-based electronic payment method. In particular, the NFC payment service using the recently released lightweight devices cannot provide the cryptographic strength that is supported by many financial transaction services. This is largely due to its computational complexity and large storage resource requirements. The chaotic map introduced in this study can generate a highly complicated code as it is sensitive to the initial conditions. As the lightweight study using the chaotic map has been actively carried out in recent years, associated authentication techniques of the lightweight environment have been released. If applied with a chaotic map, a high level of cryptographic strength can be achieved that can provide more functions than simple XOR operations or HASH functions. Further, this technique can be used by financial transaction services. This study proposes a mutual authentication technique for NFC-PCM to support an NFC payment service environment based on the chaotic map.

An efficient and anonymous Chaotic Map based authenticated key agreement for multi-server architecture

  • Irshad, Azeem;Ahmad, Hafiz Farooq;Alzahrani, Bander A.;Sher, Muhammad;Chaudhry, Shehzad Ashraf
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권12호
    • /
    • pp.5572-5595
    • /
    • 2016
  • Multi-server authentication enables the subscribers to enjoy an assortment of services from various service providers based on a single registration from any registration centre. Previously, a subscriber had to register from each service provider individually to avail respective services relying on single server authentication. In the past, a number of multi-server authentication techniques can be witnessed that employed lightweight and even computationally intensive cryptographic operations. In line with this, Zhu has presented a chaotic map based multi-server authentication scheme recently, which is not only vulnerable to denial-of-service attack, stolen-verifier attack, but also lacks anonymity. This research aims at improving the Zhu's protocol in terms of cost and efficiency. Moreover, the comparative study is presented for the performance of improved model against the existing scheme, and the security of proposed model is formally proved using BAN Logic.