DCC
2007
IEEE
15 years 1 days ago
2007
IEEE
A general method for deriving an identity-based public key cryptosystem from a one-way function is described. We construct both ID-based signature schemes and ID-based encryption ...
DCC
2007
IEEE
15 years 1 days ago
2007
IEEE
Davis, Jedwab and Smith recently proved that there are no 2-dimensional Barker arrays except of size 2?2. We show that the existence of a (d+1)-dimensional Barker array implies th...
DCC
2007
IEEE
15 years 1 days ago
2007
IEEE
Many different divisible designs are already known. Some of them possess remarkable automorphism groups, so called dual translation groups. The existence of such an automorphism g...
DCC
2007
IEEE
15 years 1 days ago
2007
IEEE
We introduce the notion of an unrefinable decomposition of a 1-design with at most two block intersection numbers, which is a certain decomposition of the 1-designs collection of ...
DCC
2007
IEEE
15 years 1 days ago
2007
IEEE
The low-density attack proposed by Lagarias and Odlyzko is a powerful algorithm against the subset sum problem. The improvement algorithm due to Coster et al. would solve almost a...
DCC
2007
IEEE
15 years 1 days ago
2007
IEEE
Abstract. We present a general technique for the efficient computation of pairings on supersingular Abelian varieties. This formulation, which we call the eta pairing, generalises ...
DCC
2007
IEEE
15 years 1 days ago
2007
IEEE
We find lower bounds on the minimum distance and characterize codewords of small weight in low-density parity check codes defined by (dual) classical generalized quadrangles. We a...
DCC
2007
IEEE
15 years 1 days ago
2007
IEEE
The aim of this paper is to present a construction of t-divisible designs for t > 3, because such divisible designs seem to be missing in the literature. To this end, tools suc...
DCC
2007
IEEE
15 years 1 days ago
2007
IEEE
