DCC
2003
IEEE
14 years 11 months ago
2003
IEEE
In this paper we discuss the security of digital signature schemes based on error? correcting codes. Several attacks to the Xinmei scheme are surveyed, and some reasons given to e...
DCC
2003
IEEE
14 years 11 months ago
2003
IEEE
Nguyen and Shparlinski recently presented a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few bits of the random nonces k (used at each s...
DCC
2003
IEEE
14 years 11 months ago
2003
IEEE
DCC
2003
IEEE
14 years 11 months ago
2003
IEEE
DCC
2003
IEEE
14 years 11 months ago
2003
IEEE
By Andr`e theory, it is well known how to algebraically convert a spread in a projective space to an equivalent spread (representing the same translation plane) in a projective sp...
DCC
2003
IEEE
14 years 11 months ago
2003
IEEE
DCC
2003
IEEE
14 years 11 months ago
2003
IEEE
DCC
2003
IEEE
14 years 11 months ago
2003
IEEE
Two ways of constructing maximal sets of mutually orthogonal Latin squares are presented. The first construction uses maximal partial spreads in PG(3, 4)\ PG(3, 2) with r lines, wh...
DCC
2003
IEEE
14 years 11 months ago
2003
IEEE
In this paper we construct an infinite series of (q + t, t)-arcs of type (0, 2, t). We show that this construction includes the Korchm?aros-Mazzocca arcs, and we gain new infinite...
DCC
2003
IEEE
14 years 11 months ago
2003
IEEE
We show that 40 is the maximum number of points of a cap in AG(4, 4). Up to semi-linear transformations there is only one such 40-cap. Its group of automorphisms is a semidirect p...