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

Fluctuation and Noise Letters

NON-BREAKABLE DATA ENCRYPTION WITH CLASSICAL INFORMATION

László B. Kish, SWAMINATHAN SETHURAMAN

Published Jun 1, 2004• 9 citations
Publisher

Abstract

Secure encryption of data is one of the most important parts of information technology and major concern of data security, military, defense and homeland security applications. The main aim of the paper is to propose a new way of approach to encryption. We propose a new possible approach [1] to encryption, which could be a fast, simple, inexpensive, robust, flexible, and mobile way of data encryption for absolutely secure data transmission by using classical digital information. The Eavesdropper is allowed to know the received signal thus the method has a higher level of protection than that of quantum encryption. Factorization algorithms do not help to break the code. Proper scrambling operators, which are necessary for the method, are study of current research.

DOI
10.1142/s0219477504001987

Related papers

An Exploration to the Quantum Cryptography Technology

Harshita Jasoliya, Kaushal Arvindbhai Shah

The security of our data is the prime priority as it is said “Data is the new Oil”. Nowadays, most of our communications are either recorded or forged. There are algorithms used under classical encryption, such as Rivest-Shamir-Adleman (RSA), digital signature, elliptic-curve cryptography (ECC), and more, to protect our communication and data. However, these algorithms are breakable with the help of Quantum Cryptography. In addition, this technology provides the most secure form of communication between entities under the fundamental law of Physics. Here, we are abiding to discuss the term “Quantum Cryptography.” The aim of this paper is to explore the knowledge related to the Quantum Cryptography, Quantum Key Distribution; and their elements, implementation, and the latest research. Moreover, exploration of the loopholes and the security of Internet of Things (IoT) infrastructure and current used classical cryptographic algorithms are described in the paper.

International Conference on Computing for Sustainable Global Development•Mar 23, 2022•15 citations

A Secure Method of Communication in Conventional Cryptography using Quantum Key Distribution

Chunduru Anilkumar, Bhavani Gorle, Kinthali Sowmya

Security knowledge is one of the foremost challenges in the present day. When the topic is about Information security, the concept of cryptography comes into the picture. Every day, people and organizations use cryptography to maintain the confidentiality of their communications and data as well as to preserve their privacy. Today, one of the most successful methods used by businesses to protect their storage systems, whether at rest or in transit, is cryptography. Yet, cryptography is an effective technique to secure the data, the modern technology can break the cryptographic techniques. But some data encryption algorithms are several times stronger than today's conventional cryptography and can be constructed using quantum computing. They are "Quantum Cryptographic Algorithms ". Quantum cryptography uses the rules of quantum physics instead of classical encryption, which is based on mathematics, to protect and transmit data in a way that cannot be intercepted. Quantum key distribution is the greatest illustration of quantum cryptography and offers a safe solution to the key exchange issue. The proposed work deals with quantum cryptography and mainly focuses on how the quantum cryptographic algorithm is more secure than traditional cryptography.

Applied and Computational Engineering•Jul 31, 2023•1 citation

QUANTUM COMPUTING IN DATA ENCRYPTION: THE NEXT FRONTIER FOR SECURE DIGITAL COMMUNICATION

L. (Luis) Rodriguez

As the world becomes increasingly interconnected, the demand for secure digital communication is more crucial than ever. Traditional cryptographic techniques, such as RSA and AES, have long been the backbone of secure data encryption. However, with the advent of quantum computing, the future of cryptography is undergoing a fundamental shift. Quantum computers have the potential to break widely used encryption schemes, posing a significant challenge to cybersecurity. This paper explores the role of quantum computing in the field of data encryption, analyzing both the risks posed by quantum computing to current cryptographic methods and the emerging quantum-resistant algorithms. The paper also examines the concept of quantum key distribution (QKD) and its potential to revolutionize secure communication. By discussing the progress of quantum computing and quantum cryptography, this paper aims to provide a comprehensive understanding of how quantum technologies are set to impact the future of secure digital communication.

Modern American Journal of Engineering, Technology, and Innovation•Apr 11, 2025•0 citations

基于量子纠缠的自适应信息加密

Jincheng Zhang

