• Journal of the Optical Society of Korea
• /
• 제20권2호
• /
• pp.228-233
• /
• 2016

In this paper, we propose a nonlinear maximum average correlation height (MACH) filter for information authentication of photon counting double random phase encryption (DRPE). To enhance the security of DRPE, photon counting imaging can be applied because of its sparseness. However, under severely photon-starved conditions, information authentication of DRPE may not be implemented successfully. To visualize the photon counting DRPE, a three-dimensional imaging technique such as integral imaging can be used. In addition, a nonlinear MACH filter can be utilized for helping the information authentication. Therefore, in this paper, we use integral imaging and nonlinear MACH filter to implement the information authentication of photon counting DRPE. To verify our method, we implement optical experiments and computer simulation.

• 한국멀티미디어학회논문지
• /
• 제25권8호
• /
• pp.983-990
• /
• 2022

In this paper, we implemented a hierarchical encryption system using two-step phase-shifting digital holography(PSDH) technology based on XOR and scramble operations. The proposed encryption system is a system that authenticates access through the issuance of an encryption key for access to individual laboratories, department offices, and universities. In the encryption process, we proposed a double encryption method using XOR and scramble operation with digital technology and two-step phase-shifting digital holography with optical technology. In the two-step PSDH process, an new method of determining the reference wave intensity without measuring it by using random common object image gererated from digital encryption process was also proposed. In the decryption process, the process is performed in the reverse order of encryption process. And only when the various key information used in the encryption process is correct, the encrypted information can be decrypted, so that the user can access the desired place. That is, there is a feature that can hierarchically control the space that can be accessed according to the type of key issued in the proposed encryption system. Through the computer simulation, the feasibility of the proposed hierarchical encryption system was confirmed.

• 한국산업정보학회논문지
• /
• 제23권4호
• /
• pp.13-22
• /
• 2018

본 논문에서는 스크램블 연산(Scramble Operation) 및 위상 천이 디지털 홀로그래피(PSDH; Phase Shift Digital Holography) 기반 영상 이중 암호화 방법을 제안한다. 암호화하고자 하는 영상을 스크램블 연산을 통해 디지털적으로 1차 암호화를 수행한 후, 위상 변조하고, 위상을 천이시킨 기준파와의 간섭을 통해 2차 암호화 정보를 얻는다. 복호화 과정은 암호화 과정의 역순으로 진행된다. 두 개의 암호화된 영상들을 적절하게 산술 처리하는 위상 천이 디지털 홀로그래피 기술을 통해 디지털적으로 1차 복호화하고, 위상 복조를 한 후, 스크램블 연산 시에 사용한 암호화 키 정보를 이용하여 원래의 영상을 복원한다. 제안된 암호화 방법은 스크램블 연산에 사용된 두 개의 키 정보와 위상 천이 디지털홀로그래피 기술에서 사용된 거리 정보, 광원의 파장 등의 정보를 모두 정확하게 알아야만 원래의 영상을 복원할 수 있다.

• Journal of the Optical Society of Korea
• /
• 제19권3호
• /
• pp.241-247
• /
• 2015

The double-random phase encryption (DRPE) algorithm is a robust technique for image encryption, due to its high speed and encoding a primary image to stationary white noise. Recently it was reported that DRPE in the Fresnel domain can achieve a better avalanche effect than that in Fourier domain, which means DRPE in the Fresnel domain is much safer, to some extent. Consequently, a method based on DRPE in the Fresnel domain would be a good choice. In this paper we present an image-authentication method which uses only partial phase information from a double-random-phase-encrypted image in the Fresnel domain. In this method, only part of the phase information of an image encrypted with DRPE in the Fresnel domain needs to be kept, while other information like amplitude values can be eliminated. Then, with the correct phase keys (we do not consider wavelength and distance as keys here) and a nonlinear correlation algorithm, the encrypted image can be authenticated. Experimental results demonstrate that the encrypted images can be successfully authenticated with this partial phase plus nonlinear correlation technique.

• Current Optics and Photonics
• /
• 제6권6호
• /
• pp.565-575
• /
• 2022

In this paper, we propose a non-fungible token (NFT) transaction method that can commercialize the real 3D property and make property sharing possible using the 3D reconstruction technique. In addition, our proposed method enhances the security of NFT copyright and metadata by using optical encryption. In general, a conventional NFT is used for 2D image proprietorial rights. To expand the scope of the use of tokens, many cryptocurrency industries are currently trying to apply tokens to real three-dimensional (3D) property. However, many token markets have an art copyright problem. Many tokens have been minted without considering copyrights. Therefore, tokenizing real property can cause significant social issues. In addition, there are not enough methods to mint 3D real property for NFT commercialization and sharing property tokens. Therefore, we propose a new token management technique to solve these problems using integral imaging and double random phase encryption. To show our system, we conduct a private NFT market using a test blockchain network that can demonstrate the whole NFT transaction process.

• Current Optics and Photonics
• /
• 제2권6호
• /
• pp.540-546
• /
• 2018

We propose an implementation scheme for an optical encryption system with hybrid-pattern random keys. In the encryption process, a pair of random phase keys composed of a white-noise phase key and a structured phase key are positioned in the input plane and Fourier-spectrum plane respectively. The output image is recoverable by digital reconstruction, using the conjugate of the encryption key in the Fourier-spectrum plane. We discuss the system encryption performance when different combinations of phase-key pairs are used. To measure the effectiveness of the proposed method, we calculate the statistical indicators between original and encrypted images. The results are compared to those generated from a classical double random phase encoding. Computer simulations are presented to show the validity of the method.

