Sciweavers

DCC
2005
IEEE
14 years 4 months ago
The Near Resolvable 2-(13, 4, 3) Designs and Thirteen-Player Whist Tournaments
A v-player whist tournament is a schedule of games, where in each round the v players are partitioned into games of four players each with at most one player left over. In each ga...
Harri Haanpää, Petteri Kaski
DCC
2005
IEEE
14 years 4 months ago
One (96, 20, 4)-symmetric Design and related Nonabelian Difference Sets
New (96, 20, 4)-symmetric design has been constructed, unique under the assumption of an automorphism group of order 576 action. The correspondence between a (96, 20, 4)-symmetric ...
Anka Golemac, Tanja Vucicic, Josko Mandic
DCC
2005
IEEE
14 years 4 months ago
A Note on the Tight Spherical 7-Design in R23 and 5-Design in R7*
In this note we prove the uniqueness of the tight spherical 7-design in R23 consisting of 4600 vectors and with automorphism group 2 ? Co2 as well as the uniqueness of the tight s...
Hans Cuypers
DCC
2005
IEEE
14 years 4 months ago
Elliptic Curve Cryptosystems in the Presence of Permanent and Transient Faults
Elliptic curve cryptosystems in the presence of faults were studied by Biehl, Meyer and M?uller (2000). The first fault model they consider requires that the input point P in the c...
Mathieu Ciet, Marc Joye
DCC
2005
IEEE
14 years 4 months ago
Highly Nonlinear Resilient Functions Through Disjoint Codes in Projective Spaces
Functions which map n-bits to m-bits are important cryptographic sub-primitives in the design of additive stream ciphers. We construct highly nonlinear t-resilient such functions (...
Pascale Charpin, Enes Pasalic
DCC
2005
IEEE
14 years 4 months ago
On Goppa Codes and Weierstrass Gaps at Several Points
We generalize results of Homma and Kim [2001, J. Pure Appl. Algebra 162, 273?290] concerning an improvement on the Goppa bound on the minimum distance of certain Goppa codes.
Cícero Carvalho, Fernando Torres
DCC
2005
IEEE
14 years 4 months ago
Hyperelliptic Curves with Compact Parameters
We present a family of hyperelliptic curves whose Jacobians are suitable for cryptographic use, and whose parameters can be specified in a highly efficient way. This is done via co...
Ezra Brown, Bruce T. Myers, Jerome A. Solinas
DCC
2005
IEEE
14 years 4 months ago
Hyperbolic Fibrations and q-Clans
R. D. Baker, Gary L. Ebert, Tim Penttila
DCC
2005
IEEE
14 years 4 months ago
A Family of Binary (t, m, s)-Nets of Strength 5
(t, m, s)-nets were defined by Niederreiter [6], based on earlier work by Sobol' [7], in the context of quasi-Monte Carlo methods of numerical integration. Formulated in comb...
Jürgen Bierbrauer, Yves Edel
DCC
2005
IEEE
14 years 4 months ago
The Combinatorics of Dom de Caen
We give an overview of some of the mathematical results of Dominique de Caen. These include a short proof of K?onig's theorem, results on Tur?an numbers, biclique partitions,...
Edwin R. van Dam