Analysis on the clockwise transposition routing for dedicated factoring devices

Authors:
Tetsuya Izu;Noboru Kunihiro;Kazuo Ohta;Takeshi Shimoyama
Affiliations:
Fujitsu Limited, Kawasaki, Japan;The University of Electro-Communications, Chofu, Japan;The University of Electro-Communications, Chofu, Japan;Fujitsu Limited, Kawasaki, Japan
Venue:
WISA'05 Proceedings of the 6th international conference on Information Security Applications
Year:
2005

Citing 6
Cited 2

The number field sieve

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Analysis of Bernstein's Factorization Circuit

ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Factoring Large Numbers with the Twinkle Device (Extended Abstract)

CHES '99 Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems
A Dedicated Sieving Hardware

PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Improved Routing-Based Linear Algebra for the Number Field Sieve

ITCC '05 Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01
SHARK: a realizable special hardware sieving device for factoring 1024-bit integers

CHES'05 Proceedings of the 7th international conference on Cryptographic hardware and embedded systems

Non-wafer-Scale Sieving Hardware for the NFS: Another Attempt to Cope with 1024-Bit

EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
A simpler sieving device: combining ECM and TWIRL

ICISC'06 Proceedings of the 9th international conference on Information Security and Cryptology

Quantified Score

Hi-index	0.00

Visualization

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.