Joppe Bos
POST DOC RESEARCHER
.
I am a post-doctoral researcher in the Cryptography Research Group at Microsoft Research, Redmond. I obtained my PhD in the laboratory for cryptologic algorithms at EPFL, Switzerland under supervision of Prof. Arjen Lenstra in 2012. My research interest is in public-key cryptanalysis with a focus on the integer factorization and the (elliptic curve) discrete logarithm problem together with computational number theory and high-performance arithmetic.
Contact information:
One Microsoft Way, 112/3163
Redmond, WA 98052
One Microsoft Way, 112/3163
Redmond, WA 98052
+1 (425) 421 3841
I serve(d) on the following program committees
- Selected Areas in Cryptography (SAC) 2013
Publications
2013
- Joppe W. Bos, Craig Costello, Huseyin Hisil, and Kristin Lauter, Fast Cryptography in Genus 2, in Eurocrypt 2013, Lecture Notes in Computer Science, May 2013
- Joppe W. Bos, Craig Costello, Huseyin Hisil, and Kristin Lauter, High-Performance Scalar Multiplication using 8-Dimensional GLV/GLS Decomposition, no. MSR-TR-2013-29, March 2013
- Joppe W. Bos, Kristin Lauter, Jake Loftus, and Michael Naehrig, Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme, no. MSR-TR-2013-23, February 2013
2012
- Joppe W. Bos and Thorsten Kleinjung, ECM at Work, in Asiacrypt 2012, Springer Verlag, December 2012
- Arjen K. Lenstra, James P. Hughes, Maxime Augier, Joppe W. Bos, Thorsten Kleinjung, and Christophe Wachter, Public Keys, in Crypto 2012, Springer, August 2012
- Joppe W. Bos, Low-Latency Elliptic Curve Scalar Multiplication, in International Journal of Parallel Programming, vol. 40, no. 5, pp. 532-550, Springer, May 2012
- Joppe W. Bos, Alina Dudeanu, and Dimitar Jetchev, Collision Bounds for the Additive Pollard Rho Algorithm for Solving Discrete Logarithms, February 2012
- Razvan Barbulescu, Joppe W. Bos, Cyril Bouvier, Thorsten Kleinjung, and Peter L. Montgomery, Finding ECM-Friendly Curves through a Study of Galois Properties, in Algorithmic Number Theory – ANTS-X, Mathematical Science Publishers, 2012
- Joppe W. Bos, Marcelo E. Kaihara, Thorsten Kleinjung, Arjen K. Lenstra, and Peter L. Montgomery, Solving a 112-bit Prime Elliptic Curve Discrete Logarithm Problem on Game Consoles using Sloppy Reduction, in International Journal of Applied Cryptography, vol. 2, no. 3, pp. 212–228, Inderscience Enterprises Ltd., 2012
2011
- Joppe W. Bos, Onur Özen, and Martijn Stam, Efficient Hashing using the AES Instruction Set, in Cryptographic Hardware and Embedded Systems – CHES 2011, Springer, 2011
- Joppe W. Bos, Thorsten Kleinjung, Arjen K. Lenstra, and Peter L. Montgomery, Efficient SIMD Arithmetic modulo a Mersenne Number, in IEEE Symposium on Computer Arithmetic – ARITH-20, IEEE Computer Society, 2011
2010
- Joppe W. Bos and Marcelo E. Kaihara, Montgomery Multiplication on the Cell, in Parallel Processing and Applied Mathematics – PPAM 2009, Springer, 2010
- Joppe W. Bos and Deian Stefan, Performance Analysis of the SHA-3 Candidates on Exotic Multi-core Architectures, in Cryptographic Hardware and Embedded Systems – CHES 2010, Springer, 2010
- Joppe W. Bos, Thorsten Kleinjung, and Arjen K. Lenstra, On the Use of the Negation Map in the Pollard Rho Method, in Algorithmic Number Theory – ANTS-IX, Springer, 2010
- Joppe W. Bos, Thorsten Kleinjung, Ruben Niederhagen, and Peter Schwabe, ECC2K-130 on Cell CPUs, in Africacrypt 2010, Springer, 2010
- Thorsten Kleinjung, Joppe W. Bos, Arjen K. Lenstra, Dag Arne Osvik, Kazumaro Aoki, Scott Contini, Jens Franke, Emmanuel Thomé, Pascal Jermini, Michela Thiémard, Paul Leyland, Peter L. Montgomery, Andrey Timofeev, and Heinz Stockinger, A heterogeneous computing environment to solve the 768-bit RSA challenge, in Cluster Computing, vol. 15, no. 1, pp. 1–16, Springer, 2010
- Thorsten Kleinjung, Kazumaro Aoki, Jens Franke, Arjen K. Lenstra, Emmanuel Thomé, Joppe W. Bos, Pierrick Gaudry, Alexander Kruppa, Peter L. Montgomery, Dag Arne Osvik, Herman te Riele, Andrey Timofeev, and Paul Zimmermann, Factorization of a 768-bit RSA modulus, in Crypto 2010, Springer, 2010
- Dag Arne Osvik, Joppe W. Bos, Deian Stefan, and David Canright, Fast Software AES Encryption, in Fast Software Encryption – FSE 2010, Springer, 2010
- Joppe W. Bos, High-Performance Modular Multiplication on the Cell Processor, in Arithmetic of Finite Fields – WAIFI 2010, Springer, 2010
2009
- Daniel V. Bailey, Lejla Batina, Daniel J. Bernstein, Peter Birkner, Joppe W. Bos, Hsieh-Chung Chen, Chen-Mou Cheng, Gauthier van Damme, Giacomo de Meulenaer, Luis Julian Dominguez Perez, Junfeng Fan, Tim Güneysu, Frank Gurkaynak, Thorsten Kleinjung, Tanja Lange, Nele Mentens, Ruben Niederhagen, Christof Paar, Francesco Regazzoni, Peter Schwabe, Leif Uhsadel, Anthony Van Herrewege, and Bo-Yin Yang, Breaking ECC2K-130, November 2009
- Joppe W. Bos, Marcelo E. Kaihara, and Peter L. Montgomery, Pollard Rho on the PlayStation 3, September 2009
- Daniel V. Bailey, Brian Baldwin, Lejla Batina, Daniel J. Bernstein, Peter Birkner, Joppe W. Bos, Gauthier van Damme, Giacomo de Meulenaer, Junfeng Fan, Tim Güneysu, Frank Gurkaynak, Thorsten Kleinjung, Tanja Lange, Nele Mentens, Christof Paar, Francesco Regazzoni, Peter Schwabe, and Leif Uhsadel, The Certicom Challenges ECC2-X, September 2009
- Joppe W. Bos, Marcelo E. Kaihara, Thorsten Kleinjung, Arjen K. Lenstra, and Peter L. Montgomery, On the Security of 1024-bit RSA and 160-bit Elliptic Curve Cryptography, August 2009
- Joppe W. Bos, Onur Özen, and Jean-Pierre Hubaux, Analysis and Optimization of Cryptographically Generated Addresses, in Information Security Conference – ISC 2009, Springer, 2009
2008
- Joppe W. Bos, Nathalie Casati, and Dag Arne Osvik, Multi-Stream Hashing on the PlayStation 3, in Applied Parallel Computing – PARA 2008, Springer, 2008
Presentations
- High-Performance Cryptology on GPUs: GPU Technology Conference, San Jose, CA, USA, March 21, 2013
- Two is more than one: University of Bristol, Bristol, UK, December 18, 2012
- ECM at Work: University of Bristol, Bristol, UK, December 17, 2012
- Homomorphic Encryption from RLWE – Schemes and Parameter: EPFL, Lausanne, Switzerland, December 12, 2012
- Two is more than one: EPFL, Lausanne, Switzerland, December 10, 2012
- ECM at Work: Asiacrypt, Beijing, China, December 5, 2012
- Recent Developments in ECM: Workshop on Computational Number Theory, CWI, Amsterdam, the Netherlands. December 1 - 2, 2011
- How to solve a 112-bit ECDLP using game consoles: Microsoft Research, Redmond, WA, USA. October 13 2011
- High-performance implementations on the Cell Broadband Engine Architecture: Cryptography Group, University of Bristol, England. November 25, 2010
- Performance Analysis of the SHA-3 Candidates on Exotic Multi-core Architectures: Cryptographic Hardware and Embedded Systems – CHES, Santa Barbara, California, USA. August 17-20, 2010
- On the Use of the Negation Map in the Pollard Rho Method: Algorithmic Number Theory Symposium – ANTS-IX, Nancy, INRIA, France. July 19-23, 2010.
- High-Performance Modular Multiplication on the Cell Processor: Workshop on the Arithmetic of Finite Fields – WAIFI 2010, Istanbul, Turkey. June 27-30, 2010
- Pollard Rho on the PlayStation 3: Special-purpose Hardware for Attacking Cryptographic Systems – SHARCS, Lausanne, EPFL, Switzerland. 9 – 10 September 2009
- Cryptanalysis on a PlayStation 3 Cluster: Scientific POWER Meeting 2009, Mazurian Lakes area in Poland on March 26-28 2009
- Cryptanalysis on a PlayStation 3 Cluster: CADO workshop on integer factorization, INRIA Nancy, France on October 7-9, 2008
