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

Explaining Basic Aspects of Quantum Computation Based on Functional Approach

Marcos B. Cardoso, Eduarda Monteiro, Felipe Camargo Munhoz, Renata Reiser, Juliana Kaizer Vizzotto, Rosyelma Pinheiro Costa

Published Jan 1, 2006• 0 citations
OpenAlex

Abstract

The aim of this paper is to obtain an inter-pretation of foundations of the quantum compu-tation under the light of the level of functional abstraction [1] and supported by its mathemat-ical basis. This approach seems more accessi-ble to programmers and increases the study and interest in quantum programming. The neces-sity for secret message exchange and the possi-bility of reading secret information have devel-oped cryptographic methods. The security of current methods is based on hard computational problems enabling a good safety level. However, if there is a marked growth in computational power, leaks in the safety system of the crypto-

Related papers

A comprehensive survey for cryptography implementation using quantum computing

Zainab Salih Ageed, Subhi R. M. Zeebaree, Rowaida Khalil Ibrahim

Information is divided into two types: classical and quantum. Quantum computing, quantum cryptography, and quantum teleportation are just a few of the miracles they can do when working together. Some of the uses range from assisting in the prevention of spies reading private messages to assisting in the prevention of spies reading private communications. Quantum purification and quantum error correction are examples of techniques that will make their implementation easier. Although some of these concepts are still beyond present technological capabilities, quantum cryptography has been established. The possibilities for small-scale quantum computer device prototypes by the end of the millennium are promising. This paper is focusing on addressing the depended approaches which deal with implementation cryptography based on quantumcomputing. Remembering that cryptography is a method of encryption that uses the naturally occurring propertiesof quantum mechanics to secure and transmit data in a way that cannot be hacked. Cryptography is the process ofencrypting and protecting data so that only the person who has the right secret key can decrypt it. For decades now, quantum computing has been hailed as one of the next big revolutions. Quantum computing is not just fasterthan traditional computing methods, but a fundamentally different approach to solve seemingly intractable problems. The mathematical operations that most traditional cryptographic algorithms rely on could be cracked with a sufficiently strong quantum computer. This paper aims to explain how quantum computing affects currentcryptography and expose readers to fundamental post-quantum methods. Quantum computing’s influence on IT professionals is becoming increasingly important. As a result, we provide a straightforward introduction to post-quantum cryptography, including quantum-resistant algorithms and quantum key distribution.

AIP conference proceedings•Jan 1, 2024•2 citations

Quantum Cryptography: an Overview from Physics Foundations to Engineering Development

Alfonso Tello Castillo

Quantum cryptography is a relatively new field (which began to be developed in 1984), which seems to be taking its last steps to become commercially available, thus becoming the first directly quantum technology to do so. The motivation behind it is not small, since it will allow coding a message in an absolutely secure and illegible way, due to the laws of quantum mechanics, and independently of the power of any computer, even a quantum one. In what seems like a not-too-distant future, engineers who understand and are able to work with such systems will be needed. Therefore, this Master’s Thesis aims to give an introduction to the current development of the field, from the physical concepts that underlie it, to the state of the art of the technology. The text is intended for people with a background in Electrical Engineering, and little or no knowledge of quantum mechanics. However, other readers with a background in engineering or physics will also be able to take advantage of it. After reading it, the reader will be able to have a good starting point in the field, from which to continue developing their work.

•Jan 1, 2019•0 citations

Post-Quantum Cryptography Beyond Computational Security

T. Attema, Nicole Gervasoni, M.J.H. Marcus +1 more

The advent of a full-scale quantum computer will severely impact most currently-used cryptographic systems.The most well-known aspect of this impact lies in the computational-hardness assumptions that underpin the security of most current public-key cryptographic systems: a quantum computer can factor integers and compute discrete logarithms in polynomial time, thereby breaking systems based on these problems.However, simply replacing these problems by other which are (believed to be) impervious even to a quantum computer does not completely solve the issue.Indeed, many security proofs of cryptographic systems are no longer valid in the presence of a quantum-capable attacker; while this does not automatically implies that the affected systems would be broken by a quantum computer, it does raises questions on the exact security guarantees that they can provide.This overview document aims to analyze all aspects of the impact of quantum computers on cryptographic, by providing an overview of current quantum-hard computational problems (and cryptographic systems based on them), and by presenting the security proofs that are affected by quantum-attackers, detailing what is the current status of research on the topic and what the expected effects on security are.

•Jan 1, 2021•0 citations

