Abstract
This paper proposes a new sieving algorithm that employs a bucket sort as a part of a factoring algorithm such as the number field sieve. The sieving step requires an enormous number of memory updates; however, these updates usually cause cache hit misses. The proposed algorithm dramatically reduces the number of cache hit misses when the size of the sieving region is roughly less than the square of the cache size, and the memory updates are several times faster than the straightforward implementation.
This work is supported in part by a consignment research from the Telecommunications Advancement Organization of Japan (now the National Institute of Information and Communications Technology) and by the CRYPTREC project.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Lenstra, A.K., Lenstra Jr., H.W. (eds.): The development of the number field sieve. Lecture Notes in Mathematics, vol. 1554. Springer, Heidelberg (1993)
Intel Corporation: IA-32 Intel Architecture Optimization Reference Manual. (2004) Order Number: 248966-010, http://support.intel.com/design/pentium4/manuals/248966.htm
Wambach, G., Wettig, H.: Block sieving algorithms. Technical Report 190, Informatik, Universität zu Köln (1995), http://www.zaik.uni-koeln.de/~paper/index.html?show=zpr95-190
Knuth, D.E.: Sorting and Searching. The Art of Computer Programming, vol. 3. Addison-Wesley, Reading (1998)
Geiselmann, W., Steinwandt, R.: A dedicated sieving hardware. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol. 2567, pp. 254–266. Springer, Heidelberg (2002)
Bernstein, D.J.: Circuits for integer factorizaion: a proposal (2002), Available at http://cr.yp.to/factorization.html#nfscircuit )
Golliver, R.A., Lenstra, A.K., McCurley, K.S.: Lattice sieving and trial division. In: Huang, M.-D.A., Adleman, L.M. (eds.) ANTS 1994. LNCS, vol. 877, pp. 18–27. Springer, Heidelberg (1994)
Silverman, R.D.: The multiple polynomial quadratic sieve. Mathematics of Computation 48, 329–339 (1987)
Shamir, A., Tromer, E.: Factoring large numbers with the TWIRL device. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 1–26. Springer, Heidelberg (2003)
Bahr, F., Franke, J., Kleinjung, T.: Factorization of 158-digit cofactor of 2953 + 1 (2002), Available at http://www.crypto-world.com/announcements/c158.txt
Riesel, H.: Prime Numbers and Computer Methods for Factorization, 2nd edn. Progress in Mathematics, vol. 126. Birkhäuser, Basel (1993)
Cavallar, S., Dodson, B., Lenstra, A.K., Lioen, W., Montgomery, P.L., Murphy, B., te Riele, H., Aardal, K., Gilchrist, J., Guillerm, G., Leyland, P., Marchand, J., Morain, F., Muffett, A., Putnam, C., Zimmermann, P.: Factorization of a 512-bit RSA modulus. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 1–18. Springer, Heidelberg (2000)
Contini, S.: Factor world! (2002), http://www.crypto-world.com/FactorWorld.html
Wagstaff, S.S.: The Cunningham Project (2003), http://www.cerias.purdue.edu/homes/ssw/cun/
Aoki, K., Kida, Y., Shimoyama, T., Sonoda, Y., Ueda, H.: GNFS164 (2003), http://www.rkmath.rikkyo.ac.jp/~kida/gnfs164e.htm
Aoki, K., Kida, Y., Shimoyama, T., Sonoda, Y., Ueda, H.: SNFS248 (2004), http://www.rkmath.rikkyo.ac.jp/~kida/snfs248e.htm
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aoki, K., Ueda, H. (2004). Sieving Using Bucket Sort. In: Lee, P.J. (eds) Advances in Cryptology - ASIACRYPT 2004. ASIACRYPT 2004. Lecture Notes in Computer Science, vol 3329. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30539-2_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-30539-2_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23975-8
Online ISBN: 978-3-540-30539-2
eBook Packages: Springer Book Archive