*22:17* [Pub][ePrint]
New Cube Root Algorithm Based on Third Order Linear Recurrence Relation in Finite Field, by Gook Hwa Cho and Namhun Koo and Eunhye Ha and Soonhak Kwon
In this paper, we present a new cube root algorithm in finitefield $\\mathbb{F}_{q}$ with $q$ a power of prime, which extends

the Cipolla-Lehmer type algorithms \\cite{Cip,Leh}. Our cube root

method is inspired by the work of M\\\"{u}ller \\cite{Muller} on

quadratic case. For given cubic residue $c \\in \\mathbb{F}_{q}$

with $q \\equiv 1 \\pmod{9}$, we show that there is an irreducible

polynomial $f(x)=x^{3}-ax^{2}+bx-1$ with root $\\alpha \\in

\\mathbb{F}_{q^{3}}$ such that $Tr(\\alpha^{\\frac{q^{2}+q-2}{9}})$

is a cube root of $c$. Consequently we find an efficient cube root

algorithm based on third order linear recurrence sequence arising

from $f(x)$. Complexity estimation shows that our algorithm is

better than previously proposed Cipolla-Lehmer type algorithms.

*22:17* [Pub][ePrint]
The IITM Model: a Simple and Expressive Model for Universal Composability, by Ralf Kuesters and Max Tuengerthal
The universal composability paradigm allows for the modular design and analysis of cryptographic protocols. It has been widely and successfully used in cryptography. However, devising a coherent yet simple and expressive model for universal composability is, as the history of such models shows, highly non-trivial. For example, several partly severe problems have been pointed out in the literature for the UC model.In this work, we propose a coherent model for universal composability, called the IITM model (``Inexhaustible Interactive Turing Machine\'\'). A main feature of the model is that it is stated without a priori fixing irrelevant details, such as a specific way of addressing of machines by session and party identifiers, a specific modeling of corruption, or a specific protocol hierarchy. In addition, we employ a very general notion of runtime. All reasonable protocols and ideal functionalities should be expressible based on this notion in a direct and natural way, and without tweaks, such as (artificial) padding of messages or (artificially) adding extra messages.

Not least because of these features, the model is simple and expressive. Also the general results that we prove, such as composition theorems, hold independently of how such details are fixed for concrete applications.

Being inspired by other models for universal composability, in particular the UC model and because of the flexibility and expressivity of the IITM model, conceptually, results formulated in these models directly carry over to the IITM model.

*22:17* [Pub][ePrint]
RSA private key reconstruction from random bits using SAT solvers, by Constantinos Patsakis
SAT solvers are being used more and more in Cryptanalysis, with mixed results regarding their efficiency, depending on the structure of the algorithm they are applied. However, when it comes to integer factorization, or more specially the RSA problem, SAT solvers prove to be at least inefficient. The running times are too long to be compared with any well known integer factorization algorithm, even when it comes to small RSA moduli numbers. The recent work on cold boot attacks has sparkled again the interest on partial key exposure attacks and in RSA key reconstruction. In our work, contrary to the lattice-based approach that most of these

works use, we use SAT solvers. For the special case where the public exponent $e$ is equal to three, we provide a more efficient modeling of RSA as an instance of a satisfiability problem, and manage to reconstruct the private key, given a part of the key, even for public keys of 1024 bits in few seconds.

*05:54* [Job][New]
Associate or Assistant Professor in Cryptology , *Technical University of Denmark*
DTU Compute at the Technical University of Denmark calls for applications for a position as associate or assistant professor. The department is looking for a dynamic faculty member to participate in research and teaching in cryptology.

The position is available from 1 May 2013.

For further information and to apply please follow the guidelines from the job page.

*05:53* [Job][New]
Ph.D. student, *University of Paderborn, Faculty for Electrical Engineering, Computer Science and Mathematics*
The following tasks shall be conveyed to the employee:1. research in public-key cryptography

2. contribution to the lecturing of the faculty.

Conditions of employment:

The applicant is required to have very good knowledge of the following topics:

1. complexity theory

2. cryptography

3. number theory.

The Master in Computer Science or a similar field is the condition of employment. It is expected of any candidate that a doctorate´s degree is or will be pursued.

The University of Paderborn has been awarded with the rating TOTAL E-QUALITY with view to an administrative and human resource policy that is ideally directed toward non-discrimination and equal opportunity as well as the certificate “audit family fair-minded university” (of a non-profit organisation) with view to the successful implementation of improvements to the compatability of studying, job and family-life.

We specifically welcome candidatures of women and will, according to the State Equal Oppourtunities Act (“Landesgleichstellungsgesetz NRW”) prefer these among candidatures of the same aptitude, qualification and certificates of competence if not personal reasons in favour of a competitor decide. A part time employment is possible, in principle. Candidatures of seriously handicapped persons and the same according to the Code of Social Law (“Sozialgesetzbuch Neuntes Buch - SGB IX”) are welcome just the same.

The staff council of the academic personnel and artists of the University of Paderborn (WPR) will be involved in the interviewing if a candidate wishes so.