A new quantum algorithm for computing RSA ciphertext period
From MaRDI portal
Publication:5371904
DOI10.1007/S11859-017-1218-5zbMath1389.81012OpenAlexW2567821528WikidataQ123095502 ScholiaQ123095502MaRDI QIDQ5371904
Huanguo Zhang, Ya-Hui Wang, Song Yuan Yan
Publication date: 20 October 2017
Published in: Wuhan University Journal of Natural Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11859-017-1218-5
Cites Work
- Unnamed Item
- The development of the number field sieve
- Primality testing and integer factorization in public-key cryptography
- Computational Number Theory and Modern Cryptography
- A method for obtaining digital signatures and public-key cryptosystems
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
This page was built for publication: A new quantum algorithm for computing RSA ciphertext period