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).

06:57 [Event][New] Central European Conference on Cryptology 2013

  Submission: 15 April 2013
Notification: 29 April 2013
From June 26 to June 28
Location: Telc, Czech Republic
More Information:

06:56 [Event][New] ECC 2013: 17th Workshop on Elliptic Curve Cryptography

  From September 16 to September 18
Location: Leuven, Belgium
More Information:

16:56 [Event][New] SPE2013: IEEE 2013 Third International Workshop on Security and Privacy Engineering

  Submission: 15 March 2013
Notification: 4 April 2013
From June 27 to July 2
Location: Santa Clara, CA, USA
More Information:

16:55 [Event][New] VizSec 2013: 10th International Symposium on Visualization for Cyber Security

  Submission: 8 July 2013
Notification: 16 August 2013
From October 14 to October 14
Location: Atlanta, GA, United States
More Information:

18:32 [Job][New] Post-Doc, Aalto University School of Science, Helsinki, Finland

  The cryptography group at Aalto University School of Science is specialized in statistical cryptanalysis of symmetric-key cryptographic primitives as well as implementation efficiency and security of both asymmetric-key and symmetric-key primitives. Also mathematical structures that provide resistance against such attacks belong to the groupĀ“s interest areas. In the current call we look for researchers who have PhD degree and background in the areas mentioned above.

18:00 [Event][New] SIN'13: The 6th Intl Conf on Security of Information and Networks

  Submission: 30 June 2013
Notification: 10 August 2013
From November 26 to November 28
Location: Aksaray, Turkey
More Information:

20:47 [Event][New] Keccak & SHA-3 Day

  From March 27 to March 27
Location: Brussels, Belgium
More Information:

20:46 [Event][New] RFIDsec '13: Workshop on RFID Security

  Submission: 2 April 2013
Notification: 28 May 2013
From July 9 to July 11
Location: Graz, Austria
More Information:

13:17 [Pub][ePrint] A new index calculus algorithm with complexity $L(1/4+o(1))$ in very small characteristic, by Antoine Joux

  In this paper, we describe a new algorithm for discrete logarithms in

small characteristic. It works especially well when the characteristic

is fixed. Indeed, in this case, we obtain a total complexity of $L(1/4+o(1)).$

19:17 [Pub][ePrint] Secure Signatures and Chosen Ciphertext Security in a Post-Quantum World, by Dan Boneh and Mark Zhandry

  We initiate the study of quantum-secure digital signatures and quantum chosen ciphertext security. In the case of signatures, we enhance the standard chosen message query model by allowing the adversary to issue quantum chosen message queries: given a superposition of messages, the adversary receives a superposition of signatures on those messages. Similarly, for encryption, we allow the adversary to issue quantum chosen ciphertext queries: given a superposition of ciphertexts, the adversary receives a superposition of their decryptions. These adversaries model a natural post-quantum environment where end-users sign messages and decrypt ciphertexts on a personal quantum computer.

We construct classical systems that remain secure when exposed to such quantum queries. For signatures we construct two compilers that convert classically secure signatures into signatures secure in the quantum setting and apply these compilers to existing post-quantum signatures. We also show that standard constructions such as Lamport one-time signatures and Merkle signatures remain secure under quantum chosen message attacks, thus giving signatures whose quantum security is based on generic assumptions. For encryption, we define security under quantum chosen ciphertext attacks and present both public-key and symmetric-key constructions.

19:17 [Pub][ePrint] Filtered nonlinear cryptanalysis of reduced-round Serpent, and the Wrong-Key Randomization Hypothesis., by James McLaughlin and John A. Clark

  We present a deterministic algorithm to find nonlinear S-box approximations, and a new nonlinear cryptanalytic technique; the \"filtered\" nonlinear attack, which achieves the lowest data complexity of any known-plaintext attack on reduced-round Serpent so far. We demonstrate that the Wrong-Key Randomization Hypothesis is not entirely valid for attacks on reduced-round Serpent which rely on linear cryptanalysis or a variant thereof, and survey the effects of this on existing attacks (including existing nonlinear attacks) on 11 and 12-round Serpent.