Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of the Optical Society of Korea

Optical Secret Key Sharing Method Based on Diffie-Hellman Key Exchange Algorithm

Seok Hee Jeon, Sang Keun Gil

Published Oct 25, 2014• 9 citations
Publisher

Abstract

In this paper, we propose a new optical secret key sharing method based on the Diffie-Hellman key exchange protocol required in cipher system. The proposed method is optically implemented by using a free-space interconnected optical logic gate technique in order to process XOR logic operations in parallel. Also, we present a compact type of optical module which can perform the modified Diffie-Hellman key exchange for a cryptographic system. Schematically, the proposed optical configuration has an advantage of producing an open public key and a shared secret key simultaneously. Another advantage is that our proposed key exchange system uses a similarity to double key encryption techniques to enhance security strength. This can provide a higher security cryptosystem than the conventional Diffie-Hellman key exchange protocol due to the complexity of the shared secret key. Results of numerical simulation are presented to verify the proposed method and show the effectiveness in the modified Diffie-Hellman key exchange system.

DOI
10.3807/josk.2014.18.5.477

Related papers

Optical Implementation of Asymmetric Cryptosystem Combined with D-H Secret Key Sharing and Triple DES

Seok Hee Jeon, Sang Keun Gil

In this paper, an optical implementation of a novel asymmetrical cryptosystem combined with D-H secret key sharing and triple DES is proposed. The proposed optical cryptosystem is realized by performing free-space interconnected optical logic operations such as AND, OR and XOR which are implemented in Mach-Zehnder type interferometer architecture. The advantage of the proposed optical architecture provides dual outputs simultaneously, and the encryption optical setup can be used as decryption optical setup only by changing the inputs of SLMs. The proposed cryptosystem can provide higher security strength than the conventional electronic algorithm, because the proposed method uses 2-D array data, which can increase the key length surprisingly and uses 3DES algorithm, which protects against “meet in the middle” attacks. Another advantage of the proposed asymmetrical cryptosystem is that it is free to change the user’s two private random numbers in generating the public keys at any time. Numerical simulation and performance analysis verify that the proposed asymmetric cryptosystem is effective and robust against attacks for the asymmetrical cipher system.

Journal of the Optical Society of Korea•Dec 25, 2015•4 citations

Optical Implementation of Triple DES Algorithm Based on Dual XOR Logic Operations

Seok Hee Jeon, Sang Keun Gil

In this paper, we propose a novel optical implementation of a 3DES algorithm based on dual XOR logic operations for a cryptographic system. In the schematic architecture, the optical 3DES system consists of dual XOR logic operations, where XOR logic operation is implemented by using a free-space interconnected optical logic gate method. The main point in the proposed 3DES method is to make a higher secure cryptosystem, which is acquired by encrypting an individual private key separately, and this encrypted private key is used to decrypt the plain text from the cipher text. Schematically, the proposed optical configuration of this cryptosystem can be used for the decryption process as well. The major advantage of this optical method is that vast 2-D data can be processed in parallel very quickly regardless of data size. The proposed scheme can be applied to watermark authentication and can also be applied to the OTP encryption if every different private key is created and used for encryption only once. When a security key has data of $512{\times}256$ pixels in size, our proposed method performs 2,048 DES blocks or 1,024 3DES blocks cipher in this paper. Besides, because the key length is equal to $512{\times}256$ bits, $2^{512{\times}256}$ attempts are required to find the correct key. Numerical simulations show the results to be carried out encryption and decryption successfully with the proposed 3DES algorithm.

Journal of the Optical Society of Korea•Oct 25, 2013•7 citations

Secret key sharing schemes in optical cryptosystems based on double random phase encoding

Inkyu Moon, You-Hyun Kim

This paper overviews new secret key sharing schemes which can be useful in optical cryptosystems based on double random phase encoding. These key sharing schemes, which are complex waveform versions of the Diffie-Hellman (DH) key exchange, allow us to establish the shared secret key in the Fourier optics-based cryptosystems. We show that the presented schemes can also be applied to cryptosystems in which multiple users can share a secret key securely.

