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

08:59 [Event][New] ESORICS 2012: 17th European Symposium on Research in Computer Security

  Submission: 31 March 2012
Notification: 10 June 2012
From September 10 to September 12
Location: Pisa, Italy
More Information:

15:46 [PhD][New] Arshad Ali: New Attacks on FCSR-based Stream Ciphers

  Name: Arshad Ali
Topic: New Attacks on FCSR-based Stream Ciphers
Category: secret-key cryptography

Description: This thesis presents a new family of cryptanalytic attacks on a class of binary\r\nadditive synchronous stream ciphers, the theory of which is based on the properties\r\nof 2-adic numbers. We refer to this new family of cryptanalytic attacks as State Transition Attacks (STAs); we identify three variants of this class of attack, namely Conventional State Transition Attacks (CSTAs), Fast State\r\nTransition Attacks (FSTAs) and Improved State Transition Attacks (ISTAs). These attack variants give rise to trade-offs between data, time and memory complexities. The thesis describes STAs on a class of binary additive synchronous stream ciphers whose keystream generators use l-sequences, which are generated by binary Feedback with Carry Shift Registers (FCSRs). A new theory of linearisation intervals for FCSR state update functions is also presented, and results on correlations between the feedback bit and the Hamming weights of the main and carry registers of Galois FCSRs are developed. These\r\ntheoretical findings are used to cryptanalyse an eSTREAM candidate known as F-FCSR-H v2, as well as two variants of this cipher, known as F-FCSR-H and F-FCSR-16. This cryptanalysis yields State Recovery Algorithms (SRAs)\r\nfor these ciphers. The cryptanalytic attacks on F-FCSR-H v2, F-FCSR-H and F-FCSR-16 presented in this thesis are the most efficient attacks known so far on these ciphers. The thesis also presents a FCSR key recovery algorithm which works in conjunction with the SRAs in order to recover the e ective key used in these ciphers.\r\n
\r\n The thesis also presents various techniques, which can be considered as pre-requisite for simulating new attacks on FCSR-based stream ciphers. In order to describe these techniques, the thesis defines a small-scale variant of the F-FCSR-H type keystream generators and names it as T-cipher. The thesis develops a statistical analysis for the T-cipher and uses it to describe various aspects of the sequences generated by such ciph[...]

21:38 [PhD][New] Robert Granger: On Small Degree Extension Fields in Cryptology

  Name: Robert Granger
Topic: On Small Degree Extension Fields in Cryptology
Category: public-key cryptography

Description: This thesis studies the implications of using public key cryptographic primitives that are based in, or map to, the multiplicative group of finite fields with small extension degree. A central observation is that the multiplicative group of extension fields essentially decomposes as a product of algebraic tori, whose properties allow for improved communication efficiency.\r\n
\r\nPart I of this thesis is concerned with the constructive implications of this idea. Firstly, algorithms are developed for the efficient implementation of torus-based cryptosystems and their performance compared with previous work. It is then shown how to apply these methods to operations required in low characteristic pairing-based cryptography. Finally, practical schemes for high-dimensional tori are discussed. Highly optimised implementations and benchmark timings are provided for each of these systems.\r\n
\r\nPart II addresses the security of the schemes presented in Part I, i.e., the hardness of the discrete logarithm problem. Firstly, an heuristic analysis of the effectiveness of the Function Field Sieve in small characteristic is given. Next presented\r\nis an implementation of this algorithm for characteristic three fields used in pairing-based cryptography. Finally, a new index calculus algorithm for solving the discrete logarithm problem on algebraic tori is described and analysed.[...]

06:36 [Event][Update] AIM'12: International Conference on Advanced IT, engineering and Management

  Submission: 31 December 2011
Notification: 6 January 2012
From February 6 to February 8
Location: Seoul, Korea
More Information:

06:34 [Event][New] ANTS-X: Tenth Algorithmic Number Theory Symposium

  Submission: 10 February 2012
From July 9 to July 13
Location: San Diego, USA
More Information:

16:12 [Conf][EC] List of Accepted Papers

  The list of accepted papers for Eurocrypt 2012 is now available.

11:00 [Job][New] Research Assistant in Secure Software Engineering, European Center for Security and Privacy by Design, Darmstadt, Germany

  The Secure Software Engineering Group in the Fachbereich Informatik of Technische Universität Darmstadt is currently offering a position for a

