Sciweavers

DCC
2010
IEEE
13 years 11 months ago
Minimum distance of Hermitian two-point codes
In [8], the authors formulate new coset bounds for algebraic geometric codes. The bounds give improved lower bounds for the minumum distance of algebraic geometric codes as well a...
Seungkook Park
DCC
2010
IEEE
13 years 11 months ago
The cost of false alarms in Hellman and rainbow tradeoffs
Abstract Cryptanalytic time memory tradeoff algorithms are generic one-way function inversion techniques that utilize pre-computation. Even though the online time complexity is kno...
Jin Hong
DCC
2010
IEEE
13 years 11 months ago
Geometric and design-theoretic aspects of semibent functions I
The two parts of this paper consider combinatorial and geometric aspects of semibent functions. In the first part of this note we obtain 2
Ulrich Dempwolff, Timo Neumann
DCC
2010
IEEE
13 years 11 months ago
On quadratic APN functions and dimensional dual hyperovals
In this paper we characterize the d-dimensional dual hyperovals in PG(2d + 1, 2) that can be obtained by Yoshiara's construction [21] from quadratic APN functions and state a...
Yves Edel
DCC
2010
IEEE
13 years 11 months ago
A tight asymptotic bound on the size of constant-weight conflict-avoiding codes
In the study of multiple-access in the collision channel, conflict-avoiding code is used to guarantee that each transmitting user can send at least one packet successfully in the w...
Kenneth W. Shum, Wing Shing Wong
DCC
2010
IEEE
13 years 11 months ago
Some two-character sets
Some new examples of two
Antonio Cossidente, Oliver H. King
DCC
2010
IEEE
13 years 11 months ago
The small weight codewords of the functional codes associated to non-singular Hermitian varieties
This article studies the small weight codewords of the functional code CHerm(X), with X a non-singular Hermitian variety of PG(N, q2). The main result of this article is that the ...
Frédéric A. B. Edoukou, Anja Hallez,...
DCC
2010
IEEE
13 years 11 months ago
On multiple caps in finite projective spaces
In this paper, we consider new results on (k, n)-caps with n > 2. We provide a lower bound on the size of such caps. Furthermore, we generalize two product constructions for (k,...
Yves Edel, Ivan N. Landjev
DCC
2010
IEEE
13 years 11 months ago
Comparing two pairing-based aggregate signature schemes
In 2003, Boneh, Gentry, Lynn and Shacham (BGLS) devised the first provably-secure aggregate signature scheme. Their scheme uses bilinear pairings and their security proof is in the...
Sanjit Chatterjee, Darrel Hankerson, Edward Knapp,...
DCC
2010
IEEE
13 years 11 months ago
Practical unconditionally secure two-channel message authentication
We investigate unconditional security for message authentication protocols that are designed using two-channel cryptography. We look at both noninteractive message authentication ...
Atefeh Mashatan, Douglas R. Stinson