SPIE Three-Dimensional Imaging, Visualization, and Display•Apr 22, 2020•0 citations

Fractional Fourier transform based key exchange for optical asymmetric key cryptography

Aloka Sinha

Recently several optical encryption techniques have been proposed for two-dimensional data. These techniques use random phase masks, jigsaw transforms, digital signatures, and linear transforms like the Fourier transforms, the fractional Fourier transform and the Fresnel transform. The strength of these encryption techniques is dependent on the size of the key but is strongly limited by the security linked with the exchange of the secret key. We propose a new technique, based on the Diffie-Hellman protocol, in which the key can be exchanged with high security. The Diffie-Hellman protocol allows two users to exchange a secret key over an insecure channel without any prior secrets. Fractional Fourier transforms have been used for the secure key transfer. Results of computer simulation are presented to verify the proposed idea and analyse the robustness of the proposed technique.

WSEAS Transactions on Computers archive•Feb 1, 2008•2 citations

Secure Random Phase Key Exchange Schemes for Image Cryptography

You-Hyun Kim, Minwoo Sim, Inkyu Moon +1 more

We propose novel random phase key exchange schemes for image cryptography, which are complex sinusoidal waveform versions of the Diffie-Hellman (DH) key exchange algorithm. We demonstrate that the proposed schemes can be particularly helpful to establish a shared secret key in Fourier optics-based image cryptosystems since the problem of symmetric secret key establishment is one of the fundamental difficulties in Fourier optics-based image cryptography. We also propose a ring-type key exchange system in which multiple users can securely share a secret key, which is an extension of the key exchange scheme for two users. The schemes are verified by numerical simulations.

IEEE Internet of Things Journal•Sep 18, 2019•12 citations

An Efficient and Provable Secret Shared Key Computation for Cryptographic Protocol Across Insecure Channel

Ndibanje Bruce, Hyunho Kim, Suhyun Park +1 more

Data exchange over public network requires for the most part an important security mechanism enabling to both sender and receiver the property that they can mutual authenticate using different identification parameters playing the vital role of secret shared key computation. Based on the decisional Diffie-Hellman assumptions, this paper presents a cryptographic calculation of the shared secret key enabling mutual authentication and confidentiality services over public, insecure networks. This protocol is efficient than "classical" Diffe-Hellman key exchange which provides no authentication at all and suffer from man-in-the-middle attack. To attain this, we first model the scheme with mathematical concept for exponential calculation using entity parameters and finally we simulate the work by Scyther tool to verify the provability of the sameness 'shared secret value. With the standards cryptographic assumptions, the simulation result reveals that the protocol is practical and provably-secure. Thus, the proposed cryptographic protocol is awfully, straightforward, valuable, and resilient to know attacks.

