## Upcoming conferences and recent announcements

• The list of speakers for the ECC 2016 conference is at
http://ecc2016.yasar.edu.tr/invited.html.

Here are the speakers:

• Benjamin Smith, “Fast, uniform, and compact scalar multiplication for elliptic curves and genus 2 Jacobians with applications to signature schemes” and “μKummer: efficient hyperelliptic signatures and key exchange on microcontrollers”
• Cyril Hugounenq, “Explicit isogenies in quadratic time in any characteristic”
• Daniel Genkin, “ECDH Key-Extraction via Low-Bandwidth Electromagnetic Attacks on PCs” and “ECDSA Key Extraction from Mobile Devices via Nonintrusive Physical Side Channels” and “CacheBleed: A Timing Attack on OpenSSL Constant Time RSA”
• Jens Groth, “On the Size of Pairing-based Non-interactive Arguments”
• Maike Massierer, “Computing L-series of geometrically hyperelliptic curves of genus three”
• Mehmet Sabır Kiraz, “Pairings and Cloud Security”
• Pascal Sasdrich, “Implementing Curve25519 for Side-Channel–Protected Elliptic Curve Cryptography”
• Patrick Longa, “Efficient algorithms for supersingular isogeny Diffie-Hellman”
• Razvan Barbulescu, “Extended Tower Number Field Sieve: A New Complexity for Medium Prime Case”
• Sebastian Kochinke, “Computing discrete logarithms with special linear systems”
• Shashank Singh, “A General Polynomial Selection Method and New Asymptotic Complexities for the Tower Number Field Sieve Algorithm”
• Shoukat Ali, “A new algorithm for residue multiplication modulo \$2^{521}-1\$”
• Tung Chou, “The Simplest Protocol for Oblivious Transfer” and “Sandy2x: new Curve25519 speed records”

The conference organisers wish to reassure conference attendees that it is safe to come to Turkey for the conference: “The life in Izmir is just as usual: sunny and slow-going. We are preparing for ECC and we would like to serve our guests in the best way we can.”

• The schedule for the Algorithmic Number Theory conference (ANTS) is at
http://www.mathematik.uni-kl.de/~thofmann/ants/schedule.html.

• Aurore Guillevic, François Morain and Emmanuel Thomé recently announced a solution to an ECDLP instance on a 170-bit pairing-friendly curve with embedding degree 3.
In other words, they solved a DLP in a finite field $\mathbb{F}_{p^3}^*$ of size around 510 bits. You can read further details here and here.

• Thorsten Kleinjung, Claus Diem, Arjen K. Lenstra, Christine Priplata and Colin Stahlke have reported a new DLP computation using the number field sieve in a 768-bit field $\mathbb{F}_{p}^*$. The details are here.

— Steven Galbraith