The EUROCRYPT 2013 conference will be held in Athens, Greece on May 26-30, 2013. The list of accepted papers is here. There are several papers of interest to researchers in ECC.
Joppe Bos, Craig Costello, Huseyin Hisil and Kristin Lauter have a paper called “Fast cryptography in genus 2”. This was posted on eprint with the less illuminating title Two is Greater than One. The paper gives a detailed implementation of exponentiation for genus 2 curves using various techniques (such as the Kummer surface) and concludes that genus 2 can be faster than elliptic curves in some settings.
Antoine Joux has reported several new discrete logarithm records recently; see his posts in December, January and February at the Number Theory Web. At Eurocrypt his paper “Faster index calculus for the medium prime case. Application to a 1425-bit finite field” reports on some of this work. These results apply to finite fields of the form GF( q^n ) where q is not prime. They may be of relevance in pairing-based cryptography, which uses finite fields of composite extension degree.
The paper “Candidate Multilinear Maps from Ideal Lattices and Applications” by Sanjam Garg, Craig Gentry and Shai Halevi will also appear at EUROCRYPT. I have already discussed this paper in an earlier blog post.
— Steven Galbraith