Research Assistant in Secure Software Engineering

with the goal to further develop the group’s expertise in the area of constructive software security. The Secure Software Engineering Group is part of EC SPRIDE, the European Center for Security and Privacy by Design, a new competence center co-located with CASED. EC SPRIDE actively supports collaborations with other re-searcher centers worldwide, and offers young researchers an optimal working environment in every aspect.

The Research Group on Secure Software Engineering will play a central role in EC SPRIDE, developing methods and tools in the area of constructive software security. The group aims at developing languages, mechanisms, processes and tools that allow software developers to clearly state security requirements and, if possible, synthesize partial implementations that achieve or help achieve these requirements. In cases where automated synthesis is impossible, and a programmer hence need to implement security features by hand the group uses automated program analyses to assist the programmer in deciding whether the implementation indeed fulfills the stated security requirements.

Applicants must have completed (or be close to completing) a Master or Diplom with very excellent grades in Computer Science, Mathematics, Electrical Engineering or a closely related subject. Additional knowledge in IT-Security, Software Engineering, Programming Languages and/or Program Analysis are a plus. We expect successful candidates to conduct independent research within the context of EC SPRIDE, and actively support such candidates in publishing their work on the leading international conferences and in the leading international journals. EC SPRIDE actively supports researchers in obtaining a Ph.D.

12:12 [Job][New] Security Engineer and Consultant for Germany , ESCRYPT GmbH, Bochum/Munich/Wolfsburg, Germany


ESCRYPT is an ambitious company in the area of applied and industrial data security. Our clients include all global car makers as well as leading global players in the area of heavy machinery, automation, semiconductors and high-tech companies. ESCRYPT is a German company with offices in Germany (Bochum, Munich, Wolfsburg) and in the US (Ann Arbor, Michigan).


Your role will providing consulting services to our customers in the area of embedded data security (Consultant) or to develop customized software solutions and maintaneace of our products (Security Engineer). You should have a wide expertise in the area of data security, and a focus on embedded systems is helpful (e.g. smart cards, mobile security, etc.).


We seek top graduates in the fields of electrical engineering, computer science or applied mathematics, ideally with industry experience and special knowledge in one of the following fields:

- Cryptography, security, privacy

- Software development (C/C++ and Java)

- Embedded Systems

International experience and relevant internships will be appreciated. Candidates must be fluent in German.

We look for all-rounders willing to build the company and improve ESCRYPT every day. You should be able to work independently and you should be willing to take responsibility. In addition to technical work, we expect that you are able to market the company and our products and services, e.g., by meeting potential clients.

We take your career seriously and offer the possibility to grow in a highly qualified, internationally experienced team. Your work environment will be characterized by an open atmosphere, flat hierarchy and performance-related salary.

Did we manage to make you curious? Then send us your application to jobs (at)

We look forward to hearing from you!

22:52 [Conf] 188 Submissions at PKC 2012

  Notification: 27 February 2012
Workshop: 21-23 May 2012
Place: Darmstadt, Germany

14:20 [Event][New] esIoT: International Workshop on Extending Seamlessly to the Internet of Things

  Submission: 10 February 2012
Notification: 10 March 2012
From July 4 to July 6
Location: Palermo, Italy
More Information:

05:49 [Job][New] Ph.D. and postdoctoral positions, IMDEA Software Institute, Spain

  The IMDEA Software Institute (Madrid, Spain) has several openings at

the Ph.D. and post-doctoral levels. The positions are attached to the

computer-aided security proofs project, which develops language-based

methods and tools for the verification of cryptographic systems. We seek

applicants with a strong background in at least one of the following fields:

* cryptography

* language-based security

* program analysis and program verification

* automated and interactive proofs

Successful applicants are expected to contribute to the development of

the CertiCrypt toolset, and must have an interest to carry research at

the intersection between programming languages, formal verification,

and cryptography.

Post-doctoral positions are for one year, with the possibility of

renewal for up to four years. Ph.D. positions are for four years,

subject to satisfactory progress. Starting date is negotiable.

Application materials are available at the URL:

When completing your application, please indicate Computer-Aided

Cryptographic Proofs in the research lines.

Applications must be received by January 30, 2012 to receive full

consideration. However, applications will continue to be accepted

until the positions are filled.