Monthly Archives: November 2013

The recent paper Elliptic Curve Cryptography in Practice by Joppe W. Bos and J. Alex Halderman and Nadia Heninger and Jonathan Moore and Michael Naehrig and Eric Wustrow is well worth reading. The discovery in 2012 of a large number … Continue reading →

The Pairing 2013 conference will take place in Beijing, China during November 22-24, 2013. The list of accepted papers is here. There are two interesting papers about the discrete logarithm problem in finite fields and the impact of recent results on … Continue reading →

An important computational assumption in pairing-based cryptography is that it is hard to invert pairings. This problem has been studied for around 10 years, and it remains an active area of research. The purpose of this blog post is to … Continue reading →