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

Advances in intelligent systems and computing

A Novel RFID Data Management Model Based on Quantum Cryptography

He Xu, Xin Chen, Peng Li, Jie Ding, Caleb Eghan

Published Sep 28, 2018• 4 citations
Publisher
DOI
10.1007/978-981-13-1165-9_41

Related papers

Analysis of key management and Quantum Cryptographyin RFID networks

Vijey Thayananthan, Ahmed Alzahrani, Muhammad Shuaib Qureshi

International Journal of Academic Research•Oct 23, 2012•3 citations

Efficient techniques of key management and quantum cryptography in RFID networks

Vijey Thayananthan, Ahmed Alzahrani, Muhammad Shuaib Qureshi

An efficient way of handling security keys using quantum cryptography QC for increasing security in radio frequency identification RFID networks is being investigated by network security industries. To establish secure RFID network, communication between any two nodes that hold RFID tags and/or readers merged with existing networks should be protected. In order to maximize the data security and secure transmission around RFID network, theoretical model of the quantum key management KM system based on RFID is introduced as a proposed research. This model not only manages the secure keys but also it defends passive eavesdropping attacks and other potential attacks. Novelties in this research are security keys of which QC is being utilized in RFID network with continuous key updates. To establish future security around RFID networks, efficient KM protocol and QC, which deal with quantum mathematical procedures and quantum physics, should be analyzed without affecting the legacy. Computational complexities in KM are increasing with the large key sizes, which are manageable through QC. To maximize the security and minimize the complexity in KM, QC with Grover's algorithm is introduced as a method in RFID network environments. So, we have proved that a number of operations with key sizes obtained in KM are reduced. In this proposal, QC will help to reduce the complexity of algorithms used in KM protocols and maximize the security. Copyright © 2014 John Wiley & Sons, Ltd.

Security and Communication Networks•May 7, 2014•11 citations

A Security and Performance Evaluation of Hash-Based RFID Protocols

Tong-Lee Lim, Tieyan Li, Yingjiu Li

Lecture notes in computer science•Jan 1, 2009•10 citations

A Post-Quantum Secure RFID Authentication Protocol Based on NTRU Encryption Algorithm

Hu Liu, Hengyu Wu, Ning Ge +1 more

As a non-contact identification technology, RFID (Radio Frequency Identification) is widely used in various Internet of Things applications. However, RFID systems are highly vulnerable to diverse attacks due to the openness of communication links between readers and tags, leading to serious security and privacy concerns. Numerous RFID authentication protocols have been designed that employ hash functions and symmetric cryptography to secure communications. Despite these efforts, such schemes generally exhibit limitations in key management flexibility and scalability, which significantly restricts their applicability in large-scale RFID deployments. Confronted with this challenge, public key cryptography offers an effective solution. Taking into account factors such as parameter size, computational complexity, and resistance to quantum attacks, the NTRU algorithm emerges as one of the most promising choices. Since the NTRU signature algorithm is highly complex and requires large parameters, there are currently only a few NTRU encryption-based RFID authentication protocols available, all of which exhibit significant security flaws-such as supporting only one-way authentication, failing to address public key distribution, and so on. Moreover, performance evaluations of the algorithm in these contexts are often incomplete. This paper proposes a mutual authentication protocol for RFID based on the NTRU encryption algorithm to address security and privacy issues. The security of the protocol is analyzed using the BAN-logic tools and some non-formalized methods, and it is further validated through simulation with the AVISPA tool. With the parameter set (N, p, q) = (443, 3, 2048), the NTRU algorithm can provide 128 bits of post-quantum security strength. This configuration not only demonstrates greater foresight at the theoretical security level but also offers significant advantages in practical energy consumption and computation time when compared to traditional algorithms such as ECC, making it a highly competitive candidate in the field of post-quantum cryptography.

Sensors•Feb 5, 2026•1 citation

Quantum Cryptography for Data Security

Parth Indulkar, Ganesh Suresh Lagad

•Jun 30, 2025•0 citations

An Efficient Mutual Authentication Protocol for RFID Systems

