LAKE is a family of cryptographic hash functions presented at FSE 2008. It is an iterated hash function and defines two main instances with a 256 bit and 512 bit hash value. In this paper, we present the first security analysis of LAKE. We show how collision attacks, exploiting the non-bijectiveness of the internal compression function of LAKE, can be mounted on reduced variants of LAKE. We sho...

This is the first article analyzing the security of SHA-256 against fast collision search which considers the recent attacks by Wang et al. We show the limits of applying techniques known so far to SHA-256. Next we introduce a new type of perturbation vector which circumvents the identified limits. This new technique is then applied to the unmodified SHA-256. Exploiting the combination of Boole...

This paper presents high-speed assembly implementations of the 256-bit-output versions of all five SHA-3 finalists and of SHA-256 for the ARM11 family of processors. We report new speed records for all of the six implemented functions. For example our implementation of the round-3 version of JH-256 is 35% faster than the fastest implementation of the round-2 version of JH-256 in eBASH. Scaled w...

Introduction: Papillary carcinoma of the thyroid is commonest cancer in with an increasing incidence over past few decades. A subset papillary carcinomas was re-classified into “Non-invasive Follicular Thyroid Neoplasm papillary-like nuclear features” (NIFTP) late 2017, due to excellent prognosis they exhibit. Identification NIFTP important because surgical management and follow up similar foll...

Current legislation in the United Kingdom stipulates that horses should not be slaughtered within sight of one another. However, abattoir personnel anecdotally report that, for semi-feral unused to restraint, co-slaughtering alongside a conspecific could reduce distress through social buffering and improve safety, but there is lack evidence support this. CCTV footage from an English was assesse...

In this paper we examine the strength of AES-256 against the related-key impossible differential attack, following the work in [1] and [2]. Firstly, we present a carefully chosen relation between the related keys, which can be extended to 8-round(even more rounds) subkey differences. Then, we construct a 5.5-round related-key impossible differential. Using the differential, we present an attack...

In this paper, we describe a cache-timing attack against the stream cipher HC-256, which is the strong version of eStream winner HC128. The attack is based on an abstract model of cache timing attacks that can also be used for designing stream ciphers. From the observations made in our analysis, we derive a number of design principles for hardening ciphers against cache timing attacks.

The known 3-round distinguisher of Rijndael-256 is byteoriented and 2 plaintexts are needed to distinguish 3-round Rijndael from a random permutation. In this paper, we consider the influence of the order of the plaintexts and present a new 3-round distinguisher which only needs 32 plaintexts.

We describe two optical systems based on the radial basis function approach to pattern classification. An optical disk based system for handwritten character recognition is demonstrated. The optical system computes the Euclidean distance between an unknown input and 650 stored patterns at a demonstrated rate of 26,000 pattern comparisons per second. The ultimate performance of this system is li...

SHA-256 is a cryptographic hash function which was proposed in 2000 as a new generation of SHA functions and was adopted as FIPS standard in 2002. In this paper we will consider a SHA-256 variant and a SHACAL-2 variant in which every arithmetic addition is replaced by XOR operation. We call the SHA-256 variant SHA-2-XOR and the SHACAL-2 variant SHACAL-2-XOR respectively. We will present a diffe...