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 get this service 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).

18:51 [PhD][New] Nicolás González-Deleito: Trust relationships in exchange protocols

  Name: Nicolás González-Deleito
Topic: Trust relationships in exchange protocols
Category: cryptographic protocols

18:50 [PhD][New] Yves Roggeman

  Name: Yves Roggeman

18:49 [PhD][New] Olivier Markowitch: Non-repudiation protocols

  Name: Olivier Markowitch
Topic: Non-repudiation protocols
Category: cryptographic protocols

18:49 [PhD][New] Gilles Piret: Block Ciphers: Security Proofs, Cryptanalysis, Design, and Fault Attacks

  Name: Gilles Piret
Topic: Block Ciphers: Security Proofs, Cryptanalysis, Design, and Fault Attacks
Category: secret-key cryptography

18:46 [Job][Update] Post-Doc, Technical University Denmark, Copenhagen


Postdoc within the area of Symmetric Cryptography

Applications are invited for an 18 month (with a possible extension of 6 months) Postdoc position at the Danish-Chinese Center for Applications of Algebraic Geometry in Coding and Cryptology. The center is located at the Department of Mathematics at the Technical University of Denmark. The position is available from July 2012 or earliest thereafter.


The candidate should have a PhD degree or academic qualifications equivalent to the PhD level, and should have a strong background in symmetric cryptography. This is usually demonstrated by having publications in well established journals and/or conferences.

As it is essential for the project to establish research connections with China, applicants are expected to be willing to actively establish these connections. This ideally includes one or several visits to the East China Normal University.

Salary and terms of employment

The appointment will be based on the collective agreement with the Confederation of Professional Associations. The allowance will be agreed with the relevant union.

The period of employment is 18 months.

Further information

Further information about the project may be reached by contacting Associate Professor Gregor Leander, tel. (+45) 4525 3055, g.leander (at)


We must have your online application no later than 31 May 2012. See for details.

18:45 [Job][New] Research Fellow, Nanyang Technological University, Singapore

  Physical Analysis and Cryptographic Engineering (PACE) Labs at Nanyang Technological University are seeking 2 Research Scientists in the area of side-channel and fault attacks. The newly founded lab is dedicated to all aspects of side-channel and fault attacks and offers brand-new facilities, a very diverse international research environment, and the opportunity to undertake independent research.

Candidates shall hold, or expect to obtain, a Ph.D. in Computer Sciences, Electrical Engineering, Mathematics or a related field. A solid background in one or several areas of Information Theory, Digital Signal Processing, Statistics, Mutual Information Analysis, DEMA attacks, fault attacks, practical measurements, lightweight implementations (software and/or hardware) would be considered an advantage.

Starting date is in May 2012 and funding is available for 3 years, thus the contract will be for up to 3 years (depending on the successful candidates\' ability to start working in Singapore).

Salaries are competitive and are determined according to the successful applicants\' accomplishments, experience and qualifications.

Interested applicants with a strong publication record in the fields of side-channel and/or fault attacks are encouraged to submit their application including:

1) cover letter,

2) detailed CV,

3) filled personal particulars form*, and

4) names/contact emails of 2 references

to Prof. Axel Poschmann aposchmann (at)

Review of applications starts immediately and will continue until positions are filled.

* accesible via

18:45 [Event][New] crypt@b-it 2012: crypt@b-it 2012: Summer school on Cryptography

  From July 16 to July 20
Location: Bonn, Germany
More Information:

00:17 [Pub][JoC] Logic Minimization Techniques with Applications to Cryptology


Abstract  A new technique for combinational logic optimization is described. The technique is a two-step process. In the first step, the nonlinearity of a circuit—as measured by the number of nonlinear gates it contains—is reduced. The second step reduces the number of gates in the linear components of the already reduced circuit. The technique can be applied to arbitrary combinational logic problems, and often yields improvements even after optimization by standard methods has been performed. In this paper we show the results of our technique when applied to the S-box of the Advanced Encryption Standard (FIPS in Advanced Encryption Standard (AES), National Institute of Standards and Technology, 2001). We also show that, in the second step, one is faced with an NP-hard problem, the Shortest Linear Program (SLP) problem, which is to minimize the number of linear operations necessary to compute a set of linear forms. In addition to showing that SLP is NP-hard, we show that a special case of the corresponding decision problem is Max SNP-complete, implying limits to its approximability. Previous algorithms for minimizing the number of gates in linear components produced cancellation-free straight-line programs, i.e., programs in which there is no cancellation of variables in GF(2). We show that such algorithms have approximation ratios of at least 3/2 and therefore cannot be expected to yield optimal solutions to nontrivial inputs. The straight-line programs produced by our techniques are not always cancellation-free. We have experimentally verified that, for randomly chosen linear transformations, they are significantly smaller than the circuits produced by previous algorithms.

  • Content Type Journal Article
  • Pages 1-33
  • DOI 10.1007/s00145-012-9124-7
  • Authors

    • Joan Boyar, Department of Mathematics and Computer Science, University of Southern Denmark, Odense, Denmark
    • Philip Matthews, Aarhus University, Aarhus, Denmark
    • René Peralta, Information Technology Laboratory, NIST, Gaithersburg, MD, USA

    • Journal Journal of Cryptology
    • Online ISSN 1432-1378
    • Print ISSN 0933-2790

From: Thu, 03 May 2012 07:37:37 GMT

07:21 [Event][Update] Provable Privacy Workshop

  Submission: 11 May 2012
Notification: 1 June 2012
From July 9 to July 10
Location: Vigo, Spain
More Information:

05:36 [Conf][AC] Asiacrypt 2012

  The 18th Annual International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2012, will be held in Beijing, China. Beijing is a dynamic city rich in contrast and colour where you will find a harmonious blend of culture, cuisine, arts and architecture here.

Important dates:
Submission Deadline: May 20, 2012 23:59:59 UTC
Notifications to Authors: August 16, 2012
Proceedings Version Deadline: September 9, 2012
ASIACRYPT 2012 Conference: December 2-6, 2012

14:23 [PhD][Update] Özgül Küçük: Design and Analysis of Cryptographic Hash Functions

  Name: Özgül Küçük
Topic: Design and Analysis of Cryptographic Hash Functions
Category:secret-key cryptography

Description: The topic of this thesis is the design and analysis of cryptographic hash functions. A hash function is a map from variable-length input bit strings to fixed-length output bit strings. Despite their simple definition, hash functions play an essential role in a wide area of applications such as digital signature algorithms, message authentication codes, password verification, and key derivation. The main contribution of this thesis is a novel and elegant proposal of a cryptographic hash function. In this thesis, we approach the problem of the design and analysis of cryptographic hash functions with a particular example, the hash function Hamsi. The design of Hamsi is based on the use of a relatively light underlying primitive in each iteration of the mode of operation, combined with a strong message expansion function. We investigate the design constraints of this approach by analyzing Hamsi. In the first part, we cover the design aspects of Hamsi and also propose a variant called Hamsi$^\oplus$. In the sequent parts we provide analysis results, namely indifferentiability analysis and collision analysis. Finally, as a separate research study we analyze the initialization of the stream cipher Grain.[...]