Iuon‐Chang Lin, Rui-Kun Luo, Shih-Chang Tsao

After the worldpsilas largest retailer, Wal-Mart, has implemented RFID (Radio Frequency Identification), the global suppliers are actively devoted to EPC (Electronic Product Code) research and development. Since RFID has advantages of a long life, safe, and free from environmental constraints, RFID EPC can achieve benefits such as saving manpower costs, expressing logistics management, reducing man-made orders, and decreasing excess inventory. The paper is to explore the security issues of the RFID EPC Class 1 Generation 2. RFID transmits information wirelessly, and therefore information can be captured. In order to protect data privacy, many scholars have proposed their own ways to improve. This paper has extended the scheme of Duc et al., and made a more efficient version.

International Conference on Hybrid Intelligent Systems (HIS)•Jan 1, 2009•4 citations
An efficient way of handling security keys using quantum cryptography QC for increasing security in radio frequency identification RFID networks is being investigated by network security industries. To establish secure RFID network, communication between any two nodes that hold RFID tags and/or readers merged with existing networks should be protected. In order to maximize the data security and secure transmission around RFID network, theoretical model of the quantum key management KM system based on RFID is introduced as a proposed research. This model not only manages the secure keys but also it defends passive eavesdropping attacks and other potential attacks. Novelties in this research are security keys of which QC is being utilized in RFID network with continuous key updates. To establish future security around RFID networks, efficient KM protocol and QC, which deal with quantum mathematical procedures and quantum physics, should be analyzed without affecting the legacy. Computational complexities in KM are increasing with the large key sizes, which are manageable through QC. To maximize the security and minimize the complexity in KM, QC with Grover's algorithm is introduced as a method in RFID network environments. So, we have proved that a number of operations with key sizes obtained in KM are reduced. In this proposal, QC will help to reduce the complexity of algorithms used in KM protocols and maximize the security. Copyright © 2014 John Wiley & Sons, Ltd.
As a non-contact identification technology, RFID (Radio Frequency Identification) is widely used in various Internet of Things applications. However, RFID systems are highly vulnerable to diverse attacks due to the openness of communication links between readers and tags, leading to serious security and privacy concerns. Numerous RFID authentication protocols have been designed that employ hash functions and symmetric cryptography to secure communications. Despite these efforts, such schemes generally exhibit limitations in key management flexibility and scalability, which significantly restricts their applicability in large-scale RFID deployments. Confronted with this challenge, public key cryptography offers an effective solution. Taking into account factors such as parameter size, computational complexity, and resistance to quantum attacks, the NTRU algorithm emerges as one of the most promising choices. Since the NTRU signature algorithm is highly complex and requires large parameters, there are currently only a few NTRU encryption-based RFID authentication protocols available, all of which exhibit significant security flaws-such as supporting only one-way authentication, failing to address public key distribution, and so on. Moreover, performance evaluations of the algorithm in these contexts are often incomplete. This paper proposes a mutual authentication protocol for RFID based on the NTRU encryption algorithm to address security and privacy issues. The security of the protocol is analyzed using the BAN-logic tools and some non-formalized methods, and it is further validated through simulation with the AVISPA tool. With the parameter set (N, p, q) = (443, 3, 2048), the NTRU algorithm can provide 128 bits of post-quantum security strength. This configuration not only demonstrates greater foresight at the theoretical security level but also offers significant advantages in practical energy consumption and computation time when compared to traditional algorithms such as ECC, making it a highly competitive candidate in the field of post-quantum cryptography.
After the worldpsilas largest retailer, Wal-Mart, has implemented RFID (Radio Frequency Identification), the global suppliers are actively devoted to EPC (Electronic Product Code) research and development. Since RFID has advantages of a long life, safe, and free from environmental constraints, RFID EPC can achieve benefits such as saving manpower costs, expressing logistics management, reducing man-made orders, and decreasing excess inventory. The paper is to explore the security issues of the RFID EPC Class 1 Generation 2. RFID transmits information wirelessly, and therefore information can be captured. In order to protect data privacy, many scholars have proposed their own ways to improve. This paper has extended the scheme of Duc et al., and made a more efficient version.