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 [Job][New] Mobile Application Developers with , Cellcrypt, London, UK

  Cellcrypt is the leading provider of encrypted mobile phone voice calling with a track record in creating innovative products and solutions. The development team in Central London has opportunities for you to share in Cellcrypt’s exciting future.

You will take a key role in the development and continuing roll-out of Cellcrypt\\\'s secure voice mobile device applications, focusing on the BlackBerry platform in its evolution towards the new OS 10. You will perform hands-on mobile software development, within a small and highly focused product delivery team. Our dynamic and challenging work environment means you will also be involved in system-wide aspects of design and development.

Essential Skills and Experience (Key points - see our web site for details):

- 5+ years development experience

- Strong Mobile Application development experience

- Very fluent in C++ and Java, strong OOA/OOD

- Understanding of mobile device security, cryptography, etc.

- Understanding of VoIP (voice over internet protocol) and associated signalling and media technologies

- Experience of full software development lifecycle

- Eligible for, and willing to undertake, UK security clearance vetting if required

Please send your CV and covering letter to jobs (at)

NO AGENCIES PLEASE. Headhunters and recruitment agencies may not submit CVs/ resumes. Cellcrypt does not accept unsolicited headhunter and agency CVs. Cellcrypt will not pay fees to any third-party agency or company that does not have a signed agreement with the Company.

05:25 [Job][New] Post-Doc, Department of Electrical Engineering, Linköping University, Linköping, Sweden

  The position is within our project ”Secure systems for authentication using mobile units”

The Information Coding group at Institutionen för Systemteknik is active in several areas, such as security of quantum and classical information systems, security and robustness of optical fibre networks, systems biology, computer graphics, and organic electronics. The undergraduate teaching includes courses in information security, image coding, and computer graphics.

05:24 [Job][New] 2 Research Scientists, Temasek Laboratories, National University of Singapore, Singapore

  Temasek Laboratories at National University of Singapore, Singapore is seeking highly motivated professionals interested in conducting research in the area of cryptography.

Applicants are expected to have a PhD degree in Mathematics/Computer Science/Engineering and a strong background and experience in one or two of the following areas: stream ciphers, pseudorandom number generator, public-key cryptography (multivariate, leakage resilient, etc).

Preferred candidates are expected to be proficient in C/C++ language, a team worker and able to conduct independent research. Review of applications will start immediately and continue until positions are filled.

For application information, please visit

05:16 [Event][New] IJCSS: International Journal of Computer Science and Security

  Submission: 31 July 2012
Notification: 15 September 2012
From October 31 to October 31
More Information:

21:15 [Conf][Crypto]


05:16 [Event][New] PKC 2013: Public Key Cryptography 2013

  Submission: 10 September 2012
From February 26 to March 1
Location: Nara, Japan
More Information:

05:42 [Event][New] DATE 2013: Design Automation and Test in Europe - Topic Track on Secure Systems

  Submission: 9 September 2012
Notification: 16 November 2012
From March 18 to March 22
Location: Grenoble, France
More Information:

00:17 [Pub][JoC] Sequential Aggregate Signatures, Multisignatures, and Verifiably Encrypted Signatures Without Random Oracles


Abstract  We present the first aggregate signature, the first multisignature, and the first verifiably encrypted signature provably secure without random oracles. Our constructions derive from a novel application of a recent signature scheme due to Waters. Signatures in our aggregate signature scheme are sequentially constructed, but knowledge of the order in which messages were signed is not necessary for verification. The aggregate signatures obtained are shorter than Lysyanskaya et al.’s sequential aggregates and can be verified more efficiently than Boneh et al.’s aggregates. We also consider applications to secure routing and proxy signatures.

  • Content Type Journal Article
  • Pages 1-34
  • DOI 10.1007/s00145-012-9126-5
  • Authors

    • Steve Lu, Los Angeles, CA, USA
    • Rafail Ostrovsky, Los Angeles, CA, USA
    • Amit Sahai, Los Angeles, CA, USA
    • Hovav Shacham, La Jolla, CA, USA
    • Brent Waters, Austin, TX, USA

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

From: Fri, 22 Jun 2012 14:01:59 GMT

10:50 [Event][New] TCC2013: The Tenth Theoretical Cryptography Conference

  Submission: 1 September 2013
Notification: 1 December 2013
From March 3 to March 6
Location: Tokyo, Japan
More Information:

09:29 [PhD][New] Billy Bob Brumley: Covert Timing Channels, Caching, and Cryptography

  Name: Billy Bob Brumley
Topic: Covert Timing Channels, Caching, and Cryptography
Category: implementation

Description: Side-channel analysis is a cryptanalytic technique that targets not the formal description of a cryptographic primitive but the implementation of it. Examples of side-channels include power consumption or timing measurements. This is a young but very active field within applied cryptography. Modern processors are equipped with numerous mechanisms to improve the average performance of a program, including but not limited to caches. These mechanisms can often be used as side-channels to attack software implementations of cryptosystems. This area within side-channel analysis is called microarchitecture attacks, and those dealing with caching mechanisms cache-timing attacks. This dissertation presents a number of contributions to the field of side-channel analysis. The introductory portion consists of a review of common cache architectures, a literature survey of covert channels focusing mostly on covert timing channels, and a literature survey of cache-timing attacks, including selective related results that are more generally categorized as side-channel attacks such as traditional timing attacks. This dissertation includes eight publications relating to this field. They contain contributions in areas such as side-channel analysis, data cache-timing attacks, instruction cache-timing attacks, traditional timing attacks, and fault attacks. Fundamental themes also include attack mitigations and efficient yet secure software implementation of cryptosystems. Concrete results include, but are not limited to, four practical side-channel attacks against OpenSSL, each implemented and leading to full key recovery.[...]

10:42 [PhD][New] Sujoy Sinha Roy: Design and Analysis of Elliptic Curve Cryptosystems on FPGAs

  Name: Sujoy Sinha Roy
Topic: Design and Analysis of Elliptic Curve Cryptosystems on FPGAs
Category: implementation

Description: The thesis explores compact and efficient iplementation of elliptic curve cryptography (ECC) on hardware platforms over extended binary fields. \r\nEfficiency of an elliptic curve cryptoprocessor is largely affected by the underlying finite field primitives and by the architecture of the elliptic curve scalar multiplier (ECSM). The work presented in this thesis contributes in designing efficient finite field algorithms by utilizing the Lookup Tables (LUTs) present in FPGAs. The thesis develops a generalization of the Itoh-Tsujii inversion algorithm (ITA) to use higher exponentiation circuits instead of the conventional squaring circuits. Finally the thesis integrates efficient finite field primitives and explores the concept of pipelining to develop a high speed ECSM architecture. The delay of the critical paths of the ECSM architecture have been estimated by a theoretical model and have been split into optimal delay stages. The thesis develops optimal scheduling technique for pipelined ECSM architecture. The work analyzes the effect of increase in number of pipeline stages on the scalar multiplication time and estimates the optimal\r\nnumber of pipelined stages in the ECSM architecture for a given finite field. Finally detailed analysis, supported with experimental results have been provided to design the fastest reported scalar multiplier in GF(2^163). The proposed design has a three stage pipeline and takes less than 13 us, as compared to 20 us required in the previous best design by Chelton and Benaissa on Virtex 4 FPGAs. Notably, the current design has an area requirement of only 56% compared with the reported work, owing to the better LUT utilizations of the underlying finite field primitives.[...]