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

IEEE Conference on Nanotechnology (IEEE NANO)

Performing authenticated encryption with nanoscale phenomenon

Yi-Lin Ju, I-Ming Tsai, Sy‐Yen Kuo

Published Sep 9, 2005• 2 citations
Publisher

Abstract

Recent progress in nanotechnology has focused on applying nanoscale phenomenon in physical layer or device level applications. In this paper, we show that nanoscale phenomenon cannot only be used in physical layer, but also in high layer application such as communication protocols. In this paper, we study the possibility of performing authentication and encryption based on quantum entanglement, which is a phenomenon available only at the nanoscale level. Unlike classical authentication and encryption algorithms, the security of this protocol is based on nanoscale physical laws, instead of any unproven mathematic conjecture.

DOI
10.1109/nano.2005.1500820

Related papers

Quantum Entanglement and Its Applications on Secure Computation

Yao–Hsin Chou, I.-M. Tsai, Sy‐Yen Kuo

In this paper, we demonstrate that nanoscale phenomenon can be applied not only in device level but also in high layer applications, such as secure computation. We study the possibility of performing secure computation based on quantum entanglement, which is a phenomenon available only at the nanometer scale. Comparing with classical secure computation algorithms, the security of this protocol is based on physical laws, instead of any unproven mathematic conjecture.

IEEE Conference on Nanotechnology (IEEE NANO)•Jan 1, 2006•2 citations

Quantum Entanglement and Its Applications on Secure Computation

Yao–Hsin Chou, I.-M. Tsai, Sy‐Yen Kuo

In this paper, we demonstrate that nanoscale phenomenon can be applied not only in device level but also in high layer applications, such as secure computation. We study the possibility of performing secure computation based on quantum entanglement, which is a phenomenon available only at the nanometer scale. Comparing with classical secure computation algorithms, the security of this protocol is based on physical laws, instead of any unproven mathematic conjecture.

IEEE Conference on Nanotechnology (IEEE NANO)•Oct 30, 2006•0 citations

Quantum Entanglement, Non-Locality and Secure Computation

Yao–Hsin Chou, I-Ming Tsai, Chin‐Shyurng Fahn +2 more

In this paper, we demonstrate that nanoscale phenomenon can be applied not only in device level but also in high layer applications, such as secure computation. We study the possibility of performing secure computation by building non-local machines based on quantum entanglement and non-locality, which are phenomena available only at the nanometer scale. Comparing with classical secure computation algorithms, the security of this protocol is based on physical laws, instead of any unproven mathematic conjecture.

International Conference on Quantum, Nano and Micro Technologies (ICQNM)•Jan 1, 2007•1 citation

Quantum entanglement and non-locality based secure computation for future communication

Yao–Hsin Chou, C.-Y. Chen, Han‐Chieh Chao +2 more

Traditionally, the authors could establish secure computation protocols using variants of public key cryptology whose security is based on hard mathematics problems. However, classical protocols will become insecure owing to the emergence of quantum algorithms like Shors. In this paper, the authors demonstrate that nanoscale phenomenon can be applied not only in device level but also in high layer applications, such as secure computation. The authors study the possibility of performing secure computation by building non-local machines based on quantum entanglement and non-locality, which are phenomena available only at the nanometre scale. Comparing with classical secure computation algorithms, the security of this protocol is based on physical laws, instead of any unproven mathematic conjecture.

IET Information Security•Mar 31, 2011•18 citations

On quantum authentication protocols

Yoshito Kanamori, Seong-Moo Yoo, Don A. Gregory +1 more

When it became known that quantum computers could break the RSA (named for its creators - Rivest, Shamir, and Adleman) encryption algorithm within a polynomial-time, quantum cryptography began to be actively studied. Other classical cryptographic algorithms are only secure when malicious users do not have computational power enough to break security within a practical amount of time. Recently, many quantum authentication protocols sharing quantum entangled particles between communicators have been proposed, providing unconditional security. An issue caused by sharing quantum entangled particles is that it may not be simple to apply these protocols to authenticate a specific user in a group of many users. We propose an authentication protocol using quantum superposition states instead of quantum entangled particles. Our protocol can be implemented with the current technologies we introduce in this paper.

