@article{PMFA_1998_43_1_a1,
author = {Pomerance, Carl},
title = {Vypr\'av\v{e}n{\'\i} o dvou s{\'\i}tech},
journal = {Pokroky matematiky, fyziky a astronomie},
pages = {9--29},
year = {1998},
volume = {43},
number = {1},
zbl = {1042.11528},
language = {cs},
url = {http://geodesic.mathdoc.fr/item/PMFA_1998_43_1_a1/}
}
Pomerance, Carl. Vyprávění o dvou sítech. Pokroky matematiky, fyziky a astronomie, Tome 43 (1998) no. 1, pp. 9-29. http://geodesic.mathdoc.fr/item/PMFA_1998_43_1_a1/
[1] Adleman, L. M.: Factoring numbers using singular integers. Proc. 23rd Annual ACM Sympos. Theory of Computing (STOC) 1991, 64–71.
[2] Alford, W. R., Pomerance, C.: Implementing the self initializing quadratic sieve on a distributed network. In: Number Theoretic and Algebraic Methods in Computer Science, Proc. Internat. Moscow Conf., June–July 1993 (A. J. van der Poorten, I. Shparlinski, H. G. Zimmer, eds.), World Scientific 1995, 163–174. | MR
[3] Brillhart, J., Lehmer, D. H., Selfridge, J. L., Tuckerman, B., Jr., S. S. Wagstaff: Factorizations of $b^n\pm 1$, $b=2,3,5,6,7,10,11,12$, up to high powers. second ed., vol. 22, Contemp. Math., Amer. Math. Soc., Providence, RI 1988. | MR
[4] Canfield, E. R., Erdős, P., Pomerance, C.: On a problem of Oppenheim concerning “Factorisatio Numerorum”. J. Number Theory 17 (1983), 1–28. | MR
[5] Coppersmith, D.: Modifications to the number field sieve. J. Cryptology 6 (1993), 169–180. | MR | Zbl
[6] Coppersmith, D., Odlyzko, A. M., Schroeppel, R.: Discrete logarithms in $GF(p)$. Algorithmica 1 (1986), 1–15. | MR
[7] Cowie, J., Dodson, B., Elkenbracht-Huizing, R. Marije, Lenstra, A. K., Montgomery, P. L., Zayer, J.: A world wide number field sieve factoring record: On to $512$ bits. Advances in Cryptology – Asiacrypt ’96, to appear.
[8] Elkenbracht-Huizing, M.: A multiple polynomial general number field sieve. In: Algorithmic Number Theory, Second Internat. Sympos., ANTS-II, to appear. | MR | Zbl
[9] Gerver, J.: Factoring large numbers with a quadratic sieve. Math. Comp. 41 (1983), 287–294. | MR | Zbl
[10] Lenstra, A. K.: Integer factoring. Preprint. | MR | Zbl
[11] Lenstra, A. K., Lenstra, H. W., Jr.: The development of the number field sieve. Lecture Notes in Math., vol. 1554, Springer-Verlag, Berlin, Heidelberg 1993. | MR
[12] Lenstra, A. K., Manasse, M. S.: Factoring by electronic mail. In: Advances in Cryptology – Eurocrypt ’89 (J.-J. Quisquater, J. Vandewalle, eds.), Springer-Verlag, Berlin, Heidelberg 1990, 355–371. | MR
[13] Jr., H. W. Lenstra: Elliptic curves and number theoretic algorithms. In: Proc. Internat. Congr. Math., Berkeley, CA, 1986, vol. 1 (A. M. Gleason, ed.), Amer. Math. Soc., Providence, RI 1987, 99–120. | MR
[14] Montgomery, P. L.: A block Lanczos algorithm for finding dependencies over $GF(2)$. In: Advances in Cryptology – Eurocrypt ’95 (L. C. Guillou, J.-J. Quisquater, eds.), Springer-Verlag, Berlin, Heidelberg 1995, 106–120. | MR | Zbl
[15] Montgomery, P. L.: Square roots of products of algebraic integers. In: Mathematics of Computation 1943-1993, Fifty Years of Computational Mathematics (W. Gautschi, ed.), Proc. Sympos. Appl. Math., vol. 48, Amer. Math. Soc., Providence, RI 1994, 567–571. | MR
[16] Morrison, M. A., Brillhart, J.: A method of factorization and the factorization of $F_7$. Math. Comp. 29 (1975), 183–205. | MR
[17] Odlyzko, A. M.: The future of integer factorization. CryptoBytes (The technical newsletter of RSA Laboratories), 1 (1995) 2, 5–12.
[18] Pomerance, C.: Cryptology and computational number theory. Proc. Sympos. Appl. Math., vol. 42, Amer. Math. Soc., Providence, RI 1990. | MR | Zbl
[19] Pomerance, C.: The number field sieve. In: Mathematics of Computation 1943-1993, Fifty Years of Computational Mathematics (W. Gautschi, ed.), Proc. Sympos. Appl. Math., vol. 48, Amer. Math. Soc., Providence, RI 1994, 465–480. | MR
[20] Pomerance, C.: On the role of smooth numbers in number theoretic algorithms. In: Proc. Internat. Congr. Math., Zurich, Switzerland, 1994, vol. 1 (S. D. Chatterji, ed.), Birkhauser-Verlag, Basel 1995, 411–422. | MR
[21] Pomerance, C., Smith, J. W., Tuler, R.: A pipeline architecture for factoring large integers with the quadratic sieve algorithm. SIAM J. Comput. 17 (1988), 387–403. | MR | Zbl
[22] Schirokauer, O., Weber, D., Denny, T.: Discrete logarithms: The effectiveness of the index calculus method. Algorithmic Number Theory, Second Internat. Sympos., ANTS-II, to appear. | MR | Zbl
[23] Williams, H. C., Shallit, J. O.: Factoring integers before computers. In: Mathematics of Computation 1943–1993, Fifty Years of Computational Mathematics (W. Gautschi, ed.), Proc. Sympos. Appl. Math. 48, Amer. Math. Soc., Providence, RI 1994, 481–531. | MR