This paper presents a novel information encryption scheme predicated on the principles of quantum entanglement. The proposed algorithm leverages the unique properties of quantum entanglement to establish a fundamentally more secure key exchange and data transmission process than currently employed methods. We explore how entanglement can be harnessed to create a cryptographic system that is inherently resistant to eavesdropping and manipulation. The core mechanism centers around generating and managing entangled states, which are then manipulated to generate encryption keys and secure transmissions. This research investigates the potential of quantum entanglement to revolutionize information security by offering a robust and potentially unbreakable method of data protection. The study concludes with a detailed analysis of the algorithm's security properties and potential applications within the broader context of data security.

•Sep 6, 2026•0 citations

Optical Encryption Techniques for Color Image and Hyperspectral Data

Hang Chen

Optical information security is one of the most important research directions in information science and technology, especially in the field of copyright protection, confidential information transmission/storage and military remote sensing. Since double random phase encoding technology (DRPE) was proposed, optical image encryption technology has become the main topic of optical information security and it has been developed and studied deeply. Optical encryption techniques offer the possibility of high-speed parallel processing of two dimension image data and hiding information in many different dimensions. In this context, much significant research and investigation on optical image encryption have been presented based on DRPE or further optical operation, such as digital holography, Fresnel transform, gyrator transform. Simultaneously, the encrypted image has been extended from single gray image to double image, color image and multi-image. However, the hyperspectral image, as a significant element in military and commercial remote sensing, has not been deeply researched in optical encryption area until now. This work extends the optical encryption technology from color image to hyperspectral image. For better comprehension of hyperspectral image encryption, this work begins with the introduction and analysis of the characteristics of hyperspectral cube. Subsequently, several kinds of encryption schemes for color image, including symmetric and asymmetric cryptosystem, are presented individually. Furthermore, the optical encryption algorithms for hyperspectral cube are designed for securing both the spatial and spectral information simultaneously. Some numerical simulations are given to validate the performance of the proposed encryption schemes. The corresponding attack experiment results demonstrate the capability and robustness of the approaches designed in this work. The research in this dissertation provides reference for the further practicality of hyperspectral image encryption

•Dec 11, 2017•1 citation

Non Breakable Data Encryption With Classical Information?

László B. Kish

With the Kish‐Sethuraman (KS) cipher an attempt was made, by using special operators and communication, to reach absolutely secure classical communication. First the message is bounced back with additional encryption by the Receiver and then the original encryption is removed and the message is resent by the Sender. The mechanical analogy of this operation is using two padlocks; one by the Sender and one by the Receiver. Klappenecker has pointed out that finding an efficient software realization of the operators is equivalent of proving the P ≠ NP problem. Various open problems are discussed.

