DCC
2005
IEEE
14 years 7 months ago
2005
IEEE
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...
DCC
2005
IEEE
14 years 7 months ago
2005
IEEE
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 (...
DCC
2005
IEEE
14 years 7 months ago
2005
IEEE
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.
DCC
2005
IEEE
14 years 7 months ago
2005
IEEE
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...
DCC
2005
IEEE
14 years 7 months ago
2005
IEEE
DCC
2005
IEEE
14 years 7 months ago
2005
IEEE
(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...
DCC
2005
IEEE
14 years 7 months ago
2005
IEEE
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,...
DCC
2006
IEEE
14 years 7 months ago
2006
IEEE
This paper considers the development of a general framework for the analysis of transmit beamforming methods in multiple antenna systems with finite-rate feedback. Inspired by the...
DCC
2006
IEEE
14 years 7 months ago
2006
IEEE
DCC
2006
IEEE
14 years 7 months ago
2006
IEEE