Blockchain has become extremely popular since its origin and has been implemented in technologies similar to supply chain management, decentralized finance, and cryptocurrency. Blockchain employs many algorithms for encryption such as SHA-256 (ECDSA (Elliptic Curve Digital Signature Algorithm, Secure Hash Algorithm 256-bit)), and AES (Advanced Encryption Standard). These encryptions are based on mathematical concepts, and research has been ongoing on quantum computers. These computers are capable of solving any mathematical problem, including NP-hard and NP-complete problems, in polynomial time. This study is inspired by the security threats posed to blockchain because of quantum attacks. Algorithms such as Grover’s algorithm and Shor’s algorithm, with time complexities of O(√N) and O(log3N) respectively, indicate that quantum computers can potentially break security based on mathematical concepts. All the researches that have been done in this field have proposed that quantum-secure blockchain will be the solution to the problem. To deal with this, we propose a quantum-resistant model of blockchain with the integration of quantum key distribution for key negotiation between users and the quantum-blockchain network. This model is fully secure against quantum attacks and protects against threats like eavesdropping, 51% attacks and man-in-the-middle attacks. This study introduces new paths for future research in the field of quantum computing and also addresses various challenges.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Enhancing Blockchain Resilience: A Quantum-Secure Model Against Cryptographic Threats

  • Avdhesh Gupta,
  • Jitendra Kumar,
  • Vishan Kumar Gupta,
  • Anu Chaudhary

摘要

Blockchain has become extremely popular since its origin and has been implemented in technologies similar to supply chain management, decentralized finance, and cryptocurrency. Blockchain employs many algorithms for encryption such as SHA-256 (ECDSA (Elliptic Curve Digital Signature Algorithm, Secure Hash Algorithm 256-bit)), and AES (Advanced Encryption Standard). These encryptions are based on mathematical concepts, and research has been ongoing on quantum computers. These computers are capable of solving any mathematical problem, including NP-hard and NP-complete problems, in polynomial time. This study is inspired by the security threats posed to blockchain because of quantum attacks. Algorithms such as Grover’s algorithm and Shor’s algorithm, with time complexities of O(√N) and O(log3N) respectively, indicate that quantum computers can potentially break security based on mathematical concepts. All the researches that have been done in this field have proposed that quantum-secure blockchain will be the solution to the problem. To deal with this, we propose a quantum-resistant model of blockchain with the integration of quantum key distribution for key negotiation between users and the quantum-blockchain network. This model is fully secure against quantum attacks and protects against threats like eavesdropping, 51% attacks and man-in-the-middle attacks. This study introduces new paths for future research in the field of quantum computing and also addresses various challenges.