CINXE.COM

<!doctype html> <html lang="en" class="no-js"> <head> <meta charset="utf-8">  <title>Joppe W. Bos - Personal Homepage - Homepage</title> <meta property="og:locale" content="en-US"> <meta property="og:site_name" content="Homepage"> <meta property="og:title" content="Joppe W. Bos - Personal Homepage"> <link rel="canonical" href="https://www.joppebos.com//"> <meta property="og:url" content="https://www.joppebos.com/"> <meta property="og:description" content="About me"> <script type="application/ld+json"> { "@context" : "https://schema.org", "@type" : "Person", "name" : "Joppe W. Bos", "url" : "https://www.joppebos.com/", "sameAs" : null } </script>  <link href="https://www.joppebos.com//feed.xml" type="application/atom+xml" rel="alternate" title="Homepage Feed">  <meta name="HandheldFriendly" content="True"> <meta name="MobileOptimized" content="320"> <meta name="viewport" content="width=device-width, initial-scale=1.0"> <script> document.documentElement.className = document.documentElement.className.replace(/\bno-js\b/g, '') + ' js '; </script>  <link rel="stylesheet" href="https://www.joppebos.com//assets/css/main.css"> <meta http-equiv="cleartype" content="on">  <meta name="theme-color" content="#ffffff"> <link rel="stylesheet" href="https://www.joppebos.com//assets/css/academicons.css"/> <script type="text/x-mathjax-config"> MathJax.Hub.Config({ TeX: { equationNumbers: { autoNumber: "all" } } }); </script> <script type="text/x-mathjax-config"> MathJax.Hub.Config({ tex2jax: { inlineMath: [ ['$','$'], ["\$","\$"] ], processEscapes: true } }); </script> <script src='https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.4/latest.js?config=TeX-MML-AM_CHTML' async></script>  </head> <body>  <div class="masthead"> <div class="masthead__inner-wrap"> <div class="masthead__menu"> <nav id="site-nav" class="greedy-nav"> <button><div class="navicon"></div></button> <ul class="visible-links"> <li class="masthead__menu-item masthead__menu-item--lg"><a href="https://www.joppebos.com/">Homepage</a></li> <li class="masthead__menu-item"><a href="https://www.joppebos.com/publications/">Publications</a></li> <li class="masthead__menu-item"><a href="https://www.joppebos.com/presentations/">Presentations</a></li> <li class="masthead__menu-item"><a href="https://www.joppebos.com/interests/">Interests</a></li> <li class="masthead__menu-item"><a href="https://www.joppebos.com/montgomery/">Montgomery Book</a></li> <li class="masthead__menu-item"><a href="https://www.joppebos.com/lenstra/">Lenstra Book</a></li> </ul> <ul class="hidden-links hidden"></ul> </nav> </div> </div> </div> <div id="main" role="main"> <div class="sidebar sticky"> <div itemscope itemtype="https://schema.org/Person"> <div class="author__avatar"> <img src="https://www.joppebos.com//images/profile.png" class="author__avatar" alt="Joppe W. Bos"> </div> <div class="author__content"> <h3 class="author__name">Joppe W. Bos</h3> <p class="author__bio">Cryptographic Researcher and Technical Director at NXP Semiconductors</p> <p class="author__bio">Secretary of the IACR (2017-2019, 2020-2022)</p> <p class="author__bio">Editor of the Cryptology ePrint Archive (2019-today)</p> <p class="author__bio">Editor-in-Chief of the IACR Communications in Cryptology</p> </div> <div class="author__urls-wrapper"> <button class="btn btn--inverse">Follow</button> <ul class="author__urls social-icons"> <li><i class="fa fa-fw fa-map-marker" aria-hidden="true"></i> Leuven, Belgium</li> <li><a href="mailto:joppe.bos@nxp.com"><i class="fas fa-envelope" aria-hidden="true"></i> Email</a></li> <li><a href="https://www.facebook.com/jwbos"><i class="fab fa-facebook-square" aria-hidden="true"></i> Facebook</a></li> <li><a href="https://www.linkedin.com/in/joppebos"><i class="fab fa-linkedin" aria-hidden="true"></i> LinkedIn</a></li> <li><a href="https://github.com/jwbos"><i class="fab fa-github" aria-hidden="true"></i> Github</a></li> <li><a href="https://scholar.google.com/citations?user=OhI0sU4AAAAJ"><i class="fas fa-graduation-cap"></i> Google Scholar</a></li> </ul> </div> </div> </div> <article class="page" itemscope itemtype="https://schema.org/CreativeWork"> <meta itemprop="headline" content="Joppe W. Bos - Personal Homepage"> <meta itemprop="description" content="About me"> <div class="page__inner-wrap"> <header> <h1 class="page__title" itemprop="headline">Joppe W. Bos - Personal Homepage </h1> </header> <section class="page__content" itemprop="text"> <details> <summary><b><a href="https://www.oakland.edu/enp/">Erdös Number</a></b>: 2</summary> <p> Joppe W. Bos <a href="https://dx.doi.org/10.1504/IJACT.2012.045590">↔</a> Peter L. Montgomery <a href="https://dx.doi.org/10.1016/0097-3165(73)90011-3">↔</a> Paul Erdös. </p> </details> <details> <summary><b><a href="https://simple.wikipedia.org/wiki/Bacon_number">Bacon Number</a></b>: 5</summary> <p> I was in <a href="https://www.imdb.com/title/tt1304151/?ref_=ttep_ep4">S01E04</a> Afzwemmen in the series <a href="https://www.imdb.com/title/tt0372074/?ref_=nv_sr_1?ref_=nv_sr_1">Kinderen van waterland</a> (<a href="https://www.joppebos.com/images/Kinderen_van_waterland_proof.png">proof</a>!) with Frits Jansma who was in <a href="https://www.imdb.com/title/tt0105884/?ref_=fn_tt_tt_4">Het Zakmes</a> with Genio De Groot who was in <a href="https://www.imdb.com/title/tt1846526/?ref_=fn_al_tt_1">The Heineken Kidnapping</a> with Rutger Hauer who was in <a href="https://www.imdb.com/title/tt0401792/?ref_=fn_al_tt_1">Sin City</a> with Elijah Wood who was in <a href="https://www.imdb.com/title/tt1448751/?ref_=fn_al_tt_1">Beyond All Boundaries</a> with Kevin Bacon. </p> </details> <p><a href="https://en.wikipedia.org/wiki/Erdős–Bacon_number"><strong>Erdös-Bacon Number</strong></a>: 7</p> <p>I am a cryptographic researcher in the competence center crypto & security at <a href="https://www.nxp.com/">NXP Semiconductors</a>, Leuven, Belgium. I am the technical lead of the Post-Quantum Cryptography team and the manager of the Crypto Concepts team.</p> <p>Previously, I was a post-doctoral researcher in the <a href="https://research.microsoft.com/en-us/groups/crypto/">Cryptography Research Group</a> at <a href="https://research.microsoft.com/">Microsoft Research</a>, Redmond, USA. I obtained my PhD in the <a href="https://lacal.epfl.ch/">laboratory for cryptologic algorithms</a> at <a href="https://www.epfl.ch/">EPFL</a>, Lausanne, Switzerland under supervision of <a href="https://people.epfl.ch/arjen.lenstra">Prof. Arjen Lenstra</a> in 2012.</p> <p>My research focuses on computational number theory and high-performance arithmetic as used in (post-quantum) public-key cryptography. I am a co-author of the post-quantum secure <a href="https://pq-crystals.org/kyber/">CRYSTALS-Kyber</a> key encapsulation mechanism which <a href="https://csrc.nist.gov/Projects/post-quantum-cryptography/selected-algorithms-2022">has been selected</a> by NIST for standardization, served as the Secretary for the IACR (2017 - 2022), the co-editor of the <a href="https://eprint.iacr.org/">IACR Cryptology ePrint Archive</a> and one of the Editor-in-Chiefs for the <a href="https://cic.iacr.org/">IACR Communications in Cryptology</a>.</p> <h2 id="post-quantum-cryptography">Post-Quantum Cryptography</h2> <p><a href="https://csrc.nist.gov/Projects/Post-Quantum-Cryptography/Post-Quantum-Cryptography-Standardization">Post-Quantum Cryptography Standardization</a>: I am a submitter of three lattice-based submissions</p> <ul> <li><a href="https://frodokem.org/">FrodoKEM</a></li> <li><a href="https://pq-crystals.org/kyber/">Kyber</a></li> <li><a href="https://newhopecrypto.org/">New Hope</a></li> </ul> All three submissions advanced to <a href="https://csrc.nist.gov/news/2019/pqc-standardization-process-2nd-round-candidates" >Round 2</a>. <br> [<b>Update July 2020</b>]: <a href="https://pq-crystals.org/kyber">Kyber</a> is one of the four remaining <a href="https://csrc.nist.gov/projects/post-quantum-cryptography/round-3-submissions ">round 3 finalists</a> in the category “Public-key Encryption and Key-establishment Algorithms” and <a href="https://frodokem.org/">FrodoKEM</a> is one of the five alternate candidates of the NIST Post-Quantum Cryptography Standardization effort.<br> [<b>Update July 2022</b>]: Thrilled that Kyber <a href="https://csrc.nist.gov/projects/post-quantum-cryptography/selected-algorithms-2022">has been selected</a> as the new key-establishment algorithm! <h2 id="program-committees">Program Committees</h2> <p>I serve(d) on the following program committees</p> <ul> <li>Transactions of CHES (TCHES): 2018, 2019, 2020</li> <li>Asiacrypt: 2017, 2021</li> <li>Eurocrypt: 2021, 2023</li> <li>Crypto: 2023</li> <li>Conference on Computer and Communications Security (CCS): 2021</li> <li>Conference on Post-Quantum Cryptography (PQCrypto): 2016, 2017, 2018</li> <li>Selected Areas in Cryptography (SAC) 2013, 2019</li> <li>RSA Conference Cryptographers’ Track (CT-RSA): 2018, 2019</li> <li>Conference on Cryptology in India (Indocrypt): 2017, 2021</li> <li>Latincrypt: 2017</li> <li>Workshop on the Arithmetic of Finite Fields: 2020</li> <li>Workshop on Encrypted Computing & Applied Homomorphic Cryptography (WAHC): 2019, 2020, 2021</li> <li>Workshop on Security for Embedded and Mobile Systems (SEMS) 2017</li> <li>Conference on Software performance enhancement for encryption and decryption, and benchmarking (SPEED-B): 2016</li> <li>Conference on ICT Systems Security and Privacy Protection (IFIP SEC): 2015, 2016, 2017</li> <li>Conference on Cryptography and Coding (IMA CC): 2013</li> </ul> <h2 id="highlights">Highlights</h2> <ul> <li>November 2021: Happy and proud to be a co-editor (with Martijn Stam) of the book titled <a href="https://www.cambridge.org/9781108795937">Computational Cryptography: Algorithmic Aspects of Cryptology</a> which is a tribute to Arjen K. Lenstra, one of the key contributors to the field, on the occasion of his 65th birthday, covering his best-known scientific achievements in the field. Many thanks to all the contributors which made this a great success! See the <a href="https://www.joppebos.com/lenstra">dedicated homepage</a> for all author versions. </li> <li>March 2021: It has been an honor to write about my supervisor, colleague and friend <a href="https://www.ams.org/notices/202104/rnoti-p538.pdf">Peter Montgomery in AMS</a> together with Kristin Lauter. </li> <li>July 2020: <a href="https://pq-crystals.org/kyber">Kyber</a> is one of the four remaining <a href="https://csrc.nist.gov/projects/post-quantum-cryptography/round-3-submissions ">round 3 finalists</a> in the category “Public-key Encryption and Key-establishment Algorithms” and <a href="https://frodokem.org/">FrodoKEM</a> is one of the five alternate candidates of the NIST Post-Quantum Cryptography Standardization effort. </li> <li>January 2019: All three lattice-based submissions I am involved in made it to the <a href="https://csrc.nist.gov/projects/post-quantum-cryptography/round-2-submissions">second round</a> of the NIST Post-Quantum Cryptography Standardization effort.</li> <li>November 2017: I am a submitter of three submissions to <a href="https://csrc.nist.gov/Projects/Post-Quantum-Cryptography/Round-1-Submissions">round 1</a> of the NIST Post-Quantum Cryptography Standardization effort.</li> <li>November 2016: I am honoured and excited <a href="https://iacr.org/elections/2016/">to serve</a> as the IACR secretary.</li> <li>July 2016: <a href="https://eprint.iacr.org/2015/753">Our paper</a> related to the security assessment of white-box cryptography received the best paper award at the CHES 2016 conference!</li> <li>May 2016: I am panel member at <a href="https://www.cryptoexperts.com/awacs2016/">A Workshop About Cryptographic Standards</a> (AWACS).</li> <li>September 2015: I participate in the panel discussion on the standardisation of elliptic curves for cryptographic use which was part of the <a href="https://ecc2015.math.u-bordeaux1.fr/">Workshop on Elliptic Curve Cryptography</a>.</li> <li>June 2015: I presented our hardware view on elliptic curves at <a href="https://www.nist.gov/itl/csd/ct/ecc-workshop.cfm">NIST’s Workshop on Elliptic Curve Cryptography Standards</a> and participated in the panel discussion related to ECC in industry.</li> <li>February 2014: My first <a href="https://www.anagram.com/jcrap/">Journal of Craptology</a> appearance! [ <a href="https://www.anagram.com/jcrap/Volume_9/">Volume 9</a> ] [ <a href="https://rump.cr.yp.to/the-end-of-crypto.html">lyrics</a> ] [ <a href="https://www.youtube.com/watch?v=fErHcYXvK08">youtube</a> ]</li> <li>November 2013: We performed a review of elliptic curve cryptography (ECC), as it is used in practice today, in order to reveal unique mistakes and vulnerabilities that arise in implementations of ECC. [ <a href="https://ellipticnews.wordpress.com/2013/11/19/elliptic-curve-cryptography-in-practice/">blog</a> ] [ <a href="https://eprint.iacr.org/2013/734.pdf">paper</a> ]</li> <li>February 2012: Our public-key sanity check paper titled <a href="https://eprint.iacr.org/2012/064.pdf">Ron was wrong, Whit is right</a> demonstrates that two out of every one thousand RSA moduli that we collected offer no security. [ <a href="https://www.nytimes.com/2012/02/15/technology/researchers-find-flaw-in-an-online-encryption-method.html?pagewanted=all">NY times</a> ] [ <a href="https://it.slashdot.org/story/12/02/14/2322213/998-security-for-real-world-public-keys">/.</a> ]</li> <li>June 2011: A new factorization record: <a href="https://homes.cerias.purdue.edu/%7Essw/cun/champ">Largest factorization</a> of a <a href="https://homes.cerias.purdue.edu/%7Essw/cun/">Cunningham number</a> with the general number field sieve: C197 from 2,1196+ factors as P77 * P120.</li> <li>March 2010: We found a new <a href="https://documents.epfl.ch/users/l/le/lenstra/public/papers/73ecm.txt">ECM record factor of 73-digits</a> on our PS3-cluster.</li> <li>January 2010: Factorization of a 768-bit RSA modulus: [ <a href="https://documents.epfl.ch/users/l/le/lenstra/public/papers/rsa768.txt">summary</a> ] [ <a href="https://eprint.iacr.org/2010/006.pdf">paper</a> ] [ <a href="https://science.slashdot.org/story/10/01/07/1623249/Factorization-of-a-768-Bit-RSA-Modulus">/.</a> ]</li> <li>July 2009: A new ECDLP record. PlayStation 3 computing breaks 260 barrier: 112-bit prime ECDLP solved. [ <a href="https://lacal.epfl.ch/page81774.html">summary</a> ] [ <a href="https://www.joppebos.com/files/noan112.pdf">paper</a> ] [ <a href="https://it.slashdot.org/story/09/07/12/1620240/New-Elliptic-Curve-Cryptography-Record">/.</a> ]</li> <li>June 2009: A new factorization record. <a href="https://homes.cerias.purdue.edu/%7Essw/cun/champ">Largest factorization</a> of a <a href="https://homes.cerias.purdue.edu/%7Essw/cun/champ">Cunningham number</a> with the general number field sieve: C182 from 2,1157- factors as P91 * P92.</li> </ul> </section> <footer class="page__meta"> </footer> </div> </article> </div> <div class="page__footer"> <footer>   <div class="page__footer-copyright">© 2019 Joppe W. Bos. Powered by <a href="https://jekyllrb.com" rel="nofollow">Jekyll</a> & <a href="https://github.com/academicpages/academicpages.github.io">AcademicPages</a>, a fork of <a href="https://mademistakes.com/work/minimal-mistakes-jekyll-theme/" rel="nofollow">Minimal Mistakes</a>.</div> </footer> </div> <script src="https://www.joppebos.com//assets/js/main.min.js"></script>  <script async src="https://www.googletagmanager.com/gtag/js?id=UA-50065901-1"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); gtag('config', 'UA-50065901-1'); </script> </body> <script>'undefined'=== typeof _trfq || (window._trfq = []);'undefined'=== typeof _trfd && (window._trfd=[]),_trfd.push({'tccl.baseHost':'secureserver.net'},{'ap':'cpsh-oh'},{'server':'p3plzcpnl505082'},{'dcenter':'p3'},{'cp_id':'402087'},{'cp_cache':''},{'cp_cl':'8'}) // Monitoring performance to make your website faster. If you want to opt-out, please contact web hosting support.</script><script src='https://img1.wsimg.com/traffic-assets/js/tccl.min.js'></script></html>