CryptoDB

Toshiya Itoh

Publications

Year
Venue
Title
2005
EPRINT
Let $N(d,d^\perp)$ denote the minimum length $n$ of a linear code $C$ with $d$ and $d^{\bot}$, where $d$ is the minimum Hamming distance of $C$ and $d^{\bot}$ is the minimum Hamming distance of $C^{\bot}$. In this paper, we show a lower bound and an upper bound on $N(d,d^\perp)$. Further, for small values of $d$ and $d^\perp$, we determine $N(d,d^\perp)$ and give a generator matrix of the optimum linear code. This problem is directly related to the design method of cryptographic Boolean functions suggested by Kurosawa et al.
1999
JOFC
1997
JOFC
1996
JOFC
1994
CRYPTO
1993
CRYPTO
1992
AUSCRYPT
1992
AUSCRYPT
1992
CRYPTO
1991
ASIACRYPT
1991
ASIACRYPT
1991
EUROCRYPT
1990
AUSCRYPT
1990
EUROCRYPT

Asiacrypt 1994