Ontological Cryptography and State-Based Security Architectures

Sergey Borisovich Zeksel

This document introduces a new class of cryptographic and security systems based on ontological states, invariants, endogenous time, and internal reality operators. The described architectures replace informational secrets with state-dependent invariants and irreversible contextual operators. This work defines a new security paradigm independent of computational hardness assumptions. We are standing on the threshold of a major rupture in data security and digital infrastructure. In the coming years, something that until recently seemed theoretical will become reality:modern encryption methods will cease to be reliable.The reason is the rapid progress of quantum computing and the overall growth of computational power.The algorithms on which today’s messengers, banks, electronic signatures, government registries, and the entire system of digital trust are built were originally designed in an era when such capabilities were unattainable. This implies several very unpleasant consequences. First, everything that is encrypted today can already be intercepted and stockpiled “for later.”Within 5–15 years, such archives will be decryptable at scale.This applies to personal correspondence, medical records, commercial secrets, financial transactions, diplomatic documents, and government databases. Second, the very foundation of trust in the digital world will be undermined.Electronic signatures, TLS certificates, blockchains, banking protocols, and identity systems all rely on the same fragile mathematical basis.When it collapses, it will no longer be possible to reliably prove who sent a message, who signed a document, or who actually controls an account or a wallet. Third, post-quantum cryptography, which is now being urgently deployed, is only a temporary patch.It remains purely mathematical, still uses formal keys, and is still vulnerable to future breakthroughs, new algorithms, and implementation errors.It does not solve the root problem: the very principle of “a secret as a bit string” is obsolete. And here lies the main difficulty we are about to face. The world has become too digital and too interconnected to survive another collapse of trust.We can no longer rely on protection that rests solely on computational hardness.Hardness is not a foundation.It is only a temporary delay. We need technologies of a fundamentally different class. Technologies in which: – the key is not a number and not a file,but a stable state of a system; – the secret is not information,but a mode of being of a node, a device, or a human; – authentication is not string equality,but the coincidence of internal response and state; – hacking is not brute force,but an attempt to reproduce another system’s reality. This is precisely why new cryptographic and security technologies are required. They solve several root problems at once. First — protection against quantum and future post-quantum attacks.If a secret does not exist as a number or a file, it cannot be factorized, brute-forced, or extracted from memory. Second — protection against key theft and system cloning.If a key never physically leaves a device and does not exist outside its internal state, it cannot be stolen, leaked, or copied. Third — protection against identity substitution and man-in-the-middle attacks.If authentication depends on internal state, time, and context rather than only on a password or token, substitution becomes practically impossible. Fourth — protection against future unknown threats.If security is based not on mathematical problems but on physics, dynamics, and the uniqueness of states, it does not collapse when new algorithms appear. Fifth — technological sovereignty.Systems can be designed so that they physically and logically do not function without the participation of their creator or owner — even if the code, schematics, and documentation are leaked. Simply put, we need technologies in which: security is built into the very reality of the system,not bolted on top in the form of a password and a cipher. This is not abstract philosophy and not “for the distant future.”It is a response to a very concrete and already approaching crisis of digital trust. And the question here is no longer whether such technologies will be needed.The only question is who will be the first to make them work. Below is an exhaustive catalog of all classes of the author’s Ξ-cryptography and Ξ-security technologies. Premonition Block This framework is not “just one cryptosystem.”It is a foundation for a post-quantum + post-mathematical security standard. Three to four of these positions alone are sufficient to define a global standard on the level of TLS / PKI / HSM.

•Jan 26, 2026•0 citations

CRYPTOGRAPHY FROM QUANTUM MECHANICAL VIEWPOINT

Minal Lopes and Dr. Nisha Sarwade

Cryptography is an art and science of secure communication. Here the sender and receiver are guaranteed the security through encryption of their data, with the help of a common key. Both the parties should agree on this key prior to communication. The cryptographic systems which perform these tasks are designed to keep the key secret while assuming that the algorithm used for encryption and decryption is public. Thus key exchange is a very sensitive issue. In modern cryptographic algorithms this security is based on the mathematical complexity of the algorithm. But quantum computation is expected to revolutionize computing paradigm in near future. This presents a challenge amongst the researchers to develop new cryptographic techniques that can survive th

•Nov 7, 2018•0 citations

Quantum cryptography: State-of-art, challenges and future perspectives

Vishnu Teja, Payel Banerjee, N. N. Sharma +1 more

