|
|
|
Joppe Willem Bos
|
|
Doctoral Program in Computer, Communication and Information Sciences
|
Master of Science
birth date: 04.11.1982
nationality: Dutch
|
office(s):
INJ332
phone(s): [+41 21 69] 36685
|
|
|
MISSION
|
|
My research interests include cryptanalysis, fast arithmetic and efficient implementations of cryptologic algorithms with a focus on elliptic curve cryptography and integer factorization algorithms.
|
|
NEWS
|
News in which I am involved:
June 2011, A new factorization record: Largest factorization of a Cunningham number with the general number field sieve: C197 from 2,1196+ factors as P77 * P120.
March 2010, We found a new ECM record factor of 73-digits on our PS3-cluster!
January 2010, Factorization of a 768-bit RSA modulus: summary, paper
July 2009, A new ECDLP record: PlayStation 3 computing breaks 260 barrier: 112-bit prime ECDLP solved.
June 2009, A new factorization record: Largest factorization of a Cunningham number with the general number field sieve: C182 from 2,1157- factors as P91 * P92.
|
|
Education
|
M.Sc., Grid Computing, University of Amsterdam, September 2004 - December 2006
B.Sc., Computer Science , University of Amsterdam , September 2001 - June 2004
|
|
Journal Publications
|
Joppe W. Bos, Marcelo E. Kaihara, Thorsten Kleinjung, Arjen K. Lenstra, Peter L. Montgomery: Solving a 112-bit Prime Elliptic Curve Discrete Logarithm Problem on Game Consoles using Sloppy Reduction
In The International Journal of Applied Cryptography, 2011 (to appear)
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, Heinz Stockinger: A heterogeneous computing environment to solve the 768-bit RSA challenge
In Cluster Computing: the Journal of Networks, Software Tools and Applications, 2010
|
|
Conference Publications
|
Joppe W. Bos, Onur Özen, Martijn Stam: Efficient Hashing using the AES Instruction Set
In Cryptographic Hardware and Embedded Systems (CHES), volume 6917 of LNCS, pages 507-522, 2011
Full version: ePrint Archive Report 2010/576
Joppe W. Bos, Thorsten Kleinjung, Arjen K. Lenstra and Peter L. Montgomery: Efficient SIMD arithmetic modulo a Mersenne number
In 20th IEEE Symposium on Computer Arithmetic (ARITH-20), pages 213-221, 2011
Supersedes: ePrint Archive Report 2010/338
Joppe W. Bos, Deian Stefan: Performance Analysis of the SHA-3 Candidates on Exotic Multi-Core Architectures
In Cryptographic Hardware and Embedded Systems (CHES) 2010, volume 6225 of LNCS, pages 279-293, 2010
Thorsten Kleinjung, Kazumaro Aoki, Jens Franke, Arjen Lenstra, Emmanuel Thomé, Joppe Bos, Pierrick Gaudry, Alexander Kruppa, Peter Montgomery, Dag Arne Osvik, Herman te Riele, Andrey Timofeev, and Paul Zimmermann: Factorization of a 768-bit RSA modulus
In CRYPTO 2010, volume 6223 of LNCS, pages 333-350, 2010
Supersedes: ePrint Archive Report 2010/006
Joppe W. Bos, Thorsten Kleinjung, Arjen K. Lenstra: On the Use of the Negation Map in the Pollard Rho Method
In Algorithmic Number Theory (ANTS) 2010, volume 6197 of LNCS, pages 67-83, 2010
Joppe W. Bos: High-Performance Modular Multiplication on the Cell Processor
In Arithmetic of Finite Fields (WAIFI) 2010, volume 6087 of LNCS, pages 7-24, 2010
Supersedes: Handouts of SPEED-CC 2009, pages 35-52
Joppe W. Bos, Thorsten Kleinjung, Ruben Niederhagen, Peter Schwabe: ECC2K-130 on Cell CPUs
In Africacrypt 2010, volume 6055 of LNCS, pages 225-242, 2010
Supersedes: ePrint Archive Report 2010/077
Dag Arne Osvik, Joppe W. Bos, Deian Stefan, David Canright: Fast Software AES Encryption
In Fast Software Encryption (FSE) 2010, volume 6147 of LNCS, pages 75-93, 2010
Supersedes: Handouts of SPEED-CC 2009, pages 19-34 and ePrint Archive: Report 2009/501
Joppe W. Bos, Onur Özen, Jean-Pierre Hubaux: Analysis and Optimization of Cryptographically Generated Addresses
In Information Security (ISC) 2009, volume 5735 of LNCS, pages 17-32, 2009.
Joppe W. Bos, Marcelo E. Kaihara: Montgomery Multiplication on the Cell
In Parallel Processing and Applied Mathematics (PPAM) 2009, volume 6067 of LNCS, pages 477-485, 2010.
Joppe W. Bos, Nathalie Casati, Dag Arne Osvik: Multi-Stream Hashing on the PlayStation 3
To appear in: Proceedings of Applied Parallel Computing (PARA) 2008, Minisymposium on Cell/B.E. Technologies
|
|
Technical Reports
|
Daniel V. Bailey and 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
Cryptology ePrint Archive: Report 2009/541
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
Cryptology ePrint Archive: Report 2009/389
Joppe W. Bos, Marcelo E. Kaihara, Peter L. Montgomery: Pollard rho on the PlayStation 3
Handouts of SHARCS 2009, pages 35-50
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, Leif Uhsadel: The Certicom Challenges ECC2-X
Handouts of SHARCS 2009, pages 51-82 and ePrint Archive: Report 2009/466
|
|
|
Student