International Association for Cryptologic Research

IACR News Central

Get an update on changes of the IACR web-page here. For questions, contact newsletter (at) You can also receive updates via:

To receive your credentials via mail again, please click here.

You can also access the full news archive.

Further sources to find out about changes are CryptoDB, ePrint RSS, ePrint Web, Event calender (iCal).

17:27 [News] Turing Award for Shafi Goldwasser and Silvio Micali

  Recently, the Turing award was presented to the IACR members Shafi Goldwasser and Silvio Micali. They were honoured for their fundamental work in theoretical mathematics and cryptology. Congratulations from the IACR!

17:22 [Conf] Report on Africacrypt 2012


Africacrypt 2012, July 10-12, Ifrane Morocco

Africacrypt 2012 was held on the campus of the Al Akhawayn University in Ifrane, Morocco, on July 10-12. The Program Chair was Serge Vaudenay, the General co-Chairs were Abdelhak Azhari and Tajje-eddine Rachidi, and the Publication Chair was Aikaterini Mitrokotsa. Africacrypt 2012 was organized jointly by Al Akhawayn University in Ifrane and the Moroccan Association for Cryptography. The conference was held in cooperation with IACR (International Association for Cryptologic Research) and in partnership with the Région Meknès Tafilalet, Morocco. The technical program included 24 regular papers categorized into ten sessions that were selected from 56 submissions 12 of which had at least one co-author from Africa. In addition 3 invited talks were presented, by Willi Meier (University of Applied Sciences and Arts Northwestern Switzerland), Craig Gentry (IBM), and Marc Fischlin (The Darmstadt University of Technology, Germany). The conference proceedings were published by Springer's LNCS and most of the presentation slides for the technical sessions, including the invited talks, are now available on the conference website: Delegates from the Moroccan National Security agencies also attend the conference. The best paper award, went to Elena Andreeva, Bart Mennink, Bart Preneel, and Marjan Skrobot for their paper "Security Analysis and Comparison of the SHA-3 Finalists BLAKE, Groestl, JH, Keccak, and Skein." The social program included a cedar tree planting session, and an optional conference banquet and an excursion to the Imperial city of Fes.

16:50 [News] Gödel Prize for Antoine Joux, and the team of Dan Boneh and Matthew K. Franklin

  ACM's Special Interest Group on Algorithms and Computation Theory (SIGACT) and the European Association for Theoretical Computer Science (EATCS) award the "Gödel Prize" to three of our members, namely Antoine Joux, Dan Bonehn and Matthew K. Franklin for their work in cryptology and security. Congratulations from the IACR!

07:10 [Conf][EC] Report on Eurocrypt 2012


Eurocrypt 2012 was held in Cambridge, UK, from April 15th to April 19th. The meeting was held in the UK to coincide with the 100th anniversary year of the birth of Alan Turing.

The Program co-Chairs were David Pointcheval and Thomas Johansson. The Eurocrypt 2012 Program Committee (PC) consisted of 32 members. There were 195 papers submitted to the conference. The PC eventually selected 41 submissions for presentation during the conference. The PC decided to give the Best Paper Award to Antoine Joux and Vanessa Vitse for their paper “Cover and Decomposition Index Calculus on Elliptic Curves made practical. Application to a previously unreachable curve over Fp6 .” The conference program also included two invited lectures: one by Antoine Joux entitled “A Tutorial on High-Performance Computing Applied to Cryptanalysis,” and the other by Alfred Menezes on “Another Look at Provable Security.”

The conference programme was augmented by a trip to Bletchley Park on Thursday afternoon, with the traditional free Tuesday afternoon being dispensed with. Attendance at Eurocrypt 2012 was quite high, with 412 registered attendees, up from 300 at Eurocrypt 2010.

The conference was supported by donations from BAE Systems/Detica, CESG, Cryptomathic, Good Technologies, Microsoft Research, Qualcomm, RIM, Trend Micro, Visa International and Voltage. The generous donations allowed the organizers to sponsor the attendance of around 60 young researchers.

05:30 [Job][New] Senior Researcher in the areas of Security and Privacy, NEC Labs in Heidelberg, Germany

  The focus is on research with industrial and academic partners in collaborative European projects and towards NEC internal product and prototype development. You will contribute to the design and development of new concepts in security. Your responsibilities include publications, IPR creation, and supervising students and interns.

We are looking for individuals with a broad background in Security and a good understanding of most of the following areas:

• Security protocols and applied cryptography

• Network and Cyber Security, especially secure management of distributed resources,

• Software Security and Web Security

• Resource monitoring and machine learning techniques for security applications

