International Association for Cryptologic Research

IACR News Central

Get an update on changes of the IACR web-page here. For questions, contact newsletter (at) iacr.org. 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).

2011-12-26
21:33 [Job][New] Ph.D. positions in applied cryptography / network security / privacy, University of Surrey, United Kingdom

  Open Ph.D. positions in applied cryptography, network security, and privacy-enhancing technologies are available in the Department of Computing at University of Surrey, UK starting in April 2012.

Prerequisites: Applications are welcome from university graduates and students close to graduation in mathematics, computer science, or information security. Successful applicants must show outstanding grades and have final thesis on a topic related to cryptography and information security. Applicants must further be citizens of the European Union.

How to Apply: Applications should be sent by email to mark (at) manulis.eu (in a single PDF document), containing a CV, a copy of academic transcripts, a short statement of motivation (incl. description of prior activities in the relevant areas), and one reference or a letter of recommendation. Applications will be processed until the positions are filled.





2011-12-23
16:53 [Event][New] ICITeS'2012: 2nd IEEE International Conference on Information Technology a

  Submission: 10 January 2012
Notification: 1 February 2012
From March 24 to March 26
Location: Sousse, Tunisia
More Information: www.icites.org/icites2012


08:04 [Job][New] Research Scientist, Temasek Laboratories, National University of Singapore

 

Temasek Laboratories at National University of Singapore is looking for a research scientist on stream ciphers especially on analysis of stream ciphers and theirs statistical tests.

Applicants should have PhD degree in Mathematics/Computer Science or related discipline, and proficiency in C/C++ programming.

Applications will be reviewed upon receipt.

For application information, please visit http://www.temasek-lab.nus.edu.sg/career/career.php. Interested candidates can contact Dr Tan Chik How tsltch (at) nus.edu.sg.



06:43 [Event][New] SHARCS 2012: Special-Purpose Hardware for Attacking Cryptographic Systems

  Submission: 23 January 2012
Notification: 17 February 2012
From March 17 to March 18
Location: Washington, DC, USA
More Information: http://2012.sharcs.org




2011-12-22
09:00 [Job][New] PhD position in Security of Industrial Control Systems, University of Twente

  The candidate is expected to joint and extent the ICS and SCADA-related research agenda of the DIES research group and contribute to our research in areas like host-based intrusion detection in ICS, automated device fingerprinting of ICS/SCADA devices, and security testing tools and methodologies for ICS/SCADA. He is also to contribute to the EU FP7 project CRISALIS, which aims at providing new means to secure critical infrastructure environments from targeted attacks, carried out by resourceful and motivated individuals.



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: http://www.iit.cnr.it/esorics2012/




2011-12-20
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[...]




2011-12-19
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: http://web.ftrai.org/aim2012


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: http://math.ucsd.edu/~kedlaya/ants10/index.html




2011-12-18
16:12 [Conf][EC] List of Accepted Papers

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