Factorization of a 512-Bit RSA Modulus-Reference-Cited by-同舟云学术

Factorization of a 512-Bit RSA Modulus

Published:2000 Issue: Volume: Page:1-18
ISSN:0302-9743
Container-title:Advances in Cryptology — EUROCRYPT 2000
language:
Short-container-title:

Author:

Cavallar Stefania,Dodson Bruce,Lenstra Arjen K.,Lioen Walter,Montgomery Peter L.,Murphy Brian,te Riele Herman,Aardal Karen,Gilchrist Jeff,Guillerm Gérard,Leyland Paul,Marchand Jöel,Morain François,Muffett Alec,Putnam Chris and Craig,Zimmermann Paul

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45539-6_1

Reference38 articles.

1. L.M. Adleman. Factoring numbers using singular integers. In Proc. 23rd Annual ACM Symp. on Theory of Computing (STOC), pages 64–71, ACM, New York, 1991.

2. Lect Notes Comput Sci;D. Atkins,1995

3. Lect Notes Comput Sci,1992

4. Wieb Bosma and Marc-Paul van der Hulst. Primality proving with cyclotomy. PhD thesis, University of Amsterdam, December 1990.

5. Lect Notes Comput Sci;R. P. Brent,1999

Cited by 43 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Towards a CIA compliant RSA hybrid built on an Artificial Neural Network;2021 3rd International Multidisciplinary Information Technology and Engineering Conference (IMITEC);2021-11-23

2. An FPGA-based hardware abstraction of quantum computing systems;Journal of Computational Electronics;2021-09-23

3. A Framework for Filtering Step of Number Field Sieve and Function Field Sieve;IETE Journal of Research;2021-06-10

4. Impact of Computational Power on Cryptography;Multimedia Security;2021

5. A Study on the Performance of Base-m Polynomial Selection Algorithm Using GPU;Artificial Intelligence and Applied Mathematics in Engineering Problems;2020