Now showing items 1-5 of 5
Linear size optimal q-ary constant-weight codes and constant-composition codes
An optimal constant-composition or constant-weight code of weight w has linear size if and only if its distance d is at least 2w-1. When d ≥ 2w, the determination of the exact size of such a constant-composition or ...
Practical pseudo-collisions for hash functions ARIRANG-224/384
In this paper we analyse the security of the SHA-3 candidate ARIRANG. We show that bitwise complementation of whole registers turns out to be very useful for constructing high-probability differential characteristics in ...
Cryptanalysis of the LAKE hash family
We analyse the security of the cryptographic hash function LAKE-256 proposed at FSE 2008 by Aumasson, Meier and Phan. By exploiting non-injectivity of some of the building primitives of LAKE, we show three different collision ...
On the constructions of constant-composition codes from perfect nonlinear functions
A new construction of constant-composition codes based on all known perfect nonlinear functions from Fqm to itself is presented, which provides a kind of unified constructions of constant-composition codes based on all ...
Properties and applications of preimage distributions of perfect nonlinear functions
The preimage distributions of perfect nonlinear functions from an Abelian group of order n to an Abelian group of order 3 or 4, respectively, are studied. Based on the properties of the preimage distributions of perfect ...