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

05:21 [Job][New] Tenure-Track position in Information Security , University of Twente, The Netherlands

  The Distributed and Embedded Security Group of the University of Twente is seeking a talented new group leader with research interests in information security for a tenure-track appointment.

Both senior and junior researchers are welcome to apply.

10:20 [PhD][New] Souradyuti Paul: Design and Analysis of Stream Ciphers Based on Arrays and Modular Addition

  Name: Souradyuti Paul
Topic: Design and Analysis of Stream Ciphers Based on Arrays and Modular Addition
Category: secret-key cryptography

Description: In modern cryptography, stream ciphers are most useful in applications where information needs to be encrypted/decrypted at high speed (e.g. high resolution streaming video data) or when low footprint (gates/memory) encryption is required. In the literature, there exist plenty of stream ciphers whose internal states are based on arrays and that they use modular additions to generate output streams. The abundance of array-based stream ciphers with modular additions can be attributed to the fact that, when implemented in software skillfully, they are able to produce outputs at a very high speed. The main contribution of this thesis is a unified analysis of stream ciphers based on arrays and modular addition. During the process, we detect cryptographic weaknesses in the designs of 9 widely known stream ciphers or pseudorandom bit generators (PRBGs).\r\n
\r\nAt first, we show some theoretical results on solving an important class of equations known as \\emph{differential equations of addition} (DEA) that combine modular additions over two different algebraic groups such as GF(2) and GF($2^{32}$). The results include, \\bite \\item proof of the fact that the satisfiability of an arbitrary set of DEA is in the complexity class \\pP,\\item deriving all the solutions of an arbitrary set of DEA. \\eite Next, we apply these results to attack a practical stream cipher named Helix (designed by Ferguson \\emph{et al.}) with both chosen plaintexts and adaptive chosen plaintexts.\r\n
\r\nIn the second phase, the thesis closely scrutinizes a number of array-based stream ciphers (or PRBGs) in order to estimate their resistance against distinguishing attacks. We eventually discover, counter-intuitively, that the correlations between the array-indices and their associated array-elements, which apparently seem to be useful from the point of view of implementation purposes, can be exploited to mount distinguishing attacks on such type of ciphers if adequate precautions are not tak[...]

19:01 [Event][New] ICDIPC2012: 2nd Inter. Conference on Digital Information Processing and Communications

  Submission: 30 April 2012
Notification: 20 May 2012
From July 10 to July 12
Location: Klaipeda, Lithuania
More Information:

10:24 [Job][New] Ph.D. student scholarships, Center for Advanced Security Research Darmstadt (CASED), Germany

  The Center for Advanced Security Research Darmstadt (CASED) at the Technische Universität Darmstadt has openings for its PhD scholarship program in the areas of IT Security starting immediately.

CASED is an IT Security research center at Technische Universität Darmstadt in cooperation with the Fraunhofer Institute for Secure Information Technology (SIT) and the University of Applied Sciences Darmstadt (h_da). CASED constitutes a research infrastructure for forefront IT Security research.

CASED offers an attractive, international, English speaking environment in one of the most interesting metropolitan areas in Germany surrounded by beautiful countryside. The Frankfurt Airport is just 30 km away. CASED students and scientists come from all over the world. PhD students will become members of the CASED graduate school, which supports them during their entire PhD research, for instance through professional courses for transferable skills such as trainings in delivering scientific presentations or writing scientific papers.

CASED hosts a 3 year doctoral program for outstanding students holding a Master\'s degree (or German Diploma or equivalent) in Computer Science, Mathematics, Physics, Electrical Engineering, Economics, Industrial Engineering, Information Systems, and Law or related disciplines. After successful completion of their degree, doctoral candidates will be awarded their degree from the Technische Universität Darmstadt.

This prestigious program offers scholarships to exceptional students who have the potential to make outstanding contributions to science. The research group of Prof. Stefan Katzenbeisser is particularly looking for candidates with a background in applied cryptography, privacy and cloud computing.

Interested candidates can apply online at

10:24 [Job][New] Full professor in Computer Security, KTH Royal Institute of Technology

  Full Professor in Computer Security at KTH

KTH Royal Institute of Technology seeks a full professor in Computer Science

As part of an effort to expand its range of activities in the computer security area, the Department of Theoretical Computer Science with the School of Computer Science and Communication at KTH, Stockholm, Sweden, is looking to recruit a full professor in computer security.

Subject description 

Computer security concerns methods and techniques for the construction of secure computer systems. Relevant security properties include confidentiality, integrity, and availability at system, component, and data levels. The subject also includes modeling, analysis, and testing of existing computer systems from the point of view of security.

Eligibility requirements

A professor must possess documented scientific and didactic skills in the subject, and must have documented experience from independently managing, executing and developing education and research at an internationally high level.

Assessment criteria 

Extensive competence and skills are required in computer security and within one or more adjoining area(s) such as operating systems, machine architecture, parallel, distributed, and networked systems, formal methods, and programming languages. An important objective is to build up new activity in experimental computer security within undergraduate teaching as well as research. Research competence and/or industrial experience in practical aspects of computer security such as vulnerability testing is therefore given a high priority. Documented experience and ability to finance and lead larger research projects, as well as to develop national and international collaborations is of great importance, as is the ability to contribute to and develop university education at all levels, including supervision

08:42 [Conf][EC] Eurocrypt Stipends

  We have a limited number of stipends available for Eurocrypt 2012. See for details. If you would like to be considered for one of these stipends please contact the General Chair by Jan 31st 2012.

06:22 [PhD][New] Florian Mendel: Analysis of Cryptographic Hash Functions

  Name: Florian Mendel
Topic: Analysis of Cryptographic Hash Functions
Category: secret-key cryptography

Description: This thesis is devoted to the analysis of cryptographic hash functions. In the last years significant progress has been made in the cryptanalysis of hash functions. As a consequence most of the hash functions used today have been broken or show weaknesses. The collision attacks on the widely used hash functions MD5 and SHA-1 have attracted a lot of attention in the cryptographic community. In view of these developments, this thesis focuses on the analysis of alternative hash functions such as GOST, RIPEMD-160, Tiger, and Whirlpool.[...]

20:44 [Conf][FSE] Registration Now Open

  Online registration for FSE 2012 is now available at: The late registration deadline is midnight, Sunday, February 19, 2012 (Mountain Standard Time). The main conference website for FSE 2012, which includes hotel reservation information, is here:

15:54 [Event][New] PAIRING 2012: 5th International Conference on Pairing-Based Cryptography

  Submission: 30 January 2012
Notification: 2 April 2012
From May 16 to May 18
Location: Cologne, Germany
More Information:

07:01 [PhD][New] Karim Abdellatif: Hardware Architectures for Cryptography

  Name: Karim Abdellatif
Topic: Hardware Architectures for Cryptography
Category: implementation

07:01 [PhD][New] Habib Mehrez

  Name: Habib Mehrez
Category: implementation