Jean-Luc Beuchat

•    
• Vitæ
• Events
• Research
• Teaching Material
• Photography
• Contact

Who am I?

I am an associate professor in the Graduate School of Systems and Information Engineering at the University of Tsukuba, Japan.

My research focuses on the hardware implementation of arithmetic circuits for cryptographic applications.

My curriculum vitæ is available in pdf.

Forthcoming Events

• Africacrypt 2010, Stellenbosch, South Africa, May 3-6, 2010
• PQCrypto 2010, Darmstadt, Germany, May 25-28, 2010
• Eurocrypt 2010, Nice, France, May 30-June 3, 2010
• WAIFI 2010, Istanbul, Turkey, June 27-30, 2010
• Latincrypt 2010, Puebla, Mexico, August 8-11, 2010
• Crypto 2010, Santa Barbara, USA, August 15-19, 2010
• CHES 2010, Santa Barbara, USA, August 17-20, 2010
• Asiacrypt 2010, Singapore, December 5-9, 2010
• Pairing 2010, Yamanaka Hot Spring, Japan, December 13-15, 2010

Research

• Complete list of publications
• Co-author index
• Selected publications:
  • Jean-Luc Beuchat, Jérémie Detrey, Nicolas Estibals, Eiji Okamoto, and Francisco Rodríguez-Henríquez. Fast Architectures for the η_T Pairing over Small-Characteristic Supersingular Elliptic Curves Cryptology ePrint Archive, Report 2009/398, 2009.

    Article:

    [ www ][ pdf ][ bib ]

  • Jean-Luc Beuchat, Emmanuel López-Trejo, Luis Martínez-Ramos, Shigeo Mitsunari, and Francisco Rodríguez-Henríquez. Multi-core Implementation of the Tate Pairing over Supersingular Elliptic Curves. In J.A. Garay, A. Miyaji, and A. Otsuka, editors, Cryptology and Network Security - CANS 2009, number 5888 in Lecture Notes in Computer Science, pages 413-432. Springer, 2009. © Springer-Verlag.

    DOI:	[ 10.1007/978-3-642-10433-6 ]
    Article:	[ pdf ][ bib ]

    Pre-print version:

    [ www ][ pdf ][ bib ]

  • Jean-Luc Beuchat, Jérémie Detrey, Nicolas Estibals, Eiji Okamoto, and Francisco Rodríguez-Henríquez. Hardware Accelerator for the Tate Pairing in Characteristic Three Based on Karatsuba-Ofman Multipliers. In C. Clavier and K. Gaj, editors, Cryptographic Hardware and Embedded Systems - CHES 2009, number 5747 in Lecture Notes in Computer Science, pages 225-239. Springer, 2009. © Springer-Verlag. Best paper award.

    DOI:	[ 10.1007/978-3-642-04138-9_17 ]
    Article:	[ pdf ][ bib ]

    Pre-print version:

    [ www ][ pdf ][ bib ]

    Supplementary material:

    Scheduling

  • Jean-Luc Beuchat and Jean-Michel Muller. Automatic Generation of Modular Multipliers for FPGA Applications. IEEE Transactions on Computers, 57(12):1600-1613, 2008.

    DOI:	[ 10.1109/TC.2008.102 ]
    Article:	[ pdf ][ bib ]

    Pre-print version:

    [ www ][ pdf ][ bib ]

  • Jean-Luc Beuchat, Nicolas Brisebarre, Jérémie Detrey, Eiji Okamoto, Masaaki Shirase, and Tsuyoshi Takagi. Algorithms and Arithmetic Operators for Computing the η_T Pairing in Characteristic Three. In W. Geiselmann, Ç.K. Koç, and R. Steinwandt, editors, IEEE Transactions on Computers, Special Section on Special-Purpose Hardware for Cryptography and Cryptanalysis, 57(11):1454-1468, 2008.

    DOI:	[ 10.1109/TC.2008.103 ]
    Article:	[ pdf ][ bib ]

    Pre-print version:

    [ www ][ pdf ][ bib ]

  • Jean-Luc Beuchat, Nicolas Brisebarre, Jérémie Detrey, Eiji Okamoto, and Francisco Rodríguez-Henríquez. A Comparison Between Hardware Accelerators for the Modified Tate Pairing over F_2^m and F_3^m. In S.D. Galbraith and K.G. Paterson, editors, Pairing 2008, number 5209 in Lecture Notes in Computer Science, pages 297-315. Springer, 2008. © Springer-Verlag.

    DOI:	[ 10.1007/978-3-540-85538-5_20 ]
    Article:	[ pdf ][ bib ]

    Pre-print version:

    [ www ][ pdf ][ bib ]

• Recent talks:
  • Hardware Operators for Pairing-Based Cryptography - Part I: Because size matters. [ Slides ]
  • Hardware Operators for Pairing-Based Cryptography - Part II: Because speed also matters. [ Slides ]

Teaching Material

• Jean-Luc Beuchat. An Introduction to Pairing-Based Cryptography. Computer Science Department, Centro de Investigación y de Estudios Avanzados del IPN, Mexico City, Mexico. July 2008. [ Slides ]
• Jean-Luc Beuchat. Algorithms and Number Systems for Digital Arithmetic. Laboratory of Cryptography and Information Security, University of Tsukuba, Tsukuba, Japan. April 2006. [ Slides ]
• Jean-Luc Beuchat. Une introduction à l'arithmétique des ordinateurs. Département des sciences appliquées, Université du Québec à Chicoutimi, Chicoutimi, Canada. 2004.
  1. Quelques systèmes de numération. [ Slides ]
  2. Une famille d'algorithmes de multiplication modulaire. [ Slides ]
  3. Arithmétique modulo (2ⁿ+1) - Implantation sur FPGA et application à l'algorithme de cryptage IDEA. [ Slides ]
  4. Conception de processeurs spécifiques pour des applications cryptographiques. [ Slides ]
• Jean-Luc Beuchat. Quelques additionneurs et multiplieurs modulaires sur FPGA. École Normale Supérieure de Lyon, Lyon, France. 2004. [ Slides ]
• Jean-Luc Beuchat and Jacques-Olivier Haenni. Automate cellulaire autoréplicateur de von Neumann. Logic Systems Laboratory, Swiss Federal Institute of Technology at Lausanne. March 2001. [ pdf ][ Slides ]
• Jean-Luc Beuchat. Systèmes neuromimétiques à apprentissage supervisé. Logic Systems Laboratory, Swiss Federal Institute of Technology at Lausanne. April 1999. [ pdf ]

Photography

• My picture gallery

Contact