Journal Papers

Conference Papers

Technical Reports

  • Montgomery Multiplication on the Cell, Joppe W. Bos, Marcelo E. Kaihara, Parallel Processing and Applied Mathematics (PPAM 2009), volume 6067 of LNCS, pages 477-485, 2010.
  • Pollard rho on the PlayStation 3, Joppe W. Bos, Marcelo E. Kaihara, Peter L. Montgomery, Handouts of SHARCS 2009, pages 35-50, Sep. 2009.
  • On the Security of 1024-bit RSA and 160-bit Elliptic Curve Cryptography, Joppe W. Bos, Marcelo E. Kaihara, Thorsten Kleinjung, Arjen K. Lenstra and Peter L. Montgomery, Cryptology ePrint Archive: Report 2009/389, Aug. 2009.
  • A Multiplier/Divider for Modular Arithmetic Based on the Extended Euclidean Algorithm, M.E. Kaihara, N. Takagi, Techinical Report of IEICE, VLD2004-1, vol.104, No.78, pg. 1-6., May 2004.
  • A Multiplication Division VLSI Algorithm for Modular Arithmetic, M.E. Kaihara, N. Takagi, LA Symposium, Evolutionary Advancement in Fundamental Theories of Computer Science, pg.201-207, May 2004.
  • A Modular Multiplication/Division Algorithm for VLSI, M.E. Kaihara, N. Takagi, CS Sessions at 2003 IEICE Gen. Conf., Mar. 2003.
  • A Modulo M Multiplier/Divider, M.E. Kaihara, N. Takagi, Technical Report of IEICE, VLD2002-109, vol. 102, No. 476, pg. 163-168, Nov. 2002.

Invited Talks

  • An Implementation of RSA2048 on GPUs Using CUDA, 4es Rencontres Arithmétique de l'Informatique Mathématique (RAIM’11), Perpignan, France, Feb. 2011.(Slides).
  • An Implementation of RSA2048 on GPUs, INRIA Nancy Grand-Est, LORIA, France, Nov. 2010. (Slides).
  • Modular Arithmetic on PlayStation 3, Laboratoire d'Informatique de Paris 6, LIP6, Université Pierre et Marie Curie, CNRS UPMC, Paris, France, Jan. 2010.
  • Pollard Rho sur PlayStation 3, Rencontres Arithmétique de l'Informatique Mathématique (RAIM’09), ENS Lyon, France, Oct. 2009 (Slides).

World Record

  • PlayStation 3 computing breaks 260 barrier: 112-bit prime ECDLP solved (Slides). My contributions to this project: I propose the use of a scaled modulus for fast modular reduction; acceleration by reducing the number of reductions allowing detectable faulty results (sloppy reduction); partial Montgomery reduction for fast normalization modulo p; ECDLP tag-tracing; escaping cycles using doubling to avoid recurring cycles; long integer representation on the Cell and implementation of modular multiplication routines.

Doctoral Dissertation

Disclaimer

  • IEEE. Some material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
  • Springer Verlag. The Author may publish his/her contribution on his/her personal Web page provided that he/she creates a link to the LNCS series Homepage (URL: http://www.springer.de/comp/lncs/index.html) and that together with this electronic version it is clearly pointed out, by prominently adding "© Springer-Verlag", that the copyright for this contribution is held by Springer. From the Publisher's point of view, it would be desirable that the full-text version be made available from the Author's Web page only after a delay of 12 months following the publication of the book, whereas such a delay is not required for the abstract.