Globecom•Jan 1, 2005•23 citations

Authentication Protocol Using Quantum Superposition States

Yoshito Kanamori, Seong-Moo Yoo, Don A. Gregory +1 more

When it became known that quantum computers could break the RSA (named for its creators – Rivest, Shamir, and Adleman) encryption algorithm within a polynomialtime, quantum cryptography began to be actively studied. Other classical cryptographic algorithms are only secure when malicious users do not have sufficient computational power to break security within a practical amount of time. Recently, many quantum authentication protocols sharing quantum entangled particles between communicators have been proposed, providing unconditional security. An issue caused by sharing quantum entangled particles is that it may not be simple to apply these protocols to authenticate a specific user in a group of many users. An authentication protocol using quantum superposition states instead of quantum entangled particles is proposed. The random number shared between a sender and a receiver can be used for classical encryption after the authentication has succeeded. The proposed protocol can be implemented with the current technologies we introduce in this paper.

International journal of network security•Jan 1, 2009•24 citations
Recent progress in nanotechnology has focused on applying nanoscale phenomenon in physical layer or device level applications. In this paper, we show that nanoscale phenomenon cannot only be used in physical layer, but also in high layer application such as communication protocols. In this paper, we study the possibility of performing authentication and encryption based on quantum entanglement, which is a phenomenon available only at the nanoscale level. Unlike classical authentication and encryption algorithms, the security of this protocol is based on nanoscale physical laws, instead of any unproven mathematic conjecture.
In this paper, we demonstrate that nanoscale phenomenon can be applied not only in device level but also in high layer applications, such as secure computation. We study the possibility of performing secure computation by building non-local machines based on quantum entanglement and non-locality, which are phenomena available only at the nanometer scale. Comparing with classical secure computation algorithms, the security of this protocol is based on physical laws, instead of any unproven mathematic conjecture.
Traditionally, the authors could establish secure computation protocols using variants of public key cryptology whose security is based on hard mathematics problems. However, classical protocols will become insecure owing to the emergence of quantum algorithms like Shors. In this paper, the authors demonstrate that nanoscale phenomenon can be applied not only in device level but also in high layer applications, such as secure computation. The authors study the possibility of performing secure computation by building non-local machines based on quantum entanglement and non-locality, which are phenomena available only at the nanometre scale. Comparing with classical secure computation algorithms, the security of this protocol is based on physical laws, instead of any unproven mathematic conjecture.
When it became known that quantum computers could break the RSA (named for its creators - Rivest, Shamir, and Adleman) encryption algorithm within a polynomial-time, quantum cryptography began to be actively studied. Other classical cryptographic algorithms are only secure when malicious users do not have computational power enough to break security within a practical amount of time. Recently, many quantum authentication protocols sharing quantum entangled particles between communicators have been proposed, providing unconditional security. An issue caused by sharing quantum entangled particles is that it may not be simple to apply these protocols to authenticate a specific user in a group of many users. We propose an authentication protocol using quantum superposition states instead of quantum entangled particles. Our protocol can be implemented with the current technologies we introduce in this paper.
When it became known that quantum computers could break the RSA (named for its creators – Rivest, Shamir, and Adleman) encryption algorithm within a polynomialtime, quantum cryptography began to be actively studied. Other classical cryptographic algorithms are only secure when malicious users do not have sufficient computational power to break security within a practical amount of time. Recently, many quantum authentication protocols sharing quantum entangled particles between communicators have been proposed, providing unconditional security. An issue caused by sharing quantum entangled particles is that it may not be simple to apply these protocols to authenticate a specific user in a group of many users. An authentication protocol using quantum superposition states instead of quantum entangled particles is proposed. The random number shared between a sender and a receiver can be used for classical encryption after the authentication has succeeded. The proposed protocol can be implemented with the current technologies we introduce in this paper.