AIP conference proceedings•Jan 1, 2005•3 citations
Secure encryption of data is one of the most important parts of information technology and major concern of data security, military, defense and homeland security applications. The main aim of the paper is to propose a new way of approach to encryption. We propose a new possible approach [1] to encryption, which could be a fast, simple, inexpensive, robust, flexible, and mobile way of data encryption for absolutely secure data transmission by using classical digital information. The Eavesdropper is allowed to know the received signal thus the method has a higher level of protection than that of quantum encryption. Factorization algorithms do not help to break the code. Proper scrambling operators, which are necessary for the method, are study of current research.
The security of our data is the prime priority as it is said “Data is the new Oil”. Nowadays, most of our communications are either recorded or forged. There are algorithms used under classical encryption, such as Rivest-Shamir-Adleman (RSA), digital signature, elliptic-curve cryptography (ECC), and more, to protect our communication and data. However, these algorithms are breakable with the help of Quantum Cryptography. In addition, this technology provides the most secure form of communication between entities under the fundamental law of Physics. Here, we are abiding to discuss the term “Quantum Cryptography.” The aim of this paper is to explore the knowledge related to the Quantum Cryptography, Quantum Key Distribution; and their elements, implementation, and the latest research. Moreover, exploration of the loopholes and the security of Internet of Things (IoT) infrastructure and current used classical cryptographic algorithms are described in the paper.
Security knowledge is one of the foremost challenges in the present day. When the topic is about Information security, the concept of cryptography comes into the picture. Every day, people and organizations use cryptography to maintain the confidentiality of their communications and data as well as to preserve their privacy. Today, one of the most successful methods used by businesses to protect their storage systems, whether at rest or in transit, is cryptography. Yet, cryptography is an effective technique to secure the data, the modern technology can break the cryptographic techniques. But some data encryption algorithms are several times stronger than today's conventional cryptography and can be constructed using quantum computing. They are "Quantum Cryptographic Algorithms ". Quantum cryptography uses the rules of quantum physics instead of classical encryption, which is based on mathematics, to protect and transmit data in a way that cannot be intercepted. Quantum key distribution is the greatest illustration of quantum cryptography and offers a safe solution to the key exchange issue. The proposed work deals with quantum cryptography and mainly focuses on how the quantum cryptographic algorithm is more secure than traditional cryptography.
As the world becomes increasingly interconnected, the demand for secure digital communication is more crucial than ever. Traditional cryptographic techniques, such as RSA and AES, have long been the backbone of secure data encryption. However, with the advent of quantum computing, the future of cryptography is undergoing a fundamental shift. Quantum computers have the potential to break widely used encryption schemes, posing a significant challenge to cybersecurity. This paper explores the role of quantum computing in the field of data encryption, analyzing both the risks posed by quantum computing to current cryptographic methods and the emerging quantum-resistant algorithms. The paper also examines the concept of quantum key distribution (QKD) and its potential to revolutionize secure communication. By discussing the progress of quantum computing and quantum cryptography, this paper aims to provide a comprehensive understanding of how quantum technologies are set to impact the future of secure digital communication.
This paper presents a novel information encryption scheme predicated on the principles of quantum entanglement. The proposed algorithm leverages the unique properties of quantum entanglement to establish a fundamentally more secure key exchange and data transmission process than currently employed methods. We explore how entanglement can be harnessed to create a cryptographic system that is inherently resistant to eavesdropping and manipulation. The core mechanism centers around generating and managing entangled states, which are then manipulated to generate encryption keys and secure transmissions. This research investigates the potential of quantum entanglement to revolutionize information security by offering a robust and potentially unbreakable method of data protection. The study concludes with a detailed analysis of the algorithm's security properties and potential applications within the broader context of data security.
Optical information security is one of the most important research directions in information science and technology, especially in the field of copyright protection, confidential information transmission/storage and military remote sensing. Since double random phase encoding technology (DRPE) was proposed, optical image encryption technology has become the main topic of optical information security and it has been developed and studied deeply. Optical encryption techniques offer the possibility of high-speed parallel processing of two dimension image data and hiding information in many different dimensions. In this context, much significant research and investigation on optical image encryption have been presented based on DRPE or further optical operation, such as digital holography, Fresnel transform, gyrator transform. Simultaneously, the encrypted image has been extended from single gray image to double image, color image and multi-image. However, the hyperspectral image, as a significant element in military and commercial remote sensing, has not been deeply researched in optical encryption area until now. This work extends the optical encryption technology from color image to hyperspectral image. For better comprehension of hyperspectral image encryption, this work begins with the introduction and analysis of the characteristics of hyperspectral cube. Subsequently, several kinds of encryption schemes for color image, including symmetric and asymmetric cryptosystem, are presented individually. Furthermore, the optical encryption algorithms for hyperspectral cube are designed for securing both the spatial and spectral information simultaneously. Some numerical simulations are given to validate the performance of the proposed encryption schemes. The corresponding attack experiment results demonstrate the capability and robustness of the approaches designed in this work. The research in this dissertation provides reference for the further practicality of hyperspectral image encryption
With the Kish‐Sethuraman (KS) cipher an attempt was made, by using special operators and communication, to reach absolutely secure classical communication. First the message is bounced back with additional encryption by the Receiver and then the original encryption is removed and the message is resent by the Sender. The mechanical analogy of this operation is using two padlocks; one by the Sender and one by the Receiver. Klappenecker has pointed out that finding an efficient software realization of the operators is equivalent of proving the P ≠ NP problem. Various open problems are discussed.