Quantum algorithms for typical hard problems: a perspective of cryptanalysis

Suo, Jingwen; Wang, Licheng; Yang, Sijia; Zheng, Wenjie; Zhang, Jiankang

doi:10.1007/s11128-020-02673-x

Cited by 23 publications

(10 citation statements)

References 65 publications

(83 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The existence of a quantum advantage applicable to blockchain technologies has certainly been noted before see e.g. [33,34,35,36].…”

Section: Related Workmentioning

confidence: 81%

Vulnerability of Blockchain Technologies to Quantum Attacks

Kearney,

Perez-Delgado

2021

Preprint

View full text Add to dashboard Cite

Quantum computation represents a threat to many cryptographic protocols in operation today. It has been estimated that by 2035, there will exist a quantum computer capable of breaking the vital cryptographic scheme RSA2048. Blockchain technologies rely on cryptographic protocols for many of their essential subroutines. Some of these protocols, but not all, are open to quantum attacks. Here we analyze the major blockchain-based cryptocurrencies deployed today-including Bitcoin, Ethereum, Litecoin and ZCash, and determine their risk exposure to quantum attacks. We finish with a comparative analysis of the studied cryptocurrencies and their underlying blockchain technologies and their relative levels of vulnerability to quantum attacks.

show abstract

“…The existence of a quantum advantage applicable to blockchain technologies has certainly been noted before see e.g. [33,34,35,36].…”

Section: Related Workmentioning

confidence: 81%

Vulnerability of Blockchain Technologies to Quantum Attacks

Kearney,

Perez-Delgado

2021

Preprint

View full text Add to dashboard Cite

show abstract

“…Table 20: Different implementations of Shor's algorithms on IFP [70] Authors Year Time complexity Space complexity Shor [58] 1994 O(n 3 ) O(n) Proos et al [71] 2003 O(n 2 ) -Ekera et al [72] 2019 -O(n 2 )…”

Section: Authorsmentioning

confidence: 99%

A survey on implementations of homomorphic encryption schemes

et al. 2023

View full text Add to dashboard Cite

With the increased need for data confidentiality in various applications of our daily life, homomorphic encryption (HE) has emerged as a promising cryptographic topic. HE enables to perform computations directly on encrypted data (ciphertexts) without decryption in advance. Since the results of calculations remain encrypted and can only be decrypted by the data owner, confidentiality is guaranteed and any third party can operate on ciphertexts without access to decrypted data (plaintexts). Applying a homomorphic cryptosystem in a real-world application depends on its resource efficiency. Several works compared different HE schemes and gave the stakes of this research field. However, the existing works either do not deal with recently proposed HE schemes (such as CKKS) or focus only on one type of HE. In this paper, we conduct an extensive comparison and evaluation of homomorphic cryptosystems' performance based on their experimental results. The study covers all three families of HE, including several notable schemes such as BFV, BGV, CKKS, RSA, El-Gamal, and Paillier, as well as their implementation specification in widely used HE libraries, namely Microsoft SEAL, PALISADE, and HElib. In addition, we also discuss the resilience of HE schemes to different

show abstract

Section: Authorsmentioning

confidence: 99%

A Survey on Implementations of Homomorphic Encryption Schemes

Doan

Messai

Gavin

et al. 2022

Preprint

View full text Add to dashboard Cite

With the increased need for data confidentiality in various applications of our daily life, homomorphic encryption (HE) has emerged as a promising cryptographic topic. HE enables to perform computations directly on encrypted data (ciphertexts) without decryption in advance. Since the results of calculations remain encrypted and can only be decrypted by the data owner, confidentiality is guaranteed and any third party can operate on ciphertexts without access to decrypted data (plaintexts). Applying a homomorphic cryptosystem in a real-world application depends on its resource efficiency. Several works compared different HE schemes and gave the stakes of this research field. However, the existing works either do not deal with recently proposed HE schemes (such as CKKS) or focus only on one type of HE. In this paper, we conduct an extensive comparison and evaluation of homomorphic cryptosystems’ performance based on their experimental results. The study covers all three families of HE, including several notable schemes such as BFV, BGV, CKKS, RSA, El-Gamal, and Paillier, as well as their implementation specification in widely used HE libraries, namely Microsoft SEAL, PALISADE, and HElib. In addition, we also discuss the resilience of HE schemes to different kind of attacks such as Indistinguishability under chosen-plaintext attack and integer factorization attacks on classical and quantum computers.

show abstract

Quantum algorithms for typical hard problems: a perspective of cryptanalysis

Cited by 23 publications

References 65 publications

Vulnerability of Blockchain Technologies to Quantum Attacks

Vulnerability of Blockchain Technologies to Quantum Attacks

A survey on implementations of homomorphic encryption schemes

A Survey on Implementations of Homomorphic Encryption Schemes

Contact Info

Product

Resources

About