*05:26* [Job][New]
Postdoctoral and Research Fellowships, *Queensland University of Technology, Brisbane, Australia*
The Queensland University of Technology (QUT) in Brisbane, Australia, invites applications for its 2012 Vice-Chancellor\'s Research Fellowships. Up to 10 fellowships are available across the university. Areas of interest include all aspects of information security.

QUT has an active research group in cryptography, network security, and digital forensics, with a leading national profile and strong international links.

Applicants for a Postdoctoral Fellowship should have completed (or be under examination for) a PhD and be early career researchers (less than five years in an academic role). Applicants for a Research Fellowship should be established researchers with between five and ten years of research experience since completion of their PhD. Fellows will be offered an appointment on a fixed-term full-time basis for a period of 3 years. Fellowships include a research support grant of $20,000.

*08:23* [PhD][Update]
Nicky Mouha: Automated Techniques for Hash Function and Block Cipher Cryptanalysis
Name: Nicky Mouha

Topic: Automated Techniques for Hash Function and Block Cipher Cryptanalysis

Category:secret-key cryptography

Description: Cryptography is the study of mathematical techniques that ensure the confidentiality and integrity of information. This relatively new field started out as classified military technology, but has now become commonplace in our daily lives. Cryptography is not only used in banking cards, secure websites and electronic signatures, but also in public transport cards, car keys and garage door openers.

Two building blocks in the domain of cryptography are *block ciphers* and *(cryptographic) hash functions*. Block ciphers use a secret key to transform a plaintext into a ciphertext, in such a way that this secret key is needed to recover the original plaintext. Hash functions transform an arbitrary-length message into a fixed-length hash value. These hash values can serve as "fingerprints" for the original messages: it should be infeasible to find two distinct messages with the same hash value (a collision).

Yet, Wang et al. recently showed that finding collisions is feasible for MD5 and SHA-1, two of the most commonly used hash functions today. Although the SHA-2 family currently remains unbroken, its design is very similar. For this reason, the United States National Institute of Standards and Technology (NIST) launched an international competition for a new hash function standard: SHA-3.

The research performed in this Ph.D. thesis closely follows the evaluation period of the SHA-3 competition. Results were obtained for hash functions ARIRANG, BLAKE, ESSENCE, Hamsi, Khichidi-1, LUX, Sarmal, Skein and TIB3. Outside of the competition, results were also obtained for a simplified version of the hash function HAS-V. In the area of cryptographic theory, observations were made on the resistance of regular hash functions against the birthday attack.

The most commonly used hash functions: MD5, SHA-1 and SHA-2, as well two out of the five SHA-3 finalists (BLAKE and Skein) use operations such as addition modulo 2 to the power o[...]

*06:17* [Pub][ePrint]
The Discrete Logarithm Problem in non-representable rings, by Matan Banin and Boaz Tsaban
Bergman\'s Ring $E_p$, parameterized by a prime number $p$,is a ring with $p^5$ elements that cannot be embedded in a ring of matrices over any commutative ring.

This ring was discovered in 1974.

In 2011, Climent, Navarro and Tortosa described an efficient implementation of $E_p$

using simple modular arithmetic, and suggested that this ring may be a useful source

for intractable cryptographic problems.

We present a deterministic polynomial time reduction of the Discrete Logarithm Problem in $E_p$

to the classical Discrete Logarithm Problem in $\\Zp$, the $p$-element field.

In particular, the Discrete Logarithm Problem in $E_p$ can be solved, by conventional computers,

in sub-exponential time.

Along the way, we collect a number of useful basic reductions for the toolbox of discrete logarithm solvers.

*06:17* [Pub][ePrint]
3D Hardware Canaries, by Sébastien Briais and Stéphane Caron and Jean-Michel Cioranesco and Jean-Luc Danger and Sylvain Guilley and Jacques-Henri Jourdan and Arthur Milchior and David Naccache and T
3D integration is a promising advanced manufacturing process offering a variety of new hardware security protection opportunities. This paper presents a way of securing 3D ICs using Hamiltonian paths as hardware integrity verification sensors. As 3D integration consists in the stacking of many metal layers, one can consider surrounding a security-sensitive circuit part by a wire cage.After exploring and comparing different cage construction strategies (and reporting preliminary implementation results on silicon), we introduce a \"hardware canary\". The canary is a spatially distributed chain of functions $F_i$ positioned at the vertices of a 3D cage surrounding a protected circuit. A correct answer $(F_n \\circ \\ldots \\circ F_1)(m)$ to a challenge $m$ attests the canary\'s integrity.

*06:17* [Pub][ePrint]
A note on generalized bent criteria for Boolean functions, by Sugata Gangopadhyay, Enes Pasalic and Pantelimon Stanica
In this paper, we consider the spectra of Boolean functionswith respect to the action of unitary transforms obtained by

taking tensor products of the Hadamard, denoted by $H$, and the

nega--Hadamard, denoted by $N$,

kernels. The set of all such transforms is denoted by $\\{H, N\\}^n$.

A Boolean function is said to be bent$_4$ if its spectrum

with respect to at least one unitary transform in $\\{H, N\\}^n$ is flat.

We prove that the maximum possible algebraic degree of a bent$_4$

function on $n$ variables is $\\lceil \\frac{n}{2} \\rceil$, and hence

solve an open problem posed by Riera and Parker [cf. IEEE-IT: 52(2)(2006) 4142--4159].

We obtain a relationship between bent and bent$_4$ functions which is

a generalization of the relationship between bent and negabent Boolean

functions proved by Parker and Pott [cf. LNCS: 4893(2007) 9--23].