Integer number crunching on the Cell processor

Proceedings of the International Conference on Parallel Processing

Volumn , Issue , 2010, Pages 508-515

  Chen, Hsieh Chung ^a   Cheng, Chen Mou ^a   Hung, Shih Hao ^a   Lin, Zong Cing ^a  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

Cell processor; Elliptic curve method; Integer factorization; Multi core architecture;

Indexed keywords

CELL PROCESSOR; CRITICAL STEPS; CRYPTOSYSTEMS; ELLIPTIC CURVE; ELLIPTIC CURVE METHOD; GRAPHICS CARD; GRAPHICS PROCESSING UNITS; HARDWARE PLATFORM; INTEGER FACTORIZATION; INTEGER NUMBERS; MULTICORE ARCHITECTURES; NUMBER FIELD SIEVE; PRIME FACTORS;

ARCHITECTURAL DESIGN; BENCHMARKING; CRYPTOGRAPHY; FACTORIZATION; GEOMETRY; PROGRAM PROCESSORS;

COMPUTER ARCHITECTURE;

EID: 78649622407     PISSN: 01903918     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPP.2010.59     Document Type: Conference Paper

References (16)

1. K. Aoki, J. Franke, T. Kleinjung, A. Lenstra, and D. Osvik, "A kilobit special number field sieve factorization," in Proceedings of ASIACRYPT 2007, (Kuching, Sarawak, Malaysia), December 2007.
2. T. Kleinjung, K. Aoki, J. Franke, A. K. Lenstra, E. Thomé, J. W. Bos, P. Gaudry, A. Kruppa, P. L. Montgomery, D. A. Osvik, H. te Riele, A. Timofeev, and P. Zimmermann, "Factorization of a 768-bit RSA modulus." Cryptology ePrint Archive, Report 2010/006, 2010. http://eprint.iacr.org/2010/ 006.
3. H. W. Lenstra, "Factoring integers with elliptic curves," The Annals of Mathematics, vol. 126, no. 3, pp. 649-673, 1987.
4. D. J. Bernstein, T.-R. Chen, C.-M. Cheng, T. Lange, and B.-Y. Yang, "ECM on graphics cards," in Proceedings of EUROCRYPT 2009, (Cologne, Germany), April 2009.
5. "50 largest factors found by ECM." http://www.loria.fr/- zimmerma/records/top50.html.
6. S. Cavallar, W. M. Lioen, H. J. J. T. Riele, B. Dodson, A. K. Lenstra, P. L. Montgomery, B. M. E. Al, M. C. (smc, T. D. Foundation, S. Cavallar, W. Lioen, H. T. Riele, B. Dodson, A. K. Lenstra, P. L. Montgomery, B. Murphy, K. Aardal, J. Gilchrist, and G. Guillerm, "Factorization of a 512-bit RSA modulus," in Proceedings of EUROCRYPT 2000, (Bruges, Belgium), May 2000.
7. N. Costigan and M. Scott, "Accelerating SSL using the vector processors in IBM's Cell Broadband Engine for Sony's Playstation 3." Cryptology ePrint Archive, Report 2007/061, 2007. http://eprint.iacr.org/2007/ 061.
8. D. J. Bernstein, P. Birkner, T. Lange, and C. Peters, "ECM using Edwards curves." Cryptology ePrint Archive, Report 2008/016, 2008. http://eprint.iacr.org/2008/016.
9. H. M. Edwards, "A normal form for elliptic curves," Bulletin of the American Mathematical Society, vol. 44, no. 3, pp. 393-422, 2007.
10. D. J. Bernstein and T. Lange, "Faster addition and doubling on elliptic curves," in Proceedings of ASIACRYPT 2007, (Kuching, Sarawak, Malaysia), December 2007.
11. D. J. Bernstein, P. Birkner, T. Lange, and C. Peters, "Optimizing double-base elliptic-curve single-scalar multiplication," in Proceedings of INDOCRYPT 2007, (Chennai, India), December 2007.
12. D. J. Bernstein and T. Lange, "Inverted Edwards coordinates." Cryptology ePrint Archive, Report 2007/410, 2007. http://eprint.iacr.org/2007/ 410.
13. D. J. Bernstein and T. Lange, "Analysis and optimization of elliptic-curve single-scalar multiplication." Cryptology ePrint Archive, Report 2007/455, 2007. http://eprint.iacr.org/2007/455.
14. H. Hisil, K. K. Wong, G. Carter, and E. Dawson, "Faster group operations on elliptic curves." Cryptology ePrint Archive, Report 2007/441, 2007. http://eprint.iacr.org/2007/441.
15. P. L. Montgomery, "Modular multiplication without trial division," Mathematics of Computation, vol. 44, no. 170, pp. 519-521, 1985.
16. "IBM full-system simulator for the Cell Broadband Engine processor." http://www.alphaworks.ibm.com/tech/cellsystemsim/.