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

Optik

Cryptanalysis on quantum digital signature based on asymmetric quantum cryptography

Wei‐Min Shi, Yanmei Wang, Yi‐Hua Zhou, Yu‐Guang Yang

Published Sep 28, 2017• 6 citations
Publisher
DOI
10.1016/j.ijleo.2017.06.129

Related papers

Cryptanalysis of multiparty quantum digital signatures

Xiao‐Qiu Cai, Tian‐Yin Wang, Chun‐Yan Wei +1 more

Quantum Information Processing•Jul 2, 2019•25 citations

Cryptanalysis of quantum digital signature for the access control of sensitive data

Xiao‐Qiu Cai, Tian‐Yin Wang, Chun‐Yan Wei +1 more

Physica A Statistical Mechanics and its Applications•Jan 25, 2022•13 citations

Cryptanalysis of a sessional blind signature based on quantum cryptography

Qi Su, Wenmin Li

Quantum Information Processing•Jun 28, 2014•1 citation

Experimental quantum secure network with digital signatures and encryption

Hua‐Lei Yin, Yao Fu, Chen-Long Li +6 more

Abstract Cryptography promises four information security objectives, namely, confidentiality, integrity, authenticity and non-repudiation, to support trillions of transactions annually in the digital economy. Efficient digital signatures, ensuring integrity, authenticity and non-repudiation of data with information-theoretical security are highly urgent and intractable open problems in cryptography. Here, we propose a high-efficiency quantum digital signature (QDS) protocol using asymmetric quantum keys acquired via secret sharing, one-time universal2 hashing and a one-time pad. We just need to use a 384-bit key to sign documents of lengths up to 264 with a security bound of 10−19. If a one-megabit document is signed, the signature efficiency is improved by more than 108 times compared with previous QDS protocols. Furthermore, we build the first all-in-one quantum secure network integrating information-theoretically secure communication, digital signatures, secret sharing and conference key agreement and experimentally demonstrate this signature efficiency advantage. Our work completes the cryptography toolbox of the four information security objectives.

arXiv:2107.14089•National Science Review•Oct 19, 2022•216 citations

Basic Algorithms Quantum Cryptanalysis

Alexei Petrenko, Sergei Petrenko

Purpose of the article: development of quantum algorithms for efficient solution of cryptanalysis problems of asymmetric encryption schemes (RSA, ElGamal) and digital signature (DSA, ECDSA or RSA-PSS), based on computationally difficult problems of factorization and discrete logarithm.Research methods: Methods of quantum cryptanalysis based on the algorithms of Shor, Grover, Simon, etc.Results: algorithms for solving problems of quantum cryptanalysis of two-key cryptography schemes in polynomial time.Practical relevance: consists in developing a solution for computationally difficult problems of factorization and discrete logarithm in polynomial time, taking into account the security of the discrete algorithm (DLP) and the discrete elliptic curve algorithm (ECDLP). The obtained scientific results formed the basis for the development of a special Software Development Kit, SDK for cryptanalysis “Kvant-K”. The Certificate of state registration of the computer program No. 2020665981 was received.

Voprosy kiberbezopasnosti•Jan 1, 2023•7 citations

Cryptanalysis of Quantum Blind Signature Scheme

Hui-Juan Zuo

International Journal of Theoretical Physics•Sep 15, 2012•18 citations
Abstract Cryptography promises four information security objectives, namely, confidentiality, integrity, authenticity and non-repudiation, to support trillions of transactions annually in the digital economy. Efficient digital signatures, ensuring integrity, authenticity and non-repudiation of data with information-theoretical security are highly urgent and intractable open problems in cryptography. Here, we propose a high-efficiency quantum digital signature (QDS) protocol using asymmetric quantum keys acquired via secret sharing, one-time universal2 hashing and a one-time pad. We just need to use a 384-bit key to sign documents of lengths up to 264 with a security bound of 10−19. If a one-megabit document is signed, the signature efficiency is improved by more than 108 times compared with previous QDS protocols. Furthermore, we build the first all-in-one quantum secure network integrating information-theoretically secure communication, digital signatures, secret sharing and conference key agreement and experimentally demonstrate this signature efficiency advantage. Our work completes the cryptography toolbox of the four information security objectives.
Purpose of the article: development of quantum algorithms for efficient solution of cryptanalysis problems of asymmetric encryption schemes (RSA, ElGamal) and digital signature (DSA, ECDSA or RSA-PSS), based on computationally difficult problems of factorization and discrete logarithm.Research methods: Methods of quantum cryptanalysis based on the algorithms of Shor, Grover, Simon, etc.Results: algorithms for solving problems of quantum cryptanalysis of two-key cryptography schemes in polynomial time.Practical relevance: consists in developing a solution for computationally difficult problems of factorization and discrete logarithm in polynomial time, taking into account the security of the discrete algorithm (DLP) and the discrete elliptic curve algorithm (ECDLP). The obtained scientific results formed the basis for the development of a special Software Development Kit, SDK for cryptanalysis “Kvant-K”. The Certificate of state registration of the computer program No. 2020665981 was received.