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:26 [Event][New] MIST 2012: Managing Insider Security Threats

  Submission: 31 July 2012
Notification: 31 August 2012
From November 8 to November 9
Location: Fukuoka, Japan
More Information:

15:42 [Event][New] ICISS 2012: 8th International Conference on Information Systems Security 2012

  Submission: 13 July 2012
Notification: 3 September 2012
From December 15 to December 19
Location: Guwahati, India
More Information:

11:01 [Event][Update] SCN 2012: 8th Conference on Security and Cryptography for Networks

  Submission: 3 May 2012
Notification: 15 June 2012
From September 5 to September 7
Location: Amalfi, Italy
More Information:

05:35 [Event][New] MMM-ACNS-2012: Sixth International Conference MMM-ACNS-2012

  Submission: 27 May 2012
Notification: 29 June 2012
From October 17 to October 20
Location: St. Petersburg, Russia
More Information:

07:32 [Event][New] SecureComm 2012: 8th International Conference on Security and Privacy in Communication Netwo

  Submission: 10 May 2012
Notification: 25 June 2012
From September 3 to September 5
Location: Padua, Italy
More Information:

07:29 [Job][New] Lecturer/Senior Lecturer in Computing (incl. IT Security and Crypto), 2 Positions, University of Surrey, United Kingdom

  University of Surrey


Department of Computing


Salary £37,012 up to £54,283 per annum (Lecturer to Senior Lecturer)

(Subject to qualifications and experience), Attractive relocation package

The University of Surrey offers high-calibre teaching, a world-class research base, a thriving postgraduate community and a high quality of life in a beautiful campus setting. At the same time we have a strong eye for innovation and enterprise and are at the forefront of developments in teaching and research.

The Department of Computing is very active in the following research areas: Formal Methods and Security, Multimedia Security and Forensics, Digital Ecosystems, and Nature Inspired Computing and Engineering.

We are currently seeking appointments at Lecturer or Senior Lecturer level to support the Department\'s continued growth by complementing our existing research strengths and contributing to the research leadership within the Department. Applications are welcome particularly in the areas of digital ecosystems, formal methods and security, multimedia security and forensics, biomedical signal and image processing, evolutionary computing and artificial intelligence. The Department is research-led with 70 RAs and PhD students, and is attracting growing research support from the UK Research Councils, the EU-IST, and industry. Major IT, telecommunication, and defence organisations are sponsoring research in the Department.

Applicants at the Lecturer level should have a relevant PhD, a developing track record in publication with demonstrable high potential in high-quality research and teaching. Applicants at the Senior Lecturer level will have an international research profile and a significant track record of high-quality publications in leading journals and conference proceedings.

11:18 [PhD][New] Joppe W. Bos: On the Cryptanalysis of Public-Key Cryptography

  Name: Joppe W. Bos
Topic: On the Cryptanalysis of Public-Key Cryptography
Category: public-key cryptography

Description: Nowadays, the most popular public-key cryptosystems are based on either the integer factorization or the discrete logarithm problem. The feasibility of solving these mathematical problems in practice are studied and techniques are presented to speed-up the underlying arithmetic on parallel architectures.\r\n

\r\nThe fastest known approach to solve the discrete logarithm problem in groups of elliptic curves over finite fields is the Pollard rho method. The negation map can be used to speed up this calculation by a factor \r\n? 2 . It is well known that the random walks used by Pollard rho when combined with the negation map get trapped in fruitless cycles. We show that previously published approaches to deal with this problem are plagued by recurring cycles, and we propose effective alternative countermeasures. Furthermore, fast modular arithmetic is introduced which can take advantage of prime moduli of a special form using efficient \"sloppy reduction.\" The effectiveness of these techniques is demonstrated by solving a 112-bit elliptic\r\ncurve discrete logarithm problem using a cluster of PlayStation 3 game consoles: breaking a public-key standard and setting a new world record.\r\n

\r\nThe elliptic curve method (ECM) for integer factorization is the asymptotically fastest method to find relatively small factors of large integers. From a cryptanalytic point of view the performance of ECM gives information about secure parameter choices of some cryptographic protocols. We optimize ECM by proposing carry-free arithmetic modulo Mersenne numbers (numbers of the form 2M-1) especially suitable for parallel architectures. Our implementation of these techniques on a cluster of PlayStation 3 game consoles set a new record by finding a 241-bit prime factor of 21181-1.\r\n

\r\nA normal form for elliptic curves introduced by Edwards results in the fastest elliptic curve arithmetic in practice. Techniques to reduce the temporary storage and enhance the pe[...]

11:18 [PhD][New] Arjen K. Lenstra

  Name: Arjen K. Lenstra

21:07 [PhD][New] Abdoul Aziz Ciss: Arithmétique et Extracteurs déterministes sur les courbes elliptiques

  Name: Abdoul Aziz Ciss
Topic: Arithmétique et Extracteurs déterministes sur les courbes elliptiques
Category: public-key cryptography

Description: In this thesis, we present a new deterministic randomness extractor for a finite field $\\mathbb{F}_{p^n}$ and a deterministic randomness extractor for an elliptic curve $E$ defined over $\\mathbb{F}_{p^n}$. We also introduce a new generalization of the Huff elliptic curves. The extractors we present in this thesis can be used to derive a random secret key at the end of the Diffie-Hellman key exchange.\r\n\r\nWe have shown under the DDH assumption over $\\mathbb{F}_{2^n}$ that the $k$-first coefficients in $\\mathbb{F}_{2}$ of a random element of a subgroup of $\\mathbb{F}_{2^n}$ are undistinguishable from a random bit-string of the same length.\r\n\r\nWe also have shown under the DDH assumption over an elliptic curve $E$ defined over $\\mathbb{F}_{2^n}$ that the $k$-first coefficients in $\\mathbb{F}_{2}$ of a random point of the curve are indistinguishable from a random bit-string of the same length.\r\n\r\nWe also introduce successfully computation of the Tate pairing on the general Huff curves and we have shown that the Tate pairing on these curves are efficient as in the standard Huff curves.[...]

21:06 [PhD][New] Djiby Sow: Semi-modules

  Name: Djiby Sow
Topic: Semi-modules

21:06 [PhD][New] Université Cheikh Anta Diop de Dakar-Sénégal

  Name: Université Cheikh Anta Diop de Dakar-Sénégal