Efficient SIMD arithmetic modulo a Mersenne number

Proceedings - Symposium on Computer Arithmetic

Volumn , Issue , 2011, Pages 213-221

  Bos, Joppe W ^a   Kleinjung, Thorsten ^a   Lenstra, Arjen K ^a   Montgomery, Peter L ^b  

^a EPFL   (Switzerland)

^b MICROSOFT RESEARCH   (United States)

Author keywords

Cell processor; Elliptic curve method; Integer factorization; Mersenne number; Single Instruction Multiple Data

Indexed keywords

CELL PROCESSOR; ELLIPTIC CURVE; INTEGER FACTORIZATION; MERSENNE NUMBER; SINGLE INSTRUCTION MULTIPLE DATA;

FACTORIZATION;

INTERACTIVE COMPUTER GRAPHICS;

EID: 80055031913     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ARITH.2011.37     Document Type: Conference Paper

References (57)

1. R. D. Merrill, "Improving digital computer performance using residue number theory," Electronic Computers, IEEE Transactions on, vol. EC-13, no. 2, pp. 93-101, April 1964.
2. H. L. Garner, "The residue number system," IRE Transactions on Electronic Computers, vol. 8, pp. 140-147, 1959.
3. R. Crandall and B. Fagin, "Discrete weighted transforms and largeinteger arithmetic," Mathematics of Computation, vol. 62, no. 205, pp. 305-324, 1994.
4. F. Taylor, "Large moduli multipliers for signal processing," Circuits and Systems, IEEE Transactions on, vol. 28, no. 7, pp. 731-736, July 1981.
5. n - 1," IEEE Transactions on Computers, vol. 41, pp. 957-961, 1992.
6. V. S. Dimitrov, T. V. Cooklev, and B. D. Donevsky, "Generalized Fermat-Mersenne number theoretic transform," Circuits and Systems II: Analog and Digital Signal Processing, IEEE Transactions on, vol. 41, no. 2, pp. 133-139, February 1994.
7. N. Koblitz, "Elliptic curve cryptosystems," Mathematics of Computation, vol. 48, pp. 203-209, 1987.
8. V. S. Miller, "Use of elliptic curves in cryptography," in Crypto, ser. LNCS, vol. 218, 1985, pp. 417-426.
9. D. J. Bernstein, "Curve25519: New Diffie-Hellman speed records," in Public Key Cryptography - PKC, ser. LNCS, vol. 3958, 2006, pp. 207-228.
10. n ±1, y = 2; 3; 5; 6; 7; 10; 11; 12 up to high powers," Hodgson, London, 1925.
11. n±1, b = 2; 3; 5; 6; 7; 10; 11; 12 Up to High Powers, ser. Contemporary Mathematics. American Mathematical Society, First edition, 1983, Second edition, 1988, Third edition, 2002., 1983, vol. 22.
12. D. N. Lehmer, "Hunting big game in the theory of numbers," Scripta Mathematica, pp. 229-235, March 1933.
13. 7," Mathematics of Computation, vol. 29, no. 129, pp. 183-205, 1975.
14. R. P. Brent and J. M. Pollard, "Factorization of the eighth Fermat number," Mathematics of Computation, vol. 36, no. 154, pp. 627-630, 1981.
15. J. M. Pollard, "The lattice sieve," pages 43-49 in [19].
16. A. K. Lenstra, H. W. Lenstra Jr., M. S. Manasse, and J. M. Pollard, "The factorization of the ninth Fermat number," Mathematics of Computation, vol. 61, no. 203, pp. 319-349, 1993.
17. R. P. Brent, "Factorization of the tenth Fermat number," Mathematics of Computation, vol. 68, no. 225, pp. 429-451, 1999.
18. J. Harrison, "Isolating critical cases for reciprocals using integer factorization," in IEEE Symposium on Computer Arithmetic - ARITH-16, 2003, pp. 148-157.
19. A. K. Lenstra and H. W. Lenstra, Jr., The Development of the Number Field Sieve, ser. LNM. Springer-Verlag, 1993, vol. 1554.
20. J. A. Solinas, "Generalized Mersenne numbers," Centre for Applied Cryptographic Research, University of Waterloo, Technical Report CORR 99-39, 1999.
21. J. Chung and M. A. Hasan, "More generalized Mersenne numbers," in Selected Areas in Cryptography - SEC, ser. LNCS, vol. 3006. Springer, 2003, pp. 335-347.
22. J.-C. Bajard, L. Imbert, and T. Plantard, "Modular number systems: Beyond the Mersenne family," in Selected Areas in Cryptography - SEC, ser. LNCS, vol. 3357. Springer, 2004, pp. 159-169.
23. S. Boussakta and A. G. J. Holt, "New transform using the Mersenne numbers," Vision, Image and Signal Processing, IEE Proceedings -, vol. 142, no. 6, pp. 381-388, December 1995.
24. J.-C. Bajard, N. Meloni, and T. Plantard, "Efficient RNS bases for cryptography," in IMACS, 2005.
25. U.S. Department of Commerce and National Institute of Standards and Technology, "Digital Signature Standard (DSS)," See http://csrc.nist.gov/publications/fips/fips186-3/fips-186-3.pdf, 2009.
26. GIMPS Home Page, "The great internet Mersenne prime search," http://www.mersenne.org, 2010.
27. E. Lucas, "Théorie des fonctions numériques simplement périodiques," American Journal of Mathematics, vol. 1, no. 2, pp. 184-196, 1878.
28. D. H. Lehmer, "An extended theory of Lucas' functions," Annals of Mathematics, vol. 31, no. 3, pp. 419-448, 1930.
29. H. W. Lenstra Jr., "Factoring integers with elliptic curves," Annals of Mathematics, vol. 126, pp. 649-673, 1987.
30. R. L. Rivest, A. Shamir, and L. Adleman, "A method for obtaining digital signatures and public-key cryptosystems," Communications of the ACM, vol. 21, pp. 120-126, 1978.
31. A. Shamir, CryptoBytes Technical Newsletter, ftp://ftp.rsasecurity.com/ pub/cryptobytes/crypto1n3.pdf.
32. A. K. Lenstra, "Unbelievable security: Matching AES security using public key systems," in Asiacrypt, ser. LNCS, vol. 2248, 2001, pp. 67-86.
33. M. Stevens, A. K. Lenstra, and B. de Weger, "Predicting the winner of the 2008 US presidential elections using a Sony PlayStation 3," http://www.win.tue.nl/hashclash/Nostradamus/.
34. M. Stevens, A. Sotirov, J. Appelbaum, A. K. Lenstra, D. Molnar, D. A. Osvik, and B. de Weger, "Short chosen-prefix collisions for MD5 and the creation of a rogue CA certificate," in Crypto, ser. LNCS, vol. 5677, 2009, pp. 55-69.
35. J. W. Bos, M. E. Kaihara, T. Kleinjung, A. K. Lenstra, and P. L. Montgomery, "Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction (to appear)," International Journal of Applied Cryptography, 2011.
36. J. W. Bos, T. Kleinjung, R. Niederhagen, and P. Schwabe, "ECC2K-130 on Cell CPUs," in Africacrypt, ser. LNCS, vol. 6055, 2010, pp. 225-242.
37. D. A. Patterson and J. L. Hennessy, Computer Organization and Design (4th Edition): The Hardware/Software Interface. Morgan Kaufmann Publishers Inc., 2009.
38. G. Hotz, "Here's your silver platter," http://rdist.root.org/ 2010/01/27/ how-the-ps3-hypervisor-was-hacked/.
39. N. Costigan and P. Schwabe, "Fast elliptic-curve cryptography on the Cell broadband engine," in Africacrypt, ser. LNCS, vol. 5580, 2009, pp. 368-385.
40. J. W. Bos, "High-performance modular multiplication on the Cell processor," in Arithmetic of Finite Fields - WAIFI, ser. LNCS, vol. 6087, 2010, pp. 7-24.
41. D. J. Bernstein, H.-C. Chen, M.-S. Chen, C.-M. Cheng, C.-H. Hsiao, T. Lange, Z.-C. Lin, and B.-Y. Yang, "The billion-mulmod-per-second PC," in Workshop record of SHARCS'09, 2009, pp. 131-144.
42. H.-C. Chen, C.-M. Cheng, S.-H. Hung, and Z.-C. Lin, "Integer number crunching on the Cell processor," International Conference on Parallel Processing, pp. 508-515, 2010.
43. D. E. Knuth, The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms. Boston, MA, USA: Addison-Wesley Longman Publishing Co., Inc., 1997.
44. A. Karatsuba and Y. Ofman, "Multiplication of many-digital numbers by automatic computers," ser. Proceedings of the USSR Academy of Science, no. 145, 1962, pp. 293-294.
45. D. A. Osvik, J. W. Bos, D. Stefan, and D. Canright, "Fast software AES encryption," in Fast Software Encryption - FSE, ser. LNCS, vol. 6147, 2010, pp. 75-93.
46. J. W. Bos and D. Stefan, "Performance analysis of the SHA-3 candidates on exotic multi-core architectures," in Cryptographic Hardware and Embedded Systems - CHES, ser. LNCS, vol. 6225, 2010, pp. 279-293.
47. P. Zimmermann et al., "GMP-ECM (elliptic curve method for integer factorization)," https://gforge.inria.fr/projects/ecm/, 2010.
48. yoyo@home and M. Thompson, "Found gmp-ecm top50 factor," http://www.loria.fr/~zimmerma/records/p68, 2009.
49. P. Zimmermann and B. Dodson, "20 years of ECM," in Algorithmic Number Theory Symposium - ANTS-VII, ser. LNCS, vol. 4076, 2006, pp. 525-542.
50. D. J. Bernstein, P. Birkner, T. Lange, and C. Peters, "EECM: ECM using Edwards curves," http://eecm.cr.yp.to/, 2010.
51. IBM, "Multi-precision math library," Example Library API Reference, available at http://public.dhe.ibm.com/software/dw/cell/SDK-Example- Library-API-v3.1.pdf.
52. D. J. Bernstein, P. Birkner, T. Lange, and C. Peters, "ECM using Edwards curves," Cryptology ePrint Archive, Report 2008/016, 2008.
53. D. J. Bernstein, T.-R. Chen, C.-M. Cheng, T. Lange, and B.-Y. Yang, "ECM on graphics cards," in Eurocrypt, ser. LNCS, vol. 5479, 2009, pp. 483-501.
54. J. Pelzl, M. Šimka, T. Kleinjung, M. Drutarovský, V. Fischer, and C. Paar, "Area-time efficient hardware architecture for factoring integers with the elliptic curve method," Information Security, IEE Proceedings on, vol. 152, no. 1, pp. 67-78, October 2005.
55. K. Gaj, S. Kwon, P. Baier, P. Kohlbrenner, H. Le, M. Khaleeluddin, and R. Bachimanchi, "Implementing the elliptic curve method of factoring in reconfigurable hardware," in Cryptographic Hardware and Embedded Systems - CHES, ser. LNCS, vol. 4249, 2006, pp. 119-133.
56. G. de Meulenaer, F. Gosset, G. M. de Dormale, and J.-J. Quisquater, "Integer factorization based on elliptic curve method: Towards better exploitation of reconfigurable hardware," in IEEE Symposium on Field-Programmable Custom Computing Machines - FCCM. IEEE Computer Society, 2007, pp. 197-206.
57. T. Granlund et al., GMP: The GNU Multiple Precision Arithmetic Library, Free Software Foundation, Inc, 2011, http://gmplib.org/.