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...
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 ...
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...
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...
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 (...
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.
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...
(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...
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,...