Abstract
Recently, dedicated factoring devices have attracted much attention since they might be a threat for a current RSA-based cryptosystems. In some devices, the clockwise transposition routing is used as a key technique, however, because of the lack of theoretic proof of the termination, some additional circuits are required. In this paper, we analyze the packet exchanging rule for the clockwise transposition and propose some possible alternatives with keeping the “farthest-first” property. Although we have no theoretic proof of the termination, experimental results show practical availability in the clockwise transposition. We also propose an improvement on the routing algorithm for the relation finding step in the number field sieve method of factorization, which establishes two times speed-up.
A part of this work is financially supported by a consignment research from the National Institute of Information and Communications Technology (NICT), Japan.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bernstein, D.J.: Circuits for Integer Factorization: A Proposal (preprint, 2001), http://cr.yp.to/papers/nfscircuit.pdf
Bahr, F., Böhm, M., Franke, J., Kleinjung, T.: RSA200 (May 2005), http://www.crypto-world.com/announcements/rsa200.txt
Franke, J., Kleinjung, T., Paar, C., Pelzl, J., Priplata, C., Stahlke, C.: SHARK: A Realizable Special Hardware Sieving Device for Factoring 1024-Bit Integers. In: Rao, J.R., Sunar, B. (eds.) CHES 2005. LNCS, vol. 3659, pp. 27–37. Springer, Heidelberg (2005)
Geiselmann, W., Köpfer, H., Steinwandt, R., Tromer, E.: Improved Routing-based Linear Algebra for the Number Field Sieve. In: IEEE ITCC 2005 (2005)
Geiselmann, W., Steinwandt, R.: A Dedicated Sieving Hardware. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol. 2567, pp. 254–266. Springer, Heidelberg (2002)
Geiselmann, W., Steinwandt, R.: Hardware to Solve Sparse Systems of Linear Equations over GF(2). In: D.Walter, C., Koç, Ç.K., Paar, C. (eds.) CHES 2003. LNCS, vol. 2779, pp. 51–61. Springer, Heidelberg (2003)
Geiselmann, W., Steinwandt, R.: Yet Another Sieving Device. In: Okamoto, T. (ed.) CT-RSA 2004. LNCS, vol. 2964, pp. 278–291. Springer, Heidelberg (2004)
Lenstra, A.K., Lenstra, H.W. (eds.): The development of the number field sieve. Lecture Notes in Mathematics (LNM), vol. 1554. Springer, Heidelberg (1993)
Lenstra, A.K., Lenstra, H.W., Manasse, M.S., Pollard, J.M.: The Number Field Sieve. In: STOC 1990, pp. 564–572 (1990)
Lenstra, A.K., Shamir, A., Tomlinson, J., Tromer, E.: Analysis of Bernstein. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 1–26. Springer, Heidelberg (2002)
Shamir, A.: Factoring Large Numbers with the TWINKLE Device (extended abstract). In: Koç, Ç.K., Paar, C. (eds.) CHES 1999. LNCS, vol. 1717, pp. 2–12. Springer, Heidelberg (1999)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Izu, T., Kunihiro, N., Ohta, K., Shimoyama, T. (2006). Analysis on the Clockwise Transposition Routing for Dedicated Factoring Devices. In: Song, JS., Kwon, T., Yung, M. (eds) Information Security Applications. WISA 2005. Lecture Notes in Computer Science, vol 3786. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11604938_18
Download citation
DOI: https://doi.org/10.1007/11604938_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31012-9
Online ISBN: 978-3-540-33153-7
eBook Packages: Computer ScienceComputer Science (R0)