Now showing items 1-6 of 6
Generalization of Steane’s enlargement construction of quantum codes and applications
We generalize Steane’s enlargement construction of binary quantum codes to q-ary quantum codes. We then apply this result to BCH codes and the study of asymptotic bounds, and obtain improvements to the quantum BCH codes ...
Application of classical Hermitian self-orthogonal MDS codes to quantum MDS codes
In this paper, we first construct several classes of classical Hermitian self-orthogonal MDS codes. Through these classical codes, we are able to obtain various quantum MDS codes. It turns out that many of our quantum codes ...
List decodability at small radii
A′(n, d, e), the smallest ℓ for which every binary error-correcting code of length n and minimum distance d is decodable with a list of size ℓ up to radius e, is determined for all d ≥ 2e − 3. As a result, A′(n, d, e) is ...
On multidimensional linear cryptanalysis
Matsui’s Algorithms 1 and 2 with multiple approximations have been studied over 16 years. In CRYPTO’04, Biryukov et al. proposed a formal framework based on m statistically independent approximations. Started by Hermelin ...
Side-channel resistant crypto for less than 2,300 GE
A provably secure countermeasure against first order side-channel attacks was proposed by Nikova et al. (P. Ning, S. Qing, N. Li (eds.) International conference in information and communications security. Lecture notes in ...
256 bit standardized crypto for 650 GE – GOST revisited
The former Soviet encryption algorithm GOST 28147-89 has been standardized by the Russian standardization agency in 1989 and extensive security analysis has been done since. So far no weaknesses have been found and GOST ...