STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Factoring large numbers with programmable hardware
FPGA '00 Proceedings of the 2000 ACM/SIGDA eighth international symposium on Field programmable gate arrays
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
A Montgomery-Like Square Root for the Number Field Sieve
ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory
Factoring Large Numbers with the Twinkle Device (Extended Abstract)
CHES '99 Proceedings of the First International Workshop on Cryptographic Hardware and Embedded Systems
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Hardware Factorization Based on Elliptic Curve Method
FCCM '05 Proceedings of the 13th Annual IEEE Symposium on Field-Programmable Custom Computing Machines
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
Analysis and optimization of the TWINKLE factoring device
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Implementing the elliptic curve method of factoring in reconfigurable hardware
CHES'06 Proceedings of the 8th international conference on Cryptographic Hardware and Embedded Systems
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
A simpler sieving device: combining ECM and TWIRL
ICISC'06 Proceedings of the 9th international conference on Information Security and Cryptology
High-Speed Search System for PGP Passphrases
CANS '08 Proceedings of the 7th International Conference on Cryptology and Network Security
On the strength comparison of the ECDLP and the IFP
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
| Hi-index | 0.00 |
The hardness of the integer factorization problem assures the security of some public-key cryptosystems including RSA, and the number field sieve method (NFS), the most efficient algorithm for factoring large integers currently, is a threat for such cryptosystems. Recently, dedicated factoring devices attract much attention since it might reduce the computing cost of the number field sieve method. In this paper, we report implementational and experimental results of a dedicated sieving device "CAIRN 2" with Xilinx's FPGA which is designed to handle up to 768-bit integers. Used algorithm is based on the line sieving, however, in order to optimize the efficiency, we adapted a new implementational method (the pipelined sieving). In addition, we actually factored a 423-bit integer in about 30 days with the developed device CAIRN 2 for the sieving step and usual PCs for other steps. As far as the authors know, this is the first FPGA implementation and experiment of the sieving step in NFS.