With quantum computing, we are witnessing an exciting and very promising merging of three of the deepest and most successful scientific and technological developments of modern era: quantum physics, computer science, and nanotechnology. Quantum computers have the potential to perform certain calculations billions of times faster than any silicon-based computer. A functional quantum computer will be invaluable in factoring large numbers, and therefore extremely useful for decoding and encoding secret information. In this paper we have discussed contemporary cryptographic systems and their strengths and drawbacks. Two of the most common quantum key distribution protocols have been explained. This is followed by a note on the experimental realizations of quantum key distribution and the associated technological challenges. A few novel extensions of this concept in the future have also been dealt with. This paper aims at familiarizing the reader with the field of quantum cryptography and gives an insight about the latest developments.

IEEE Conference on Nanotechnology (IEEE NANO)•Aug 1, 2007•21 citations
The aim of this paper is to obtain an inter-pretation of foundations of the quantum compu-tation under the light of the level of functional abstraction [1] and supported by its mathemat-ical basis. This approach seems more accessi-ble to programmers and increases the study and interest in quantum programming. The neces-sity for secret message exchange and the possi-bility of reading secret information have devel-oped cryptographic methods. The security of current methods is based on hard computational problems enabling a good safety level. However, if there is a marked growth in computational power, leaks in the safety system of the crypto-
Information is divided into two types: classical and quantum. Quantum computing, quantum cryptography, and quantum teleportation are just a few of the miracles they can do when working together. Some of the uses range from assisting in the prevention of spies reading private messages to assisting in the prevention of spies reading private communications. Quantum purification and quantum error correction are examples of techniques that will make their implementation easier. Although some of these concepts are still beyond present technological capabilities, quantum cryptography has been established. The possibilities for small-scale quantum computer device prototypes by the end of the millennium are promising. This paper is focusing on addressing the depended approaches which deal with implementation cryptography based on quantumcomputing. Remembering that cryptography is a method of encryption that uses the naturally occurring propertiesof quantum mechanics to secure and transmit data in a way that cannot be hacked. Cryptography is the process ofencrypting and protecting data so that only the person who has the right secret key can decrypt it. For decades now, quantum computing has been hailed as one of the next big revolutions. Quantum computing is not just fasterthan traditional computing methods, but a fundamentally different approach to solve seemingly intractable problems. The mathematical operations that most traditional cryptographic algorithms rely on could be cracked with a sufficiently strong quantum computer. This paper aims to explain how quantum computing affects currentcryptography and expose readers to fundamental post-quantum methods. Quantum computing’s influence on IT professionals is becoming increasingly important. As a result, we provide a straightforward introduction to post-quantum cryptography, including quantum-resistant algorithms and quantum key distribution.
Quantum cryptography is a relatively new field (which began to be developed in 1984), which seems to be taking its last steps to become commercially available, thus becoming the first directly quantum technology to do so. The motivation behind it is not small, since it will allow coding a message in an absolutely secure and illegible way, due to the laws of quantum mechanics, and independently of the power of any computer, even a quantum one. In what seems like a not-too-distant future, engineers who understand and are able to work with such systems will be needed. Therefore, this Master’s Thesis aims to give an introduction to the current development of the field, from the physical concepts that underlie it, to the state of the art of the technology. The text is intended for people with a background in Electrical Engineering, and little or no knowledge of quantum mechanics. However, other readers with a background in engineering or physics will also be able to take advantage of it. After reading it, the reader will be able to have a good starting point in the field, from which to continue developing their work.
The advent of a full-scale quantum computer will severely impact most currently-used cryptographic systems.The most well-known aspect of this impact lies in the computational-hardness assumptions that underpin the security of most current public-key cryptographic systems: a quantum computer can factor integers and compute discrete logarithms in polynomial time, thereby breaking systems based on these problems.However, simply replacing these problems by other which are (believed to be) impervious even to a quantum computer does not completely solve the issue.Indeed, many security proofs of cryptographic systems are no longer valid in the presence of a quantum-capable attacker; while this does not automatically implies that the affected systems would be broken by a quantum computer, it does raises questions on the exact security guarantees that they can provide.This overview document aims to analyze all aspects of the impact of quantum computers on cryptographic, by providing an overview of current quantum-hard computational problems (and cryptographic systems based on them), and by presenting the security proofs that are affected by quantum-attackers, detailing what is the current status of research on the topic and what the expected effects on security are.
This document introduces a new class of cryptographic and security systems based on ontological states, invariants, endogenous time, and internal reality operators. The described architectures replace informational secrets with state-dependent invariants and irreversible contextual operators. This work defines a new security paradigm independent of computational hardness assumptions. We are standing on the threshold of a major rupture in data security and digital infrastructure. In the coming years, something that until recently seemed theoretical will become reality:modern encryption methods will cease to be reliable.The reason is the rapid progress of quantum computing and the overall growth of computational power.The algorithms on which today’s messengers, banks, electronic signatures, government registries, and the entire system of digital trust are built were originally designed in an era when such capabilities were unattainable. This implies several very unpleasant consequences. First, everything that is encrypted today can already be intercepted and stockpiled “for later.”Within 5–15 years, such archives will be decryptable at scale.This applies to personal correspondence, medical records, commercial secrets, financial transactions, diplomatic documents, and government databases. Second, the very foundation of trust in the digital world will be undermined.Electronic signatures, TLS certificates, blockchains, banking protocols, and identity systems all rely on the same fragile mathematical basis.When it collapses, it will no longer be possible to reliably prove who sent a message, who signed a document, or who actually controls an account or a wallet. Third, post-quantum cryptography, which is now being urgently deployed, is only a temporary patch.It remains purely mathematical, still uses formal keys, and is still vulnerable to future breakthroughs, new algorithms, and implementation errors.It does not solve the root problem: the very principle of “a secret as a bit string” is obsolete. And here lies the main difficulty we are about to face. The world has become too digital and too interconnected to survive another collapse of trust.We can no longer rely on protection that rests solely on computational hardness.Hardness is not a foundation.It is only a temporary delay. We need technologies of a fundamentally different class. Technologies in which: – the key is not a number and not a file,but a stable state of a system; – the secret is not information,but a mode of being of a node, a device, or a human; – authentication is not string equality,but the coincidence of internal response and state; – hacking is not brute force,but an attempt to reproduce another system’s reality. This is precisely why new cryptographic and security technologies are required. They solve several root problems at once. First — protection against quantum and future post-quantum attacks.If a secret does not exist as a number or a file, it cannot be factorized, brute-forced, or extracted from memory. Second — protection against key theft and system cloning.If a key never physically leaves a device and does not exist outside its internal state, it cannot be stolen, leaked, or copied. Third — protection against identity substitution and man-in-the-middle attacks.If authentication depends on internal state, time, and context rather than only on a password or token, substitution becomes practically impossible. Fourth — protection against future unknown threats.If security is based not on mathematical problems but on physics, dynamics, and the uniqueness of states, it does not collapse when new algorithms appear. Fifth — technological sovereignty.Systems can be designed so that they physically and logically do not function without the participation of their creator or owner — even if the code, schematics, and documentation are leaked. Simply put, we need technologies in which: security is built into the very reality of the system,not bolted on top in the form of a password and a cipher. This is not abstract philosophy and not “for the distant future.”It is a response to a very concrete and already approaching crisis of digital trust. And the question here is no longer whether such technologies will be needed.The only question is who will be the first to make them work. Below is an exhaustive catalog of all classes of the author’s Ξ-cryptography and Ξ-security technologies. Premonition Block This framework is not “just one cryptosystem.”It is a foundation for a post-quantum + post-mathematical security standard. Three to four of these positions alone are sufficient to define a global standard on the level of TLS / PKI / HSM.
Cryptography is an art and science of secure communication. Here the sender and receiver are guaranteed the security through encryption of their data, with the help of a common key. Both the parties should agree on this key prior to communication. The cryptographic systems which perform these tasks are designed to keep the key secret while assuming that the algorithm used for encryption and decryption is public. Thus key exchange is a very sensitive issue. In modern cryptographic algorithms this security is based on the mathematical complexity of the algorithm. But quantum computation is expected to revolutionize computing paradigm in near future. This presents a challenge amongst the researchers to develop new cryptographic techniques that can survive th
With quantum computing, we are witnessing an exciting and very promising merging of three of the deepest and most successful scientific and technological developments of modern era: quantum physics, computer science, and nanotechnology. Quantum computers have the potential to perform certain calculations billions of times faster than any silicon-based computer. A functional quantum computer will be invaluable in factoring large numbers, and therefore extremely useful for decoding and encoding secret information. In this paper we have discussed contemporary cryptographic systems and their strengths and drawbacks. Two of the most common quantum key distribution protocols have been explained. This is followed by a note on the experimental realizations of quantum key distribution and the associated technological challenges. A few novel extensions of this concept in the future have also been dealt with. This paper aims at familiarizing the reader with the field of quantum cryptography and gives an insight about the latest developments.