We expect a PhD. degree with an excellent publication record and some relevant professional experience in the security area.

The NEC Laboratories in Heidelberg (Germany) provide an excellent working environment supporting individual creativity as well as strong teamwork. English is the working language in the Laboratories.

00:17 [Pub][ePrint] Four Dimensional GLV via the Weil Restriction, by Aurore Guillevic and Sorina Ionica

  The Gallant-Lambert-Vanstone (GLV) algorithm uses efficiently computable

endomorphisms to accelerate the computation of scalar multiplication of

points on an abelian variety. Freeman and Satoh proposed for cryptographic use two families of genus 2 curves defined over $\\F_{p}$ which have the property that the corresponding

Jacobians are $(2,2)$-isogenous over an extension field to a product of elliptic curves defined over $\\F_{p^2}$. We exploit the relationship between the endomorphism rings of isogenous abelian varieties to exhibit efficiently computable endomorphisms on both the genus 2 Jacobian and the elliptic curve. This leads to a four dimensional GLV method on Freeman and Satoh\'s Jacobians and on two new families of elliptic curves defined over $\\F_{p^2}$.

00:17 [Pub][ePrint] Families of fast elliptic curves from Q-curves, by Benjamin Smith

  We construct new families of elliptic curves over \\(\\FF_{p^2}\\) with efficiently computable endomorphisms, which can be used to accelerate elliptic curve-based cryptosystems in the same way as Gallant--Lambert--Vanstone (GLV) and Galbraith--Lin--Scott (GLS) endomorphisms.

Our construction is based on reducing \\(\\QQ\\)-curves---curves over quadratic number fields without complex multiplication, but with isogenies to their Galois conjugates---modulo inert primes.

As a first application of the general theory we construct, for every \\(p > 3\\), two one-parameter families of elliptic curves over \\(\\FF_{p^2}\\) equipped with endomorphisms that are faster than doubling.

Like GLS (which appears as a degenerate case of our construction), we offer the advantage over GLV of selecting from a much wider range of curves, and thus finding secure group orders when \\(p\\) is fixed. Unlike GLS, we also offer the possibility of constructing twist-secure curves.

Among our examples are prime-order curves equipped with fast endomorphisms, with almost-prime-order twists, over \\(\\FF_{p^2}\\) for \\(p = 2^{127}-1\\) and \\(p = 2^{255}-19\\).

00:17 [Pub][ePrint] Reducing Pairing Inversion to Exponentiation Inversion\\\\using Non-degenerate Auxiliary Pairing, by Seunghwan Chang and Hoon Hong and Eunjeong Lee and Hyang-Sook Lee

  The security of pairing-based cryptosystems is closely related to the difficulty of the pairing inversion problem. Building on previous works, we provide further contributions on the difficulty of pairing inversion.

In particular, we revisit the approach of Kanayama-Okamoto who modified exponentiation inversion and Miller inversion by considering an ``auxiliary\'\' pairing. First, by generalizing and simplifying Kanayama-Okamoto\'s approach, we provide a simpler approach for inverting generalized ate pairings of Vercauteren. Then we provide a complexity of the modified Miller inversion, showing that the complexity depends on the sum-norm of the integer vector defining the auxiliary pairing.

Next, we observe that the auxiliary pairings (choice of integer vectors) suggested by Kanayama-Okamoto are degenerate and thus the modified exponentiation inversion is expected to be harder than the original exponentiation inversion. We provide a

sufficient condition on the integer vector, in terms of its max norm, so that the corresponding auxiliary paring is non-degenerate.

Finally, we define an infinite set of curve parameters, which includes those of typical pairing friendly curves, and we show that, within those parameters, pairing inversion of arbitrarily given generalized ate pairing can be reduced to exponentiation inversion in polynomial time.

00:17 [Pub][ePrint] Keyed Side-Channel Based Hashing for IP Protection using Wavelets, by Timo Bartkewitz

  The protection of intelligent property (IP) is a challenging task, especially in secured embedded systems where program code that is supposed to be a plagiarism cannot be simply read-out for further inspection. This is even more aggravated if the original source code was modified to prevent comparisons of any kind. For instance, watermarks that are actually hidden in the code are at risk to be rendered useless if the attacker has full access to the original code and some knowledge about the watermark. The unlicensed use of patented algorithms is a further problem that belongs to IP plagiarism as well. A Recent work presented a framework based on perceptual hashing to detect intelligent property in hardware and software designs. In this work we consequently extend this framework to detect IP plagiarism in embedded systems that can reliably match contents even in the presence of attacks. Therefore, we propose an adapted signal feature extraction method, the wavelet transform, to form a keyed side-channel hash function.