• 한국산업정보학회논문지
• /
• 제22권4호
• /
• pp.1-9
• /
• 2017

본 논문에서는 위상 천이 디지털 홀로그래피(PSDH; Phase-Shifting Digital Holography) 및 디지털 워터마킹(Digital Watermarking) 기반 디지털 홀로그램의 이중 암호화 기술을 제안한다. 이를 위해 먼저 디지털 워터마크에 사용할 로고 영상을 정하고, 이 영상에 대한 이진 위상 컴퓨터형성 홀로그램(CGH; Computer Generated Hologram)을 반복 알고리즘을 이용하여 설계한다. 그리고 랜덤하게 발생시킨 이진 위상 마스크를 워터마크로 정하고, 설계된 이진 위상 CGH와 XOR 논리연산을 통해 워터마크 정보에 대한 키 영상을 생성한다. 그리고 물체 영상을 위상 변조하여 세기가 일정한 함수로 만든 후, 워터마크인 랜덤하게 발생시킨 이진 위상 마스크를 곱하여 물체파를 생성한다. 이 물체파는 워터마크 정보가 포함된 잡음과 유사한 패턴을 가지는 1차 암호화된 영상이라고 할 수 있다. 이를 2-단계 PSDH기술을 적용하여 기준파와 간섭을 시키면 가시성이 향상된 최종 간섭무늬를 얻는다. 이 간섭패턴이 최종적으로 구하고자 하는 물체 영상의 2차 암호화된 영상이 된다. 암호화된 영상의 복호화는 2-단계 PSDH기술을 통한 암호화된 영상들을 이용하여 적절한 산술연산 처리한 후, 프레즈넬 변환 및 1차 암호화 과정의 역순으로 진행하면 된다. 제안된 방법의 암호화 및 복호화 기술은 컴퓨터 시뮬레이션을 통하여 검증된다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권5호
• /
• pp.1611-1633
• /
• 2022

At EUROCRYPT 2019, a new block cipher algorithm called BISON was proposed by Canteaut et al. which uses a novel structure named as Whitened Swap-Or-Not (WSN). Unlike the traditional wide trail strategy, the differential and linear properties of this algorithm can be easily determined. However, the encryption speed of the BISON algorithm is quite low due to a large number of iterative rounds needed to ensure certain security margins. Commonly, denoting by n is the data block length, this design requires 3n encryption rounds. Moreover, the block size n of BISON is always odd, which is not convenient for operations performed on a byte level. In order to overcome these issues, we propose a new block cipher, named DBISON, which more efficiently employs the ideas of double layers typical to the BISON-like construction. More precisely, DBISON divides the input into two parts of size n/2 bits and performs the round computations in parallel, which leads to an increased encryption speed. In particular, the data block length n of DBISON can be even, which gives certain additional implementation benefits over BISON. Furthermore, the resistance of DBISON against differential and linear attacks is also investigated. It is shown the maximal differential probability (MDP) is 1/2^n-1 for n encryption rounds and that the maximal linear probability (MLP) is strictly less than 1/2^n-1 when (n/2+3) iterative encryption rounds are used. These estimates are very close to the ideal values when n is close to 256.

• 한국군사과학기술학회지
• /
• 제12권5호
• /
• pp.609-614
• /
• 2009

In this paper, we have proposed a design for security network system passing through the non-security network which is commonly used for various networking services. Based on the security requirements which are assumed that the large classified data are bi-transmitted between a server and several terminals remotely located, some application methods of security techniques are suggested such as the network separation technique, the scale-down application technique of certification management system based on the PKI(Public Key Infrastructure), the double encryption application using the crypto-equipment and the asymmetric keys encryption algorithm, unrecoverable data deleting technique and system access control using USB device. It is expected that the application of this design technique for the security network causes to increase the efficiency of the existing network facilities and reduce the cost for developing and maintaining of new and traditional network security systems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권9호
• /
• pp.3087-3103
• /
• 2022

Nearest neighbor query in location-based services has become a popular application. Aiming at the shortcomings of the privacy protection algorithms of traditional ciphertext nearest neighbor query having the high system overhead because of the usage of the double Hilbert curves and having the inaccurate query results in some special circumstances, a privacy protection algorithm of ciphertext nearest neighbor query which is based on the single Hilbert curve has been proposed. This algorithm uses a single Hilbert curve to transform the two-dimensional coordinates of the points of interest into Hilbert values, and then encrypts them by the order preserving encryption scheme to obtain the one-dimensional ciphertext data which can be compared in numerical size. Then stores the points of interest as elements composed of index value and the ciphertext of the other information about the points of interest on the server-side database. When the user needs to use the nearest neighbor query, firstly calls the approximate nearest neighbor query algorithm proposed in this paper to query on the server-side database, and then obtains the approximate nearest neighbor query results. After that, the accurate nearest neighbor query result can be obtained by calling the precision processing algorithm proposed in this paper. The experimental results show that this privacy protection algorithm of ciphertext nearest neighbor query which is based on the single Hilbert curve is not only feasible, but also optimizes the system overhead and the accuracy of ciphertext nearest neighbor query result.