International Conference on Advanced Information Networking and Applications (AINA)•Mar 1, 2015•0 citations
In this paper, we propose a new optical secret key sharing method based on the Diffie-Hellman key exchange protocol required in cipher system. The proposed method is optically implemented by using a free-space interconnected optical logic gate technique in order to process XOR logic operations in parallel. Also, we present a compact type of optical module which can perform the modified Diffie-Hellman key exchange for a cryptographic system. Schematically, the proposed optical configuration has an advantage of producing an open public key and a shared secret key simultaneously. Another advantage is that our proposed key exchange system uses a similarity to double key encryption techniques to enhance security strength. This can provide a higher security cryptosystem than the conventional Diffie-Hellman key exchange protocol due to the complexity of the shared secret key. Results of numerical simulation are presented to verify the proposed method and show the effectiveness in the modified Diffie-Hellman key exchange system.
In this paper, an optical implementation of a novel asymmetrical cryptosystem combined with D-H secret key sharing and triple DES is proposed. The proposed optical cryptosystem is realized by performing free-space interconnected optical logic operations such as AND, OR and XOR which are implemented in Mach-Zehnder type interferometer architecture. The advantage of the proposed optical architecture provides dual outputs simultaneously, and the encryption optical setup can be used as decryption optical setup only by changing the inputs of SLMs. The proposed cryptosystem can provide higher security strength than the conventional electronic algorithm, because the proposed method uses 2-D array data, which can increase the key length surprisingly and uses 3DES algorithm, which protects against “meet in the middle” attacks. Another advantage of the proposed asymmetrical cryptosystem is that it is free to change the user’s two private random numbers in generating the public keys at any time. Numerical simulation and performance analysis verify that the proposed asymmetric cryptosystem is effective and robust against attacks for the asymmetrical cipher system.
In this paper, we propose a novel optical implementation of a 3DES algorithm based on dual XOR logic operations for a cryptographic system. In the schematic architecture, the optical 3DES system consists of dual XOR logic operations, where XOR logic operation is implemented by using a free-space interconnected optical logic gate method. The main point in the proposed 3DES method is to make a higher secure cryptosystem, which is acquired by encrypting an individual private key separately, and this encrypted private key is used to decrypt the plain text from the cipher text. Schematically, the proposed optical configuration of this cryptosystem can be used for the decryption process as well. The major advantage of this optical method is that vast 2-D data can be processed in parallel very quickly regardless of data size. The proposed scheme can be applied to watermark authentication and can also be applied to the OTP encryption if every different private key is created and used for encryption only once. When a security key has data of 512×256512{\times}256512×256 pixels in size, our proposed method performs 2,048 DES blocks or 1,024 3DES blocks cipher in this paper. Besides, because the key length is equal to 512×256512{\times}256512×256 bits, 2512×2562^{512{\times}256}2512×256 attempts are required to find the correct key. Numerical simulations show the results to be carried out encryption and decryption successfully with the proposed 3DES algorithm.
Recently several optical encryption techniques have been proposed for two-dimensional data. These techniques use random phase masks, jigsaw transforms, digital signatures, and linear transforms like the Fourier transforms, the fractional Fourier transform and the Fresnel transform. The strength of these encryption techniques is dependent on the size of the key but is strongly limited by the security linked with the exchange of the secret key. We propose a new technique, based on the Diffie-Hellman protocol, in which the key can be exchanged with high security. The Diffie-Hellman protocol allows two users to exchange a secret key over an insecure channel without any prior secrets. Fractional Fourier transforms have been used for the secure key transfer. Results of computer simulation are presented to verify the proposed idea and analyse the robustness of the proposed technique.
We propose novel random phase key exchange schemes for image cryptography, which are complex sinusoidal waveform versions of the Diffie-Hellman (DH) key exchange algorithm. We demonstrate that the proposed schemes can be particularly helpful to establish a shared secret key in Fourier optics-based image cryptosystems since the problem of symmetric secret key establishment is one of the fundamental difficulties in Fourier optics-based image cryptography. We also propose a ring-type key exchange system in which multiple users can securely share a secret key, which is an extension of the key exchange scheme for two users. The schemes are verified by numerical simulations.
Data exchange over public network requires for the most part an important security mechanism enabling to both sender and receiver the property that they can mutual authenticate using different identification parameters playing the vital role of secret shared key computation. Based on the decisional Diffie-Hellman assumptions, this paper presents a cryptographic calculation of the shared secret key enabling mutual authentication and confidentiality services over public, insecure networks. This protocol is efficient than "classical" Diffe-Hellman key exchange which provides no authentication at all and suffer from man-in-the-middle attack. To attain this, we first model the scheme with mathematical concept for exponential calculation using entity parameters and finally we simulate the work by Scyther tool to verify the provability of the sameness 'shared secret value. With the standards cryptographic assumptions, the simulation result reveals that the protocol is practical and provably-secure. Thus, the proposed cryptographic protocol is awfully, straightforward, valuable